Related papers: Deficit and $(q,t)$-symmetry in triangular partiti…
A new combinatorial approach to the ribbon tableaux generating functions and q-Littlewood Richardson coefficients of Lascoux, Leclerc and Thibon is suggested. We define operators which add ribbons to partitions and following Fomin and…
We summarize basic features of quantum field theories with discrete symmetry $\mathbb{Q}/\mathbb{Z}$ (possibly higher form, global or gauged). The classification of representations and anomalies is quite rich and involves the ring of…
In this paper, we remind previous results about the tilings $\{p,q\}$ of the hyperbolic plane. We introduce two new ways to split the hyperbolic plane in order to algorithmically construct the tilings $\{p,q\}$ when $q$ is odd.
We reformulate several known results about continued fractions in combinatorial terms. Among them the theorem of Conway and Coxeter and that of Series, both relating continued fractions and triangulations. More general polygon dissections…
The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…
In this paper we introduce and study a class of tableaux which we call permutation tableaux; these tableaux are naturally in bijection with permutations, and they are a distinguished subset of the Le-diagrams of Alex Postnikov. The…
We give a new proof of a determinant evaluation due to Andrews, which has been used to enumerate cyclically symmetric and descending plane partitions. We also prove some related results, including a q-analogue of Andrews's determinant.
An extension to triangular domains of the univariate q-Bernstein basis functions is introduced and analyzed. Some recurrence relations and properties such as partition of unity and degree elevation are proved for them. It is also proved…
The graph of zigzag diagrams is a close relative of Young's lattice. The boundary problem for this graph amounts to describing coherent random permutations with descent-set statistic, and is also related to certain positive characters on…
We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…
We develop the connection of Berg partitions with special substitution tilings of two tiles. We obtain a new proof that the number of Berg partitions with a fixed connectivity matrix is equal to half of the sum of its entries, \cite{S-W}.…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
We construct a new class of operators that act on symmetric functions with two deformation parameters $q$ and $t$. Our combinatorial construction associates each operator with a specific lattice path, whose steps alternate between moving up…
Schwinger-Dyson equations are used to study spontaneous chiral and parity symmetry breaking of three dimensional quantum electrodynamics with two-component fermions. This theory admits a topological photon mass that explicitly breaks parity…
In two previous papers we have presented partition formulae for the Fibonacci numbers motivated by the appearance of the Fibonacci numbers in the representation theory of the 3-Kronecker quiver and its universal cover, the 3-regular tree.…
Generalizing results of Temperley, Brooks, Smith, Stone and Tutte and others we describe a natural equivalence between three planar objects: weighted bipartite planar graphs; planar Markov chains; and tilings with convex polygons. This…
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulations (whose edges can be partitioned into two trees). Our…
This extended abstract is about an effort to build a formal description of a triangulation algorithm starting with a naive description of the algorithm where triangles, edges, and triangulations are simply given as sets and the most complex…
A relationship between the tetrahedron equation for maps and the consistency property of integrable discrete equations on $\mathbb{Z}^3$ is investigated. Our approach is a generalization of a method developed in the context of Yang-Baxter…
We study some combinatorial properties of higher-dimensional partitions which generalize plane partitions. We present a natural bijection between $d$-dimensional partitions and $d$-dimensional arrays of nonnegative integers. This bijection…