Related papers: Cyclic Sieving for Plane Partitions and Symmetry
Ramanujan's celebrated congruences of the partition function $p(n)$ have inspired a vast amount of results on various partition functions. Kwong's work on periodicity of rational polynomial functions yields a general theorem used to…
We introduce Macdonald polynomials indexed by $n$-tuples of partitions and characterized by certain orthogonality and triangularity relations. We prove that they can be explicitly given as products of ordinary Macdonald polynomials…
Factorization theorems for single inclusive jet production play a crucial role in the study of jets and their substructure. In the case of small radius jets, the dynamics of the jet clustering can be factorized from both the hard production…
We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(\lambda,\mu)$ of shape $\lambda=(m,n^b)$ and content $\mu$, a $(b+2)$-tuple. We prove that $(SSYT(\lambda,\mu),\langle \partial^{b+2} \rangle, f(q))$ exhibits the…
We introduce orbitopes as the convex hulls of 0/1-matrices that are lexicographically maximal subject to a group acting on the columns. Special cases are packing and partitioning orbitopes, which arise from restrictions to matrices with at…
Subgroups of the symmetric group $S_n$ act on powers of chains $C^n$ by permuting coordinates, and induce automorphisms of the ordered sets $C^n$. The quotients defined are candidates for symmetric chain decompositions. We establish this…
A method of Proctor [European J. Combin. 5 (1984), no. 4, 331-350] realizes the set of arbitrary plane partitions in a box and the set of symmetric plane partitions as bases of linear representations of Lie groups. We extend this method by…
The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
This paper is a continuation of our papers [EK1, EK2]. In [EK2] we showed that for the root system A_n-1 one can obtain Macdonald's polynomials - a new interesting class of symmetric functions recently defined by I. Macdonald {M1] - as…
(Dual-)promotion and (dual-)evacuation are bijections on SYT(\lambda) for any partition \lambda. Let c^r denote the rectangular partition (c,...,c) of height r, and let sc_k (k > 2) denote the staircase partition (k,k-1,...,1). B. Rhoades…
We propose an iterated version of the Gilbert model, which results in a sequence of random mosaics of the plane. We prove that under appropriate scaling, this sequence of mosaics converges to that obtained by a classical Poisson line…
The complex irreducible representations of the symmetric group carry an important canonical basis called the Kazhdan-Lusztig basis. Although it is difficult to express how general permutations act on this basis, some distinguished…
In this paper, we further develop the theory of circles of partition by introducing the notion of complex circles of partition. This work generalizes the classical framework, extending from subsets of the natural numbers as base sets to…
We establish a general slice theorem for the action of a locally convex Lie group on a locally convex manifold, which generalizes the classical slice theorem of Palais to infinite dimensions. We discuss two important settings under which…
One of the equivalent formulations of the Kadison-Singer problem which was resolved in 2013 by Marcus, Spielman and Srivastava, is the "paving conjecture". Roughly speaking, the paving conjecture states that every positive semi-definite…
Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…
Classic mass partition results are about dividing the plane into regions that are equal with respect to one or more measures (masses). We introduce a new concept in which the notion of partition is replaced by that of a cover. In this case…
We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…
This paper, about a fluid-like system of spatially confined particles, reveals the analytic structure for both, the canonical and grand canonical partition functions. The studied system is inhomogeneously distributed in a region whose…