AbstractWe describe a correspondence between a family of labelled partially ordered sets and semistandard Young tableaux. Moreover, we define some operations among labelled posets which naturally correspond to operations among the associated semistandard Young tableaux
AbstractWe define a new object, called a signed poset, that bears the same relation to the hyperocta...
We introduce in this paper the marked chain-order polytopes associated to a marked poset, generalizi...
AbstractLet P be a finite partially ordered set with a fixed labeling. The sign of a linear extensio...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
AbstractWe describe a correspondence between a family of labelled partially ordered sets and semista...
We define \(P\)-strict labelings for a finite poset \(P\) as a generalization of semistandard Young ...
We define \(P\)-strict labelings for a finite poset \(P\) as a generalization of semistandard Young ...
We present a recursive procedure that directly associates a Young tableau to an arbitrary finite pos...
We present a recursive procedure that directly associates a Young tableau to an arbitrary finite pos...
We present a recursive procedure that directly associates a Young tableau to an arbitrary finite pos...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspi...
AbstractLet P be a naturally labelled, ranked (graded) poset of rank r and cardinality n. Let Hk be ...
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We giv...
AbstractWe define a new object, called a signed poset, that bears the same relation to the hyperocta...
We introduce in this paper the marked chain-order polytopes associated to a marked poset, generalizi...
AbstractLet P be a finite partially ordered set with a fixed labeling. The sign of a linear extensio...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
AbstractWe describe a correspondence between a family of labelled partially ordered sets and semista...
We define \(P\)-strict labelings for a finite poset \(P\) as a generalization of semistandard Young ...
We define \(P\)-strict labelings for a finite poset \(P\) as a generalization of semistandard Young ...
We present a recursive procedure that directly associates a Young tableau to an arbitrary finite pos...
We present a recursive procedure that directly associates a Young tableau to an arbitrary finite pos...
We present a recursive procedure that directly associates a Young tableau to an arbitrary finite pos...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspi...
AbstractLet P be a naturally labelled, ranked (graded) poset of rank r and cardinality n. Let Hk be ...
Partially ordered sets labeled with k labels (k-posets) and their homomorphisms are examined. We giv...
AbstractWe define a new object, called a signed poset, that bears the same relation to the hyperocta...
We introduce in this paper the marked chain-order polytopes associated to a marked poset, generalizi...
AbstractLet P be a finite partially ordered set with a fixed labeling. The sign of a linear extensio...
DOI
Add to ORKG