Finds all automorphisms on a given poset. Determines all of the possible permutations that are automorphisms and counts them. Additionally, there is a checker that takes in a poset and a permutation, and then determines if the permutation is an automorphism

C program to display whether the given relation represents partial ordering poset and equivalence relation or not.

LaTeX package for Hasse diagrams of partially ordered sets (in mathematics of finite partial orders and in causal set theory).

Implementation of product in poset category (binary tree).

Implementation of product in total poset category.

Implementation of product in powerset poset category.

Example to illustrate how to implement a Poset in Java

Public mirror of researches in the area of version tracking

An optimization problem that deals with determining a minimum set of tree posets that cover a given input of linear orders

Programming languages and tools I

[MOVED] Partially Ordered Sets

This R package contains a function to apply MARMoT balancing technique, a function for computing the Deloof's approximation of the average rank (and also a parallelized version) and a function to compute the Absolute Standardized Bias.

Python library to manage Lattice and Ordered Set