Equivariant Fiber Polytopes
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
Arxiv:Math/0609184V2 [Math.CO] 18 May 2007 Atb S Rn M-611.LW a Upre Npr Ya by Part in Supported Was L.W
FACES OF GENERALIZED PERMUTOHEDRA ALEXANDER POSTNIKOV, VICTOR REINER, AND LAUREN WILLIAMS Abstract. The aim of the paper is to calculate face numbers of simple gen- eralized permutohedra, and study their f-, h- and γ-vectors. These polytopes include permutohedra, associahedra, graph-associahedra, simple graphic zono- topes, nestohedra, and other interesting polytopes. We give several explicit formulas for h-vectors and γ-vectors involving de- scent statistics. This includes a combinatorial interpretation for γ-vectors of a large class of generalized permutohedra which are flag simple polytopes, and confirms for them Gal’s conjecture on nonnegativity of γ-vectors. We calculate explicit generating functions and formulae for h-polynomials of various families of graph-associahedra, including those corresponding to all Dynkin diagrams of finite and affine types. We also discuss relations with Narayana numbers and with Simon Newcomb’s problem. We give (and conjecture) upper and lower bounds for f-, h-, and γ-vectors within several classes of generalized permutohedra. An appendix discusses the equivalence of various notions of deformations of simple polytopes. Contents 1. Introduction 2 2. Face numbers 5 2.1. Polytopes, cones, and fans 5 2.2. f-vectors and h-vectors 6 2.3. Flag simple polytopes and γ-vectors 7 3. Generalized permutohedra and the cone-preposet dictionary 8 3.1. Generalized permutohedra 9 3.2. Braid arrangement 9 3.3. Preposets,equivalencerelations,andposets 10 3.4. The dictionary 11 4. Simple generalized permutohedra 14 arXiv:math/0609184v2 [math.CO] 18 May 2007 4.1. Descents of tree-posets and h-vectors 14 4.2. Bounds on the h-vector and monotonicity 15 5. -
Root Systems and Generalized Associahedra
Root Systems and Generalized Associahedra Sergey Fomin and Nathan Reading IAS/Park City Mathematics Series Volume 14, 2004 Root Systems and Generalized Associahedra Sergey Fomin and Nathan Reading These lecture notes provide an overview of root systems, generalized associahe- dra, and the combinatorics of clusters. Lectures 1-2 cover classical material: root systems, finite reflection groups, and the Cartan-Killing classification. Lectures 3–4 provide an introduction to cluster algebras from a combinatorial perspective. Lec- ture 5 is devoted to related topics in enumerative combinatorics. There are essentially no proofs but an abundance of examples. We label un- proven assertions as either “lemma” or “theorem” depending on whether they are easy or difficult to prove. We encourage the reader to try proving the lemmas, or at least get an idea of why they are true. For additional information on root systems, reflection groups and Coxeter groups, the reader is referred to [9, 25, 34]. For basic definitions related to convex polytopes and lattice theory, see [58]and[31], respectively. Primary sources on generalized associahedra and cluster combinatorics are [13, 19, 21]. Introductory surveys on cluster algebras were given in [22, 56, 57]. Note added in press (February 2007): Since these lecture notes were written, there has been much progress in the general area of cluster algebras and Catalan combinatorics of Coxeter groups and root systems. We have not attempted to update the text to reflect these most recent advances. Instead, we refer the reader to the online Cluster Algebras Portal, maintained by the first author. 1Department of Mathematics, University of Michigan, Ann Arbor, MI 48109-1109, USA. -
Arxiv:Math/0612591V2 [Math.AT] 23 Apr 2009 Oemrhs Spcue Nfgr A
ASSOCIAHEDRON, CYCLOHEDRON, AND PERMUTOHEDRON AS COMPACTIFICATIONS OF CONFIGURATION SPACES PASCAL LAMBRECHTS, VICTOR TURCHIN, AND ISMAR VOLIC´ Abstract. As in the case of the associahedron and cyclohedron, the permutohedron can also be defined as an appropriate compactification of a configuration space of points on an interval or on a circle. The construction of the compactification endows the permutohedron with a projection to the cyclohedron, and the cyclohedron with a projection to the associahedron. We show that the preimages of any point via these projections might not be homeomorphic to (a cell decomposition of) a disk, but are still contractible. We briefly explain an application of this result to the study of knot spaces from the point of view of the Goodwillie-Weiss manifold calculus. 1. Introduction The configuration space Conf(n, [0, 1]) of n distinct points 0 < t1 < t2 <...<tn < 1 in the 1 interior of the segment [0, 1] is clearly homeomorphic to the configuration space Conf∗(n,S ) of n + 1 distinct points on the circle S1 ≃ [0, 1]/0∼1, one of which is the fixed point ∗ = 0∼1. This homeomorphism is pictured in Figure A. 4 4 3 3 2 1 2 3 4 n n 1 2 n 1 * 1 Figure A. A homeomorphism between Conf∗(n,S ) and Conf(n, [0, 1]). arXiv:math/0612591v2 [math.AT] 23 Apr 2009 The Axelrod-Singer compactification [1] of Conf(n, [0, 1]) is the n-dimensional associahedron Assocn, also called the Stasheff polytope [20, 21]. The Axelrod-Singer compactification of 1 Conf∗(n,S ) is the n-dimensional cyclohedron Cycln, also called the Bott-Taubes polytope [2]. -
Geometric Combinatorial Algebras: Cyclohedron and Simplex
GEOMETRIC COMBINATORIAL ALGEBRAS: CYCLOHEDRON AND SIMPLEX STEFAN FORCEY AND DERRIELL SPRINGFIELD Abstract. In this paper we report on results of our investigation into the algebraic struc- ture supported by the combinatorial geometry of the cyclohedron. Our new graded algebra structures lie between two well known Hopf algebras: the Malvenuto-Reutenauer algebra of permutations and the Loday-Ronco algebra of binary trees. Connecting algebra maps arise from a new generalization of the Tonks projection from the permutohedron to the associahedron, which we discover via the viewpoint of the graph associahedra of Carr and Devadoss. At the same time, that viewpoint allows exciting geometrical insights into the multiplicative structure of the algebras involved. Extending the Tonks projection also re- veals a new graded algebra structure on the simplices. Finally this latter is extended to a new graded Hopf algebra with basis all the faces of the simplices. 1. Introduction 1.1. Background: Polytope algebras. In 1998 Loday and Ronco found an intriguing Hopf algebra of planar binary trees lying between the Malvenuto-Reutenauer Hopf algebra of permutations [13] and the Solomon descent algebra of Boolean subsets [11]. They also described natural Hopf algebra maps which neatly factor the descent map from permutations to Boolean subsets. Their first factor turns out to be the restriction (to vertices) of the Tonks projection from the permutohedron to the associahedron. Chapoton made sense of this latter fact when he found larger Hopf algebras based on the faces of the respective polytopes [5]. Here we study several new algebraic structures based on polytope sequences, including the n cyclohedra, Wn; and the simplices, ∆ .