Root polytopes, triangulations, and the subdivision algebra, II
Author:
Karola Mészáros
Journal:
Trans. Amer. Math. Soc. 363 (2011), 61116141
MSC (2010):
Primary 05E15, 16S99, 51M25, 52B11
Published electronically:
April 28, 2011
MathSciNet review:
2817421
Fulltext PDF
Abstract 
References 
Similar Articles 
Additional Information
Abstract: The type root polytope is the convex hull in of the origin and the points for . Given a graph , with edges labeled positive or negative, associate to each edge of a vector v which is if , , is labeled negative and if it is labeled positive. For such a signed graph , the associated root polytope is the intersection of with the cone generated by the vectors v, for edges in . The reduced forms of a certain monomial in commuting variables under reductions derived from the relations of a bracket algebra of type , can be interpreted as triangulations of . Using these triangulations, the volume of can be calculated. If we allow variables to commute only when all their indices are distinct, then we prove that the reduced form of , for ``good'' graphs , is unique and yields a canonical triangulation of in which each simplex corresponds to a noncrossing alternating graph in a type 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 . We also study the bracket algebra of type 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 .
 [BR]
Matthias
Beck and Sinai
Robins, Computing the continuous discretely, Undergraduate
Texts in Mathematics, Springer, New York, 2007. Integerpoint enumeration
in polyhedra. MR
2271992 (2007h:11119)
 [D]
Emeric
Deutsch, Dyck path enumeration, Discrete Math.
204 (1999), no. 13, 167–202. MR 1691869
(2000d:05007), 10.1016/S0012365X(98)003719
 [FK]
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
(2001a:05152)
 [F]
W. Fong, Triangulations and Combinatorial Properties of Convex Polytopes, Ph.D. Thesis, 2000.
 [GGP]
Israel
M. Gelfand, Mark
I. Graev, and Alexander
Postnikov, Combinatorics of hypergeometric functions associated
with positive roots, The ArnoldGelfand mathematical seminars,
Birkhäuser Boston, Boston, MA, 1997, pp. 205–221. MR 1429893
(99k:33046), 10.1007/9781461241225_10
 [G]
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
(2001f:16030)
 [K1]
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
(2003a:05155)
 [K2]
A. N. Kirillov, personal communication, 2007.
 [M]
K. Mészáros, Root polytopes, triangulations, and the subdivision algebra, I, http:// arxiv.org/abs/0904.2194.
 [P]
Alexander
Postnikov, Permutohedra, associahedra, and beyond, Int. Math.
Res. Not. IMRN 6 (2009), 1026–1106. MR 2487491
(2010g:05399), 10.1093/imrn/rnn153
 [R1]
V. Reiner, Quotients of Coxeter complexes and PPartitions, Ph.D. Thesis, 1990.
 [R2]
Victor
Reiner, Signed posets, J. Combin. Theory Ser. A
62 (1993), no. 2, 324–360. MR 1207741
(94d:06011), 10.1016/00973165(93)90052A
 [S1]
Richard
P. Stanley, Decompositions of rational convex polytopes, Ann.
Discrete Math. 6 (1980), 333–342. Combinatorial
mathematics, optimal designs and their applications (Proc. Sympos. Combin.
Math. and Optimal Design, Colorado State Univ., Fort Collins, Colo., 1978).
MR 593545
(82a:52007)
 [S2]
Richard
P. Stanley, Enumerative combinatorics. Vol. 2, Cambridge
Studies in Advanced Mathematics, vol. 62, Cambridge University Press,
Cambridge, 1999. With a foreword by GianCarlo Rota and appendix 1 by
Sergey Fomin. MR
1676282 (2000k:05026)
 [Z1]
Thomas
Zaslavsky, Signed graphs, Discrete Appl. Math.
4 (1982), no. 1, 47–74. MR 676405
(84e:05095a), 10.1016/0166218X(82)900336
 [Z2]
Thomas
Zaslavsky, Orientation of signed graphs, European J. Combin.
12 (1991), no. 4, 361–375. MR 1120422
(93a:05065), 10.1016/S01956698(13)801187
 [BR]
 M. Beck, S. Robins, Computing the continuous discretely. Integerpoint enumeration in polyhedra, Springer Science and Business Media, LLCC, 2007. MR 2271992 (2007h:11119)
 [D]
 E. Deutsch, Dyck path enumeration, Discrete Math. 204 (1999), 167202. MR 1691869 (2000d:05007)
 [FK]
 S. Fomin, A. N. Kirillov, Quadratic algebras, Dunkl elements and Schubert calculus, Advances in Geometry, Progress in Mathematics 172 (1999), 147182. MR 1667680 (2001a:05152)
 [F]
 W. Fong, Triangulations and Combinatorial Properties of Convex Polytopes, Ph.D. Thesis, 2000.
 [GGP]
 I. M. Gelfand, M. I. Graev, A. Postnikov, Combinatorics of hypergeometric functions associated with positive roots, in ArnoldGelfand Mathematical Seminars: Geometry and Singularity Theory, Birkhäuser, Boston, 1996, 205221. MR 1429893 (99k:33046)
 [G]
 E. L. Green, Noncommutative Gröbner bases, and projective resolutions, Computational methods for representations of groups and algebras (Essen, 1997), 2960, Progr. Math., 173, Birkhäuser, Basel, 1999. MR 1714602 (2001f:16030)
 [K1]
 A. N. Kirillov, On some quadratic algebras, L. D. Faddeev's Seminar on Mathematical Physics, American Mathematical Society Translations: Series 2, 201, AMS, Providence, RI, 2000. MR 1772287 (2003a:05155)
 [K2]
 A. N. Kirillov, personal communication, 2007.
 [M]
 K. Mészáros, Root polytopes, triangulations, and the subdivision algebra, I, http:// arxiv.org/abs/0904.2194.
 [P]
 A. Postnikov, Permutohedra, associahedra, and beyond, Int. Math. Res. Not. IMRN 2009, no. 6, 10261106. MR 2487491 (2010g:05399)
 [R1]
 V. Reiner, Quotients of Coxeter complexes and PPartitions, Ph.D. Thesis, 1990.
 [R2]
 V. Reiner, Signed posets, J. Combin. Theory Ser. A 62 (1993), 324360. MR 1207741 (94d:06011)
 [S1]
 R. Stanley, Decompositions of rational convex polytopes, Annals of Discrete Mathematics 6 (1980), 333342. MR 593545 (82a:52007)
 [S2]
 R. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University Press, New York/Cambridge, 1999. MR 1676282 (2000k:05026)
 [Z1]
 T. Zaslavsky, Signed graphs, Discrete Appl. Math. 4 (1982), 4774. MR 676405 (84e:05095a)
 [Z2]
 T. Zaslavsky, Orientation of signed graphs, Europ. J. Combinatorics 12 (1991), 361375. MR 1120422 (93a:05065)
Similar Articles
Retrieve articles in Transactions of the American Mathematical Society
with MSC (2010):
05E15,
16S99,
51M25,
52B11
Retrieve articles in all journals
with MSC (2010):
05E15,
16S99,
51M25,
52B11
Additional Information
Karola Mészáros
Affiliation:
Department of Mathematics, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
DOI:
http://dx.doi.org/10.1090/S000299472011053717
Keywords:
Root polytope,
type $C_{n}$,
type $D_{n}$,
triangulation,
volume,
Ehrhart polynomial,
noncrossing alternating graph,
subdivision algebra,
bracket algebra,
reduced form,
noncommutative Gröbner basis
Received by editor(s):
October 6, 2009
Received by editor(s) in revised form:
April 17, 2010
Published electronically:
April 28, 2011
Article copyright:
© Copyright 2011
American Mathematical Society
The copyright for this article reverts to public domain 28 years after publication.
