中文
相关论文

相关论文: Puzzles, Tableaux and Mosaics

200 篇论文

Based on Thomas and Yong's K-theoretic jeu de taquin algorithm, we prove a uniform Littlewood-Richardson rule for the K-theoretic Schubert structure constants of all minuscule homogeneous spaces. Our formula is new in all types. For the…

代数几何 · 数学 2013-06-25 Anders Skovsted Buch , Matthew J. Samuel

Young tableaux are fundamental objects in algebraic combinatorics and representation theory, with operations such as promotion and jeu de taquin playing a central role in their structure and applications. While these operations are well…

In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of…

组合数学 · 数学 2016-05-11 Pawel Hitczenko , Amanda Lohss

We introduce new combinatorial objects called the shifted domino tableaux. We prove that these objects are in bijection with pairs of shifted Young tableaux. This bijection shows that shifted domino tableaux can be seen as elements of the…

组合数学 · 数学 2016-03-16 Zakaria Chemli

We provide direct proofs of product and coproduct formulae for Schur functions where the coefficients (Littlewood--Richardson coefficients) are defined as counting puzzles. The product formula includes a second alphabet for the Schur…

数学物理 · 物理学 2009-01-16 P. Zinn-Justin

The study of knot mosaics is based upon representing knot diagrams using a set of tiles on a square grid. This branch of knot theory has many unanswered questions, especially regarding the efficiency with which we draw knots as mosaics.…

几何拓扑 · 数学 2025-01-29 Aaron Heap , Douglas Baldwin , James Canning , Greg Vinal

Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…

Within this research, two combinatorial bijections using Young diagrams were studied. The first is a special case of a bijective correspondence between two classes of combinatorial objects. Its proof, based on Young diagrams, establishes…

数论 · 数学 2026-04-06 Katya Borodinova

We define P-strict labelings for a finite poset P as a generalization of semistandard Young tableaux and show that promotion on these objects is in equivariant bijection with a toggle action on B-bounded Q-partitions of an associated poset…

组合数学 · 数学 2022-06-28 Joseph Bernstein , Jessica Striker , Corey Vorland

Rectangular standard Young tableaux with 2 or 3 rows are in bijection with $U_q(\mathfrak{sl}_2)$-webs and $U_q(\mathfrak{sl}_3)$-webs respectively. When $W$ is a web with a reflection symmetry, the corresponding tableau $T_W$ has a…

组合数学 · 数学 2022-07-08 Kevin Purbhoo , Shelley Wu

Using the ring space of sheared Witt vectors, we define certain ring stacks. We suggest several models for the ring stacks. Motivation: there is a conjectural description of the stack of n-truncated Barsotti-Tate groups and its Shimurian…

代数几何 · 数学 2025-11-20 Vladimir Drinfeld

A family of Poisson structures, parametrised by an arbitrary odd periodic function $\phi$, is defined on the space $\cW$ of twisted polygons in $\RR^\nu$. Poisson reductions with respect to two Poisson group actions on $\cW$ are described.…

数学物理 · 物理学 2010-07-13 Ian Marshall

Sch\"utzenberger's jeu de taquin is an algorithm on the structure of tableaux, which transforms a skew tableau into a Young one by local transformation rules on the columns of the tableaux. This algorithm defines an equivalence relation on…

组合数学 · 数学 2022-01-31 Nohra Hage , Philippe Malbos

We define a set of operations called crystal operations on matrices with entries either in {0,1} or in N. There are horizontal and vertical crystal operations, giving rise to two commuting structures of a crystal graph on these matrices.…

组合数学 · 数学 2007-05-23 Marc A. A. van Leeuwen

We study birational morphisms between smooth projective surfaces that respect a given Poisson structure, with particular attention to induced birational maps between the (Poisson) moduli spaces of sheaves on those surfaces. In particular,…

代数几何 · 数学 2019-07-29 Eric M. Rains

We extend the theory of Littlewood-Richardson fillings (defined over the non-negative integers) to include diagrams with rows and boxes of real-valued length. We realize such fillings as invariants of matrix pairs over rings with a…

组合数学 · 数学 2009-10-26 Glenn D. Appleby , Tamsen Whitehead

We settle a question of Bressoud concerning the existence of an explicit bijection from a class of oriented square-ice graphs to a class of tournaments. We give an algorithm constructing such a bijection.

组合数学 · 数学 2007-05-23 Robin Chapman

We give another bijective proof of a result of Corteel and Nadeau. We find a generating function related to unrestricted columns of permutation tableaux. As a consequence, we obtain a sign-imbalance formula for permutation tableaux. We…

组合数学 · 数学 2011-08-30 Sylvie Corteel , Jang Soo Kim

We give a new Littlewood-Richardson rule for the Schubert structure coefficients of isotropic Grassmannians, equivalently for the multiplication of $P$-Schur functions. Serrano (2010) previously gave a formula in terms of classes in his…

组合数学 · 数学 2025-06-23 Santiago Estupiñán-Salamanca , Oliver Pechenik

We introduce a Littlewood-Richardson rule based on an algorithmic deformation of skew Young diagrams and present a bijection with the classical rule. The result is a direct combinatorial interpretation and proof of the geometric rule…

组合数学 · 数学 2008-12-03 Ricky Ini Liu