AbstractWe present a conjecture concerning the optimal structure of a subset pair satisfying two dual requirements in a lattice that can be derived as the product of k finite length chains. The conjecture is proved for k=2
none3We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a ...
In an earlier paper on differential posets, two lattices Fib(r) and Z(r) were defined for each posit...
Abstract. We prove that a bounded poset of finite length is a lattice if and only if the following c...
We present a conjecture concerning the optimal structure of a subset pair satisfying two dual requir...
Ahlswede R, Simonyi G. On the optimal structure of recovering set pairs in lattices: the sandglass c...
AbstractWe present a conjecture concerning the optimal structure of a subset pair satisfying two dua...
A pair $(\mathcal{A},\mathcal{B})$ of families of subsets of an $n$-element set is called cancellati...
AbstractLet L be a lattice of divisors of an integer (isomorphically, a direct product of chains). W...
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
The (A,D) duality pairs play a crucial role in the theory of general relational struc-tures and in C...
Let T be a collection of 3-element subsets S of {1,…,n} with the property that if i<j<k and a<b<c ...
AbstractTwo duality theorems are proved about the direct product of two partial orders. First, the s...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
International audienceWe establish a formal connection between algorithmic correspondence theory and...
AbstractWe classify n-dimensional pairs of dual lattices by their minimal vectors. This leads to the...
none3We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a ...
In an earlier paper on differential posets, two lattices Fib(r) and Z(r) were defined for each posit...
Abstract. We prove that a bounded poset of finite length is a lattice if and only if the following c...
We present a conjecture concerning the optimal structure of a subset pair satisfying two dual requir...
Ahlswede R, Simonyi G. On the optimal structure of recovering set pairs in lattices: the sandglass c...
AbstractWe present a conjecture concerning the optimal structure of a subset pair satisfying two dua...
A pair $(\mathcal{A},\mathcal{B})$ of families of subsets of an $n$-element set is called cancellati...
AbstractLet L be a lattice of divisors of an integer (isomorphically, a direct product of chains). W...
Homomorphism duality pairs play a crucial role in the theory of relational structures and in the Con...
The (A,D) duality pairs play a crucial role in the theory of general relational struc-tures and in C...
Let T be a collection of 3-element subsets S of {1,…,n} with the property that if i<j<k and a<b<c ...
AbstractTwo duality theorems are proved about the direct product of two partial orders. First, the s...
AbstractAharoni and Korman (Order 9 (1992) 245) have conjectured that every ordered set without infi...
International audienceWe establish a formal connection between algorithmic correspondence theory and...
AbstractWe classify n-dimensional pairs of dual lattices by their minimal vectors. This leads to the...
none3We exhibit a recursive procedure that enables us to construct a maximal union of k chains in a ...
In an earlier paper on differential posets, two lattices Fib(r) and Z(r) were defined for each posit...
Abstract. We prove that a bounded poset of finite length is a lattice if and only if the following c...
DOI
Add to ORKG