Related papers: Shifted Domino tableaux
We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation using L-S paths generators. Thanks to the shapes of…
We show that Fano lattice polygons define a class of balanced quivers with interesting properties. The combinatorics of these quivers is related to singularities of the underlying toric Fano surface. This allows us to show that every Fano…
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…
Domino tilings have been studied extensively for both their statistical properties and their dynamical properties. We construct a subshift of finite type using matching rules for several types of dominos. We combine the previous results…
In earlier work with C.~Monical, we introduced the notion of a K-crystal, with applications to K-theoretic Schubert calculus and the study of Lascoux polynomials. We conjectured that such a K-crystal structure existed on the set of…
We introduce the notions of shifted bisymplectic and shifted double Poisson structures on differential graded associative algebras, and more generally on non-commutative derived moduli functors with well-behaved cotangent complexes. For…
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…
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…
The aim of the present paper is to extend the dualizing object approach to Stone duality to the non-commutative setting of skew Boolean algebras. This continues the study of non-commutative generalizations of different forms of Stone…
We introduce ($\ell$-)bimonoids as ordered algebras consisting of two compatible monoidal structures on a partially ordered (lattice-ordered) set. Bimonoids form an appropriate framework for the study of a general notion of complementation,…
We provide the special values of the skew version of the $K$-theoretic Schur $P$- and $Q$-functions. Using these special values, we show an oddness property of the number of shifted set-valued skew tableaux. Additionally, we generalize…
In this paper we study multiple Dedekind symbols and the associated multiple reciprocity functions. There is a bijection between the two sets of them after a normalization. By this bijection we define products of multiple reciprocity…
In this note we develop a systematic combinatorial definition for constructed earlier supersymmetric polynomial families. These polynomial families generalize canonical Schur, Jack and Macdonald families so that the new polynomials depend…
The monopole-dimer model introduced recently is an exactly-solvable signed generalisation of the dimer model. We show that the partition function of the monopole-dimer model on a graph invariant under a fixed-point free involution is a…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
Young tableaux carry an associative product, described by the Schensted algorithm. They thus form a monoid $\mathbf{Pl}$, called \emph{plactic}. It is central in numerous combinatorial and algebraic applications. In this paper, the tableaux…
We consider the problem of counting and classifying domino tilings of a quadriculated torus. The counting problem for rectangles was studied by Kasteleyn and we use many of his ideas. Domino tilings of planar regions can be represented by…
We present a version of the domino shuffling algorithm (due to Elkies, Kuperberg, Larsen and Propp) which works on a different lattice: the hexagonal lattice superimposed on its dual graph. We use our algorithm to count perfect matchings on…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…