skip to main content


Title: Doppelgängers: Bijections of Plane Partitions
Abstract We say two posets are doppelgängers if they have the same number of P-partitions of each height k. We give a uniform framework for bijective proofs that posets are doppelgängers by synthesizing K-theoretic Schubert calculus techniques of H. Thomas and A. Yong with M. Haiman’s rectification bijection and an observation of R. Proctor. Geometrically, these bijections reflect the rational equivalence of certain subvarieties of minuscule flag manifolds. As a special case, we provide the 1st bijective proof of a 1983 theorem of R. Proctor—that plane partitions of height k in a rectangle are equinumerous with plane partitions of height k in a shifted trapezoid.  more » « less
Award ID(s):
1703696
NSF-PAR ID:
10216217
Author(s) / Creator(s):
; ; ;
Date Published:
Journal Name:
International Mathematics Research Notices
Volume:
2020
Issue:
2
ISSN:
1073-7928
Page Range / eLocation ID:
487 to 540
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    The jeu-de-taquin-based Littlewood-Richardson rule of H. Thomas and A. Yong (2009) for minuscule varieties has been extended in two orthogonal directions, either enriching the cohomology theory or else expanding the family of varieties considered. In one direction, A. Buch and M. Samuel (2016) developed a combinatorial theory of 'unique rectification targets' in minuscule posets to extend the Thomas-Yong rule from ordinary cohomology to $K$-theory. Separately, P.-E. Chaput and N. Perrin (2012) used the combinatorics of R. Proctor's '$d$-complete posets' to extend the Thomas-Yong rule from minuscule varieties to a broader class of Kac-Moody structure constants. We begin to address the unification of these theories. Our main result is the existence of unique rectification targets in a large class of $d$-complete posets. From this result, we obtain conjectural positive combinatorial formulas for certain $K$-theoretic Schubert structure constants in the Kac-Moody setting. 
    more » « less
  2. Abstract For a Weyl group W of rank r , the W -Catalan number is the number of antichains of the poset of positive roots, and the W -Narayana numbers refine the W -Catalan number by keeping track of the cardinalities of these antichains. The W -Narayana numbers are symmetric – that is, the number of antichains of cardinality k is the same as the number of cardinality $r-k$ . However, this symmetry is far from obvious. Panyushev posed the problem of defining an involution on root poset antichains that exhibits the symmetry of the W -Narayana numbers. Rowmotion and rowvacuation are two related operators, defined as compositions of toggles, that give a dihedral action on the set of antichains of any ranked poset. Rowmotion acting on root posets has been the subject of a significant amount of research in the recent past. We prove that for the root posets of classical types, rowvacuation is Panyushev’s desired involution. 
    more » « less
  3. Topological Data Analysis (TDA) studies the “shape” of data. A common topological descriptor is the persistence diagram, which encodes topological features in a topological space at different scales. Turner, Mukherjee, and Boyer showed that one can reconstruct a simplicial complex embedded in R^3 using persistence diagrams generated from all possible height filtrations (an uncountably infinite number of directions). In this paper, we present an algorithm for reconstructing plane graphs K = (V, E) in R^2, i.e., a planar graph with vertices in general position and a straight-line embedding, from a quadratic number height filtrations and their respective persistence diagrams. 
    more » « less
  4. Topological Data Analysis (TDA) studies the shape of data. A common topological descriptor is the persistence diagram, which encodes topological features in a topological space at different scales. Turner, Mukeherjee, and Boyer showed that one can reconstruct a simplicial complex embedded in R^3 using persistence diagrams generated from all possible height filtrations (an uncountably infinite number of directions). In this paper, we present an algorithm for reconstructing plane graphs K=(V,E) in R^2 , i.e., a planar graph with vertices in general position and a straight-line embedding, from a quadratic number height filtrations and their respective persistence diagrams. 
    more » « less
  5. Generalized permutahedra are polytopes that arise in combinatorics, algebraic geometry, representation theory, topology, and optimization. They possess a rich combinatorial structure. Out of this structure we build a Hopf monoid in the category of species.

    Species provide a unifying framework for organizing families of combinatorial objects. Many species carry a Hopf monoid structure and are related to generalized permutahedra by means of morphisms of Hopf monoids. This includes the species of graphs, matroids, posets, set partitions, linear graphs, hypergraphs, simplicial complexes, and building sets, among others. We employ this algebraic structure to define and study polynomial invariants of the various combinatorial structures.

    We pay special attention to the antipode of each Hopf monoid. This map is central to the structure of a Hopf monoid, and it interacts well with its characters and polynomial invariants. It also carries information on the values of the invariants on negative integers. For our Hopf monoid of generalized permutahedra, we show that the antipode maps each polytope to the alternating sum of its faces. This fact has numerous combinatorial consequences.

    We highlight some main applications:

    We obtain uniform proofs of numerous old and new results about the Hopf algebraic and combinatorial structures of these families. In particular, we give optimal formulas for the antipode of graphs, posets, matroids, hypergraphs, and building sets. They are optimal in the sense that they provide explicit descriptions for the integers entering in the expansion of the antipode, after all coefficients have been collected and all cancellations have been taken into account.

    We show that reciprocity theorems of Stanley and Billera–Jia–Reiner (BJR) on chromatic polynomials of graphs, order polynomials of posets, and BJR-polynomials of matroids are instances of one such result for generalized permutahedra.

    We explain why the formulas for the multiplicative and compositional inverses of power series are governed by the face structure of permutahedra and associahedra, respectively, providing an answer to a question of Loday.

    We answer a question of Humpert and Martin on certain invariants of graphs and another of Rota on a certain class of submodular functions.

    We hope our work serves as a quick introduction to the theory of Hopf monoids in species, particularly to the reader interested in combinatorial applications. It may be supplemented with Marcelo Aguiar and Swapneel Mahajan’s 2010 and 2013 works, which provide longer accounts with a more algebraic focus.

     
    more » « less