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
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
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 introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
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 ...
In this paper, the notion of derivation on partially ordered sets or posets is introduced and studie...
The theory of pictures between posets is known to encode much of the combinatorics of symmetric grou...
Partially ordered sets labeled with k labels (k-posets) and their homomor-phisms are examined. The h...
Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspi...
The theory of pictures between posets is known to encode much of the combinatorics of symmetric grou...
AbstractLet SYTn be the set of all standard Young tableaux with n cells. After recalling the definit...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
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 introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
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 ...
In this paper, the notion of derivation on partially ordered sets or posets is introduced and studie...
The theory of pictures between posets is known to encode much of the combinatorics of symmetric grou...
Partially ordered sets labeled with k labels (k-posets) and their homomor-phisms are examined. The h...
Promotion and rowmotion are intriguing actions in dynamical algebraic combinatorics which have inspi...
The theory of pictures between posets is known to encode much of the combinatorics of symmetric grou...
AbstractLet SYTn be the set of all standard Young tableaux with n cells. After recalling the definit...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
summary:We extend the notion of a relatively pseudocomplemented meet-semilattice to arbitrary posets...
DOI
Add to ORKG