Related papers: On cobweb posets and their combinatorially admissi…
We propose a notion of a generalized order, which can be used for the notion of a strict partial order. We introduce a weak order to replace the usual weak order defined from a strict partial order. In a constructive setting, that usual…
Given two finite posets P and Q, P is a chain minor of Q if there exists a partial function f from the elements of Q to the elements of P such that for every chain in P there is a chain C_Q in Q with the property that f restricted to C_Q is…
We study the coarse classification of partial orderings using chain conditions in the context of descriptive combinatorics. We show that (unlike the Borel counterpart of many other combinatorics), we have a distinct hierarchy of different…
This paper has been withdrawn by the authors due to a crucial computational error. In this paper we deal with the finite case. We prove that a finite bounded ordered set can be represented as the order of principal congruences of a finite…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We give a representation of directed graphs by k-posets; this provides a new proof of the universality of the homomorphism order of k-posets. This…
A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point-disjoint blocks. We prove that if a partial Steiner triple…
A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…
When an algebraic logic based on a poset instead of a lattice is investigated then there is a natural problem how to introduce the connective implication to be everywhere defined and satisfying (left) adjointness with the connective…
The aim of the present paper is to show that the concept of intuitionistic logic based on a Heyting algebra can be generalized in such a way that it is formalized by means of a bounded poset. In this case it is not assumed that the poset is…
The easy-hard-easy pattern in the difficulty of combinatorial search problems as constraints are added has been explained as due to a competition between the decrease in number of solutions and increased pruning. We test the generality of…
The paper presents complexity results and performance guaranties for a family of approximation algorithms for an optimisation problem arising in software testing and manufacturing. The problem is formulated as a partitioning of a set where…
Extending the work of Yakoubov, we enumerate the linear extensions of comb posets that avoid certain length-$3$ patterns. We resolve many of Yakoubov's open problems and prove both of the conjectures from her paper.
Every partial applicative structure gives rise to an indexed binary relation, that is a contravariant functor from the category of sets to the category of sets endowed with binary relations and maps preserving them. In this paper we…
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the…
We characterize the order of principal congruences of a bounded lattice (also of a complete lattice and of a lattice of length 5) as a bounded ordered set. We also state a number of open problems in this new field.
We call a poset factorable if its characteristic polynomial has all positive integer roots. Inspired by inductive and divisional freeness of a central hyperplane arrangement, we introduce and study the notion of inductive posets and their…
The classical satisfiability problem (SAT) is used as a natural and general tool to express and solve combinatorial problems that are in NP. We postulate that provability for implicational intuitionistic propositional logic (IIPC) can serve…
A brief introduction to the theory of ordered sets and lattice theory is given. To illustrate proof techniques in the theory of ordered sets, a generalization of a conjecture of Daykin and Daykin, concerning the structure of posets that can…