Related papers: A non-crossing standard monomial theory
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, Standard Bitableaux. We adopt a…
We introduce a new class of reflection groups associated with the canonical bilinear lattices of Lenzing, which we call reflection groups of canonical type. The main result of this work is a categorification of the corresponding poset of…
Noncrossing arc diagrams are combinatorial models for permutations that encode information about lattice congruences of the weak order and about the associated discrete geometry. In this paper, we consider two related, analogous models for…
Higher-order notions of Kreweras complementation have appeared in the literature in the works of Krawczyk, Speicher, Mastnak, Nica, Arizmendi, Vargas, and others. While the theory has been developed primarily for specific applications in…
We consider two bases for an arbitrary finite dimensional irreducible representation of a complex special linear Lie algebra: the classical Gelfand-Tsetlin basis and the relatively new Chari-Loktev basis. Both are parametrized by the set of…
In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…
We prove that the generalised non-crossing partitions associated to well-generated complex reflection groups of exceptional type obey two different cyclic sieving phenomena, as conjectured by Armstrong, respectively by Bessis and Reiner.…
We consider the method of alternating projections for finding a point in the intersection of two closed sets, possibly nonconvex. Assuming only the standard transversality condition (or a weaker version thereof), we prove local linear…
We consider two problems that appear at first sight to be unrelated. The first problem is to count certain diagrams consisting of noncrossing arcs in the plane. The second problem concerns the weak order on the symmetric group. Each…
It is well known that the number of distinct non-crossing matchings of $n$ half-circles in the half-plane with endpoints on the x-axis equals the $n^{th}$ Catalan number $C_n$. This paper generalizes that notion of linear non-crossing…
The theory of pictures between posets is known to encode much of the combinatorics of symmetric group representations and related topics such as Young diagrams and tableaux. Many reasons, com-binatorial (e.g. since semi-standard tableaux…
Motivated by recent work on mixtures of classical and free probabilities, we introduce and study the notion of $\epsilon$-noncrossing partitions. It is shown that the set of such partitions forms a lattice, which interpolates as a poset…
We submit a new way to detect pairs of non-cobordant surface-links. We find a new example of a pair of non-cobordant surface-links with the following properties: Orr invariant, Cochran sequence, Sato-Levine invariant, the alinking number…
We study a natural generalization of the noncrossing relation between pairs of elements in [n] to k-tuples in [n] that was first considered by Petersen, Pylyavskyy, Speyer (2010). We give an alternative approach to their result that the…
We give a crystal structure on the set of Gelfand-Tsetlin patterns which parametrize bases for finite-dimensional irreducible representations of the general linear Lie algebra. The crystal data are given in closed form, expressed using…
In this paper it is shown that every non-periodic ergodic system has two topologically weakly mixing, fully supported models: one is non-minimal but has a dense set of minimal points; and the other one is proximal. Also for independent…
Given a set of $n$ men represented by $n$ points lying on a line, and $n$ women represented by $n$ points lying on another parallel line, with each person having a list that ranks some people of opposite gender as his/her acceptable…
Richardson tableaux are a remarkable subfamily of standard Young tableaux introduced by Karp and Precup in order to index the irreducible components of Springer fibers equal to Richardson varieties. We show that the set of insertion…
In this paper, we introduce polynomial time algorithms that generate random 3-noncrossing partitions and 2-regular, 3-noncrossing partitions with uniform probability. A 3-noncrossing partition does not contain any three mutually crossing…
We interpret noncrossing partitions of type $B$ and type $D$ in terms of noncrossing partitions of type $A$. As an application, we get type-preserving bijections between noncrossing and nonnesting partitions of type $B$, type $C$ and type…