Related papers: Puzzles, Tableaux and Mosaics
We define a number of new combinatorial operations on skew semistandard domino tableaux, which together with constructions introduced earlier by C. Carre and B. Leclerc, define an elegant structure on the set of these tableaux, that closely…
We give a positive equivariant Littlewood-Richardson rule also discovered independently by Molev. Our proof generalizes a proof by Stembridge of the ordinary Littlewood-Richardson rule. We describe a weight-preserving bijection between our…
A bijection is defined from Littlewood-Richardson tableaux to rigged configurations. It is shown that this map preserves the appropriate statistics, thereby proving a quasi-particle expression for the generalized Kostka polynomials, which…
An introduction is given to the Littlewood-Richardson rule, and various combinatorial constructions related to it. We present a proof based on tableau switching, dual equivalence, and coplactic operations. We conclude with a section…
We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
Knutson, Tao, and Woodward formulated a Littlewood-Richardson rule for the cohomology ring of Grassmannians in terms of puzzles. Vakil and Wheeler-Zinn-Justin have found additional triangular puzzle pieces that allow one to express…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
We describe an explicit geometric Littlewood-Richardson rule, interpreted as deforming the intersection of two Schubert varieties so that they break into Schubert varieties. There are no restrictions on the base field, and all…
We generalize classical triangular Schubert puzzles to puzzles with convex polygonal boundary. We give these puzzles a geometric Schubert calculus interpretation and derive novel combinatorial commutativity statements, using purely…
Recently, in papers by Knutson, Tao and Woodward, Henriques and Kamnitzer, Pak and Vallejo have been constructed several interesting bijections of associativity and commutativity. In the first two papers bijections relate special sets of…
Looking at incidence matrices of $t$-$(v,k,\lambda)$ designs as $v \times b$ matrices with $2$ possible entries, each of which indicates incidences of a $t$-design, we introduce the notion of a $c$-mosaic of designs, having the same number…
We prove a conjecture of Knutson asserting that the Schubert structure constants of the cohomology ring of a two-step flag variety are equal to the number of puzzles with specified border labels that can be created using a list of eight…
We show how Coxeter's work implies a bijection between complex reflection groups of rank two and real reflection groups in $O(3)$. We also consider this magic square of reflections and rotations in the framework of Clifford algebras: we…
The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z}^d$ which tiles that lattice by translations, in fact tiles periodically. In this work we disprove this conjecture for sufficiently large $d$, which also…
We study four operations defined on pairs of tableaux. Algorithms for the first three involve the familiar procedures of jeu de taquin, row insertion, and column insertion. The fourth operation, hopscotch, is new, although specialised…
We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…
The connection between the generating functions of various sets of tableaux and the appropriate families of quasisymmetric functions is a significant tool to give a direct analytical proof of some advanced bijective results and provide new…
We define the_hive ring_, which has a basis indexed by dominant weights for GL(n), and structure constants given by counting hives [KT1] (or equivalently honeycombs, or Berenstein-Zelevinsky patterns [BZ1]). We use the octahedron rule from…
We study k-Schur functions characterized by k-tableaux, proving combinatorial properties such as a k-Pieri rule and a k-conjugation. This new approach relies on developing the theory of k-tableaux, and includes the introduction of a…
Hall-Littlewood functions indexed by rectangular partitions, specialized at primitive roots of unity, can be expressed as plethysms. We propose a combinatorial proof of this formula using A. Schilling's bijection between ribbon tableaux and…