Related papers: Two Partial Orders for Standard Young Tableaux
The paper examines a partial order on bipartite graphs (X1, X2, E) with n vertices, X1UX2={1,2,...,n}. This partial order is a natural partial order of subobjects of an object in a triangular category with bipartite graphs as morphisms.
We prove that any group acting faithfully on a bifoliated plane while preserving the orientations of both foliations is left-orderable. The proof utilizes a construction of a linear order on the set of ends of the leaf spaces, which takes…
The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. A method for determining non-isomorphic principal order ideals is described and applied for small lengths. The permutations…
We introduce notions of linear reduction and linear equivalence of bijections for the purposes of study bijections between Young tableaux. Originating in Theoretical Computer Science, these notions allow us to give a unified view of a…
We prove that the symmetric group $S_n$ has a unique minimal cover $\mathcal{M}$ by maximal nilpotent subgroups, and we obtain an explicit and easily computed formula for the order of $\mathcal{M}$. In addition, we prove that the order of…
We investigate the combinatorial structure of unrefinable partitions through their correspondence with numerical sets and Young diagrams. Building on the bijection introduced by Keith and Nath, we apply a general geometric criterion that…
Specht polynomials classically realize the irreducible representations of the symmetric group. The ideals defined by these polynomials provide a strong connection with the combinatorics of Young tableaux and have been intensively studied by…
Denote by $N \subset SL_k$ the subgroup of unipotent upper triangular matrices. In this paper, we show that the dual canonical basis of $\mathbb{C}[N]$ (and base affine spaces) can be parameterized by semi-standard Young tableaux. Moreover,…
Motivated by the geometry of certain hyperplane arrangements, Manin and Schechtman defined for each positive integer n a hierarchy of finite partially ordered sets B(n, k), indexed by positive integers k, called the higher Bruhat orders.…
In this paper we introduce a description of ordered groupoids as a particular type of double categories. This enables us to turn Lawson's correspondence between ordered groupoids and left-cancellative categories into a biequivalence. We use…
Under natural conditions (such as split property and geometric modular action of wedge algebras) it is shown that the unitary equivalence class of the net of local (von Neumann) algebras in the vacuum sector associated to double cones with…
In this paper, we present an independent proof of the Cauchy identities for staircase matrices, originally discovered in arXiv:2411.03117, using the combinatorics of the Bruhat poset and the bubble-sort procedure. Additionally, we derive…
For many years, the intuitions underlying partial-order planning were largely taken for granted. Only in the past few years has there been renewed interest in the fundamental principles underlying this paradigm. In this paper, we present a…
Schur-Weyl duality is a fundamental framework in combinatorial representation theory. It intimately relates the irreducible representations of a group to the irreducible representations of its centralizer algebra. We investigate the analog…
Brualdi and Ma found a connection between involutions of length $n$ with $k$ descents and symmetric $k\times k$ matrices with non-negative integer entries summing to $n$ and having no row or column of zeros. From their main theorem they…
We obtain sufficient conditions ensuring the topological equivalence of two perturbed difference linear systems whose linear part has a property of generalized exponential dichotomy. When the exponential dichotomy is verified, we obtain a…
Webs are planar graphs with boundary that describe morphisms in a diagrammatic representation category for $\mathfrak{sl}_k$. They are studied extensively by knot theorists because braiding maps provide a categorical way to express link…
We define an inversion statistic on standard Young tableaux. We prove that this statistic has the same distribution over SYT(\lambda) as the major index statistic by exhibiting a bijection on SYT(\lambda) in the spirit of the Foata map on…
Using Symbolic Computation with Maple, we can discover lots of (rigorously-proved!) facts about Standard Young Tableaux, in particular the distribution of the entries in any specific cell, and the sorting probabilities.
In is paper we present a labelled tableau proof system that serves a wide class of interpretability logics. The system is proved sound and complete for any interpretability logic characterised by a frame condition given by a set of…