Add to ORKGAMS Subject Classication: 05E99, 05A99 Abstract. In combinatorics there is a well-known duality between non-nesting and non-crossing objects. In algebra there are many objects which are standard, for example, standard Young tableaux, standard monomials, and standard bitableaux. We adopt a point of view that these standard objects are really non-nesting, and we nd their non-crossing counterparts
Abstract. We present results on the enumeration of crossings and nestings for matchings and set part...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
The goal of this monograph is to give an accessible introduction to nonstandard methods and their ap...
AbstractThe second author has introduced non-crossing tableaux, objects whose non-nesting analogues ...
Baumeister B, Bux K-U, Götze F, Kielak D, Krause H. Non-crossing partitions. arXiv:1903.01146. 2019....
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretat...
We study bijections { Set partitions of type X} −̃ → { Set partitions of type X} for X ∈ {A,B,C,D},...
AbstractBijections are presented between certain classes of trees and multichains in non-crossing pa...
the most diverse of settings. Some obvious examples exhibiting this intrusive type of behavior inclu...
Jeu de taquin is a well-known operation on standard Young tableaux that may be used to define an equ...
AbstractWe interpret noncrossing partitions of type B and type D in terms of noncrossing partitions ...
Abstract. We present a beautiful interplay between combinatorial topology and homological algebra fo...
Abstract. We consider two problems that appear at first sight to be unre-lated. The first problem is...
AbstractThe origin of this work is based on the enumeration of stack sortable permutations [11, 17, ...
It is well-known that monads are monoids in the category of endofunctors, and in fact so are applica...
Abstract. We present results on the enumeration of crossings and nestings for matchings and set part...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
The goal of this monograph is to give an accessible introduction to nonstandard methods and their ap...
AbstractThe second author has introduced non-crossing tableaux, objects whose non-nesting analogues ...
Baumeister B, Bux K-U, Götze F, Kielak D, Krause H. Non-crossing partitions. arXiv:1903.01146. 2019....
We give a parity reversing involution on noncrossing trees that leads to a combinatorial interpretat...
We study bijections { Set partitions of type X} −̃ → { Set partitions of type X} for X ∈ {A,B,C,D},...
AbstractBijections are presented between certain classes of trees and multichains in non-crossing pa...
the most diverse of settings. Some obvious examples exhibiting this intrusive type of behavior inclu...
Jeu de taquin is a well-known operation on standard Young tableaux that may be used to define an equ...
AbstractWe interpret noncrossing partitions of type B and type D in terms of noncrossing partitions ...
Abstract. We present a beautiful interplay between combinatorial topology and homological algebra fo...
Abstract. We consider two problems that appear at first sight to be unre-lated. The first problem is...
AbstractThe origin of this work is based on the enumeration of stack sortable permutations [11, 17, ...
It is well-known that monads are monoids in the category of endofunctors, and in fact so are applica...
Abstract. We present results on the enumeration of crossings and nestings for matchings and set part...
International audienceWe investigate the enumeration of non-crossing tree realizations of integer se...
The goal of this monograph is to give an accessible introduction to nonstandard methods and their ap...