Search arXivSearch

arXiv · 1611.06640

Combinatorics and Representation Theory for Generalized Permutohedra I: Simplicial Plates

Abstract

In this paper, we announce results from our thesis, which studies for the first time the categorification of the theory of generalized permutohedra. The vector spaces in the categorification are tightly constrained by certain continuity relations which appeared in physics in the mid 20th century. We describe here the action of the symmetric group on the vector spaces in this categorification. Generalized permutohedra are replaced by vector spaces of characteristic functions of polyhedral cones about faces of permutohedra, called plates, due to A. Ocneanu. The symmetric group acts on plates by coordinate permutation. In combinatorics, the Eulerian numbers count the number of permutations with a given number of ascent and descents. The classical Worpitzky identity expands a power $r^p$ as a sum of Eulerian numbers, with binomial coefficients. In our thesis, for the main result we generalize the classical Worpitzky identity to an isomorphism of symmetric group modules, corresponding geometrically to the tiling of a scaled simplex by unit hypersimplices. In the categorification, the volume of a hypersimplex is replaced by the complex-linear dimension of a vector space associated to it. The main technical aspect of the proof of the character formula for the simplex involves a partition of unity of a commutative algebra of translations on a discrete torus, and a certain modular Diophantine equation. A detailed paper is in preparation.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nick Early. 2016-11-21. Combinatorics and Representation Theory for Generalized Permutohedra I: Simplicial Plates. https://arxiv.org/abs/1611.06640

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO