AbstractThe second author has introduced non-crossing tableaux, objects whose non-nesting analogues are semi-standard Young tableaux. We relate non-crossing tableaux to Gelfand–Tsetlin patterns and develop the non-crossing analogue of standard monomial theory. Leclerc and Zelevinsky's weakly separated sets are special cases of non-crossing tableaux, and we suggest that non-crossing tableaux may help illuminate the theory of weakly separated sets
30 pagesNon-forking is one of the most important notions in modern model theory capturing the idea o...
This thesis deals with three different aspects of the combinatorics of permutations. In the first tw...
AbstractA generalization of the notion of standard Young tableau has recently arisen from work on th...
AbstractThe second author has introduced non-crossing tableaux, objects whose non-nesting analogues ...
AMS Subject Classication: 05E99, 05A99 Abstract. In combinatorics there is a well-known duality betw...
Baumeister B, Bux K-U, Götze F, Kielak D, Krause H. Non-crossing partitions. arXiv:1903.01146. 2019....
AbstractWe define a class Ln,k of permutations that generalizes alternating (up–down) permutations a...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
AbstractWe interpret noncrossing partitions of type B and type D in terms of noncrossing partitions ...
the most diverse of settings. Some obvious examples exhibiting this intrusive type of behavior inclu...
AbstractWe introduce analogues of the lattice of non-crossing set partitions for the classical refle...
Jeu de taquin is a well-known operation on standard Young tableaux that may be used to define an equ...
Abstract. We consider two problems that appear at first sight to be unre-lated. The first problem is...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We extend the Robinson-Schensted-Knuth insertion procedure to tableaux over totally ordered sets and...
30 pagesNon-forking is one of the most important notions in modern model theory capturing the idea o...
This thesis deals with three different aspects of the combinatorics of permutations. In the first tw...
AbstractA generalization of the notion of standard Young tableau has recently arisen from work on th...
AbstractThe second author has introduced non-crossing tableaux, objects whose non-nesting analogues ...
AMS Subject Classication: 05E99, 05A99 Abstract. In combinatorics there is a well-known duality betw...
Baumeister B, Bux K-U, Götze F, Kielak D, Krause H. Non-crossing partitions. arXiv:1903.01146. 2019....
AbstractWe define a class Ln,k of permutations that generalizes alternating (up–down) permutations a...
We introduce the notions of Schröder shapes and Schröder tableaux, which provide an analog of the cl...
AbstractWe interpret noncrossing partitions of type B and type D in terms of noncrossing partitions ...
the most diverse of settings. Some obvious examples exhibiting this intrusive type of behavior inclu...
AbstractWe introduce analogues of the lattice of non-crossing set partitions for the classical refle...
Jeu de taquin is a well-known operation on standard Young tableaux that may be used to define an equ...
Abstract. We consider two problems that appear at first sight to be unre-lated. The first problem is...
We describe a correspondence between a family of labelled partially ordered sets and semi-standard Y...
We extend the Robinson-Schensted-Knuth insertion procedure to tableaux over totally ordered sets and...
30 pagesNon-forking is one of the most important notions in modern model theory capturing the idea o...
This thesis deals with three different aspects of the combinatorics of permutations. In the first tw...
AbstractA generalization of the notion of standard Young tableau has recently arisen from work on th...
DOI
Add to ORKG