ID: math/0504231

Volume computation for polytopes and partition functions for classical root systems

April 11, 2005

View on ArXiv
M. Welleda Baldoni, Matthias Beck, Charles Cochet, Michele Vergne
Mathematics
Combinatorics
Representation Theory

This paper presents an algorithm to compute the value of the inverse Laplace transforms of rational functions with poles on arrangements of hyperplanes. As an application, we present an efficient computation of the partition function for classical root systems.

Similar papers 1

Partial fraction decompositions and an algorithm for computing the vector partition function

October 26, 2009

88% Match
Todor Milev
Representation Theory

This paper gives an exposition of well known results on vector partition functions. The exposition is based on works of M. Brion, A. Szenes and M. Vergne and is geared toward explicit computer realizations. In particular, the paper presents two algorithms for computing the vector partition function with respect to a finite set of vectors $I$ as a quasipolynomial over a finite set of pointed polyhedral cones. We use the developed techniques to relate a result of P. Tumarkin an...

Find SimilarView on arXiv

Lattice sums of hyperplane arrangements

August 8, 2014

87% Match
Yasushi Komori, Kohji Matsumoto, Hirofumi Tsumura
Number Theory

We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also introduce generating functions of special values of those lattice sums, and study their properties by virtue of the theory of convex polytopes. Consequently we evaluate special values of those lattice sums, especially certain special values of...

Find SimilarView on arXiv

Computation of the highest coefficients of weighted Ehrhart quasi-polynomials of rational polyhedra

November 7, 2010

87% Match
Velleda Baldoni, Nicole Berline, Loera Jesús A. De, ... , Vergne Michèle
Combinatorics
Computational Geometry

This article concerns the computational problem of counting the lattice points inside convex polytopes, when each point must be counted with a weight associated to it. We describe an efficient algorithm for computing the highest degree coefficients of the weighted Ehrhart quasi-polynomial for a rational simple polytope in varying dimension, when the weights of the lattice points are given by a polynomial function h. Our technique is based on a refinement of an algorithm of A....

Find SimilarView on arXiv

A note on De Concini and Procesi's curious identity

May 16, 2007

87% Match
Graham Denham
Representation Theory
Combinatorics

We give a short, case-free and combinatorial proof of de Concini and Procesi's formula for the volume of the simplicial cone spanned by the simple roots of any finite root system. The argument presented here also extends their formula to include the non-crystallographic root systems.

Find SimilarView on arXiv

On Volumes of Permutation Polytopes

February 28, 2011

87% Match
Katherine Burggraf, Loera Jesús A. De, Mohamed Omar
Combinatorics

This paper focuses on determining the volumes of permutation polytopes associated to cyclic groups, dihedral groups, groups of automorphisms of tree graphs, and Frobenius groups. We do this through the use of triangulations and the calculation of Ehrhart polynomials. We also present results on the theta body hierarchy of various permutation polytopes.

Find SimilarView on arXiv

Counting integer points of flow polytopes

June 13, 2019

86% Match
Kabir Kapoor, Karola Mészáros, Linus Setiabrata
Combinatorics

The Baldoni--Vergne volume and Ehrhart polynomial formulas for flow polytopes are significant in at least two ways. On one hand, these formulas are in terms of Kostant partition functions, connecting flow polytopes to this classical vector partition function fundamental in representation theory. On the other hand the Ehrhart polynomials can be read off from the volume functions of flow polytopes. The latter is remarkable since the leading term of the Ehrhart polynomial of an ...

Find SimilarView on arXiv

An Invitation to Ehrhart Theory: Polyhedral Geometry and its Applications in Enumerative Combinatorics

May 29, 2014

86% Match
Felix Breuer
Combinatorics

In this expository article we give an introduction to Ehrhart theory, i.e., the theory of integer points in polyhedra, and take a tour through its applications in enumerative combinatorics. Topics include geometric modeling in combinatorics, Ehrhart's method for proving that a couting function is a polynomial, the connection between polyhedral cones, rational functions and quasisymmetric functions, methods for bounding coefficients, combinatorial reciprocity theorems, algorit...

Find SimilarView on arXiv

On volume functions of special flow polytopes

April 10, 2019

86% Match
Takayuki Negishi, Yuki Sugiyama, Tatsuru Takakura
Combinatorics

In this paper, we consider the volume of a special kind of flow polytope. We show that its volume satisfies a certain system of differential equations, and conversely, the solution of the system of differential equations is unique up to a constant multiple. In addition, we give an inductive formula for the volume with respect to the rank of the root system of type A.

Find SimilarView on arXiv

Volumes and Ehrhart polynomials of flow polytopes

October 2, 2017

86% Match
Karola Mészáros, Alejandro H. Morales
Combinatorics

The Lidskii formula for the type $A_n$ root system expresses the volume and Ehrhart polynomial of the flow polytope of the complete graph with nonnegative integer netflows in terms of Kostant partition functions. For every integer polytope the volume is the leading coefficient of the Ehrhart polynomial. The beauty of the Lidskii formula is the revelation that for these polytopes its Ehrhart polynomial function can be deduced from its volume function! Baldoni and Vergne genera...

Find SimilarView on arXiv

Classification of Convex lattice polytopes

March 1, 2011

86% Match
Heling Liu, Chuanming Zong
Metric Geometry
Number Theory

In this paper we study the classification problem of convex lattice ploytopes with respect to given volume or given cardinality.

Find SimilarView on arXiv