Root polytopes, triangulations, and the subdivision algebra, II
HTML articles powered by AMS MathViewer
- by Karola Mészáros PDF
- Trans. Amer. Math. Soc. 363 (2011), 6111-6141 Request permission
Abstract:
The type $C_{n}$ root polytope $\mathcal {P}(C_{n}^+)$ is the convex hull in $\mathbb {R}^{n}$ of the origin and the points $e_i-e_j, e_i+e_j, 2e_k$ for $1\leq i<j \leq n, k \in [n]$. Given a graph $G$, with edges labeled positive or negative, associate to each edge $e$ of $G$ a vector v$(e)$ which is $e_i-e_j$ if $e=(i, j)$, $i<j$, is labeled negative and $e_i+e_j$ if it is labeled positive. For such a signed graph $G$, the associated root polytope $\mathcal {P}(G)$ is the intersection of $\mathcal {P}(C_{n}^+)$ with the cone generated by the vectors v$(e)$, for edges $e$ in $G$. The reduced forms of a certain monomial $m[G]$ in commuting variables $x_{ij}, y_{ij}, z_k$ under reductions derived from the relations of a bracket algebra of type $C_n$, can be interpreted as triangulations of $\mathcal {P}(G)$. Using these triangulations, the volume of $\mathcal {P}(G)$ can be calculated. If we allow variables to commute only when all their indices are distinct, then we prove that the reduced form of $m[G]$, for “good” graphs $G$, is unique and yields a canonical triangulation of $\mathcal {P}(G)$ in which each simplex corresponds to a noncrossing alternating graph in a type $C$ sense. A special case of our results proves a conjecture of A. N. Kirillov about the uniqueness of the reduced form of a Coxeter type element in the bracket algebra of type $C_n$. We also study the bracket algebra of type $D_n$ and show that a family of monomials has unique reduced forms in it. A special case of our results proves a conjecture of A. N. Kirillov about the uniqueness of the reduced form of a Coxeter type element in the bracket algebra of type $D_n$.References
- Matthias Beck and Sinai Robins, Computing the continuous discretely, Undergraduate Texts in Mathematics, Springer, New York, 2007. Integer-point enumeration in polyhedra. MR 2271992
- Emeric Deutsch, Dyck path enumeration, Discrete Math. 204 (1999), no. 1-3, 167–202. MR 1691869, DOI 10.1016/S0012-365X(98)00371-9
- Sergey Fomin and Anatol N. Kirillov, Quadratic algebras, Dunkl elements, and Schubert calculus, Advances in geometry, Progr. Math., vol. 172, Birkhäuser Boston, Boston, MA, 1999, pp. 147–182. MR 1667680
- W. Fong, Triangulations and Combinatorial Properties of Convex Polytopes, Ph.D. Thesis, 2000.
- Israel M. Gelfand, Mark I. Graev, and Alexander Postnikov, Combinatorics of hypergeometric functions associated with positive roots, The Arnold-Gelfand mathematical seminars, Birkhäuser Boston, Boston, MA, 1997, pp. 205–221. MR 1429893, DOI 10.1007/978-1-4612-4122-5_{1}0
- Edward L. Green, Noncommutative Gröbner bases, and projective resolutions, Computational methods for representations of groups and algebras (Essen, 1997) Progr. Math., vol. 173, Birkhäuser, Basel, 1999, pp. 29–60. MR 1714602
- A. N. Kirillov, On some quadratic algebras, L. D. Faddeev’s Seminar on Mathematical Physics, Amer. Math. Soc. Transl. Ser. 2, vol. 201, Amer. Math. Soc., Providence, RI, 2000, pp. 91–113. MR 1772287, DOI 10.1090/trans2/201/07
- A. N. Kirillov, personal communication, 2007.
- K. Mészáros, Root polytopes, triangulations, and the subdivision algebra, I, http:// arxiv.org/abs/0904.2194.
- Alexander Postnikov, Permutohedra, associahedra, and beyond, Int. Math. Res. Not. IMRN 6 (2009), 1026–1106. MR 2487491, DOI 10.1093/imrn/rnn153
- V. Reiner, Quotients of Coxeter complexes and P-Partitions, Ph.D. Thesis, 1990.
- Victor Reiner, Signed posets, J. Combin. Theory Ser. A 62 (1993), no. 2, 324–360. MR 1207741, DOI 10.1016/0097-3165(93)90052-A
- Richard P. Stanley, Decompositions of rational convex polytopes, Ann. Discrete Math. 6 (1980), 333–342. MR 593545
- Richard P. Stanley, Enumerative combinatorics. Vol. 2, Cambridge Studies in Advanced Mathematics, vol. 62, Cambridge University Press, Cambridge, 1999. With a foreword by Gian-Carlo Rota and appendix 1 by Sergey Fomin. MR 1676282, DOI 10.1017/CBO9780511609589
- Thomas Zaslavsky, Signed graphs, Discrete Appl. Math. 4 (1982), no. 1, 47–74. MR 676405, DOI 10.1016/0166-218X(82)90033-6
- Thomas Zaslavsky, Orientation of signed graphs, European J. Combin. 12 (1991), no. 4, 361–375. MR 1120422, DOI 10.1016/S0195-6698(13)80118-7
Additional Information
- Karola Mészáros
- Affiliation: Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
- MR Author ID: 823389
- Received by editor(s): October 6, 2009
- Received by editor(s) in revised form: April 17, 2010
- Published electronically: April 28, 2011
- © Copyright 2011
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication. - Journal: Trans. Amer. Math. Soc. 363 (2011), 6111-6141
- MSC (2010): Primary 05E15, 16S99, 51M25, 52B11
- DOI: https://doi.org/10.1090/S0002-9947-2011-05371-7
- MathSciNet review: 2817421