Integration of polynomials over N-dimensional linear polyhedra

This paper is concerned with explicit integration formulae for computing integrals of n-variate polynomials over linear polyhedra in n-dimensional space ℝn. Two different approaches are discussed; the first set of formulae is obtained by mapping the polyhedron in n-dimensional space ℝn into a standard n-simplex in ℝn, while the second set of formulae is obtained by reducing the n-dimensional integral to a sum of n - 1 dimensional integrals which are n + 1 in number. These formulae are followed by an application example for which we have explained the detailed computational scheme. The symbolic integration formulae presented in this paper may lead to an easy and systematic incorporation of global properties of solid objects, such as, for example, volume, centre of mass, moments of inertia etc., required in engineering design problems. © 1997 Elsevier Science Ltd

Software for Exact Integration of Polynomials over Polyhedra

We are interested in the fast computation of the exact value of integrals of polynomial functions over convex polyhedra. We present speed ups and extensions of the algorithms presented in previous work. We present the new software implementation and provide benchmark computations. The computation of integrals of polynomials over polyhedral regions has many applications; here we demonstrate our algorithmic tools solving a challenge from combinatorial voting theory.Comment: Major updat

Exploiting Polyhedral Symmetries in Social Choice

A large amount of literature in social choice theory deals with quantifying the probability of certain election outcomes. One way of computing the probability of a specific voting situation under the Impartial Anonymous Culture assumption is via counting integral points in polyhedra. Here, Ehrhart theory can help, but unfortunately the dimension and complexity of the involved polyhedra grows rapidly with the number of candidates. However, if we exploit available polyhedral symmetries, some computations become possible that previously were infeasible. We show this in three well known examples: Condorcet's paradox, Condorcet efficiency of plurality voting and in Plurality voting vs Plurality Runoff.Comment: 14 pages; with minor improvements; to be published in Social Choice and Welfar

Searching for integrable Hamiltonian systems with Platonic symmetries

In this paper we try to find examples of integrable natural Hamiltonian systems on the sphere $S^2$ with the symmetries of each Platonic polyhedra. Although some of these systems are known, their expression is extremely complicated; we try here to find the simplest possible expressions for this kind of dynamical systems. Even in the simplest cases it is not easy to prove their integrability by direct computation of the first integrals, therefore, we make use of numerical methods to provide evidences of integrability; namely, by analyzing their Poincar\'e sections (surface sections). In this way we find three systems with platonic symmetries, one for each class of equivalent Platonic polyhedra: tetrahedral, exahedral-octahedral, dodecahedral-icosahedral, showing evidences of integrability. The proof of integrability and the construction of the first integrals are left for further works. As an outline of the possible developments if the integrability of these systems will be proved, we show how to build from them new integrable systems in dimension three and, from these, superintegrable systems in dimension four corresponding to superintegrable interactions among four points on a line, in analogy with the systems with dihedral symmetry treated in a previous article. A common feature of these possibly integrable systems is, besides to the rich symmetry group on the configuration manifold, the partition of the latter into dynamically separated regions showing a simple structure of the potential in their interior. This observation allows to conjecture integrability for a class of Hamiltonian systems in the Euclidean spaces.Comment: 22 pages; 4 figure

A Generating Function for all Semi-Magic Squares and the Volume of the Birkhoff Polytope

We present a multivariate generating function for all n x n nonnegative integral matrices with all row and column sums equal to a positive integer t, the so called semi-magic squares. As a consequence we obtain formulas for all coefficients of the Ehrhart polynomial of the polytope B_n of n x n doubly-stochastic matrices, also known as the Birkhoff polytope. In particular we derive formulas for the volumes of B_n and any of its faces.Comment: 24 pages, 1 figure. To appear in Journal of Algebraic Combinatoric

An exact general remeshing scheme applied to physically conservative voxelization

We present an exact general remeshing scheme to compute analytic integrals of polynomial functions over the intersections between convex polyhedral cells of old and new meshes. In physics applications this allows one to ensure global mass, momentum, and energy conservation while applying higher-order polynomial interpolation. We elaborate on applications of our algorithm arising in the analysis of cosmological N-body data, computer graphics, and continuum mechanics problems. We focus on the particular case of remeshing tetrahedral cells onto a Cartesian grid such that the volume integral of the polynomial density function given on the input mesh is guaranteed to equal the corresponding integral over the output mesh. We refer to this as "physically conservative voxelization". At the core of our method is an algorithm for intersecting two convex polyhedra by successively clipping one against the faces of the other. This algorithm is an implementation of the ideas presented abstractly by Sugihara (1994), who suggests using the planar graph representations of convex polyhedra to ensure topological consistency of the output. This makes our implementation robust to geometric degeneracy in the input. We employ a simplicial decomposition to calculate moment integrals up to quadratic order over the resulting intersection domain. We also address practical issues arising in a software implementation, including numerical stability in geometric calculations, management of cancellation errors, and extension to two dimensions. In a comparison to recent work, we show substantial performance gains. We provide a C implementation intended to be a fast, accurate, and robust tool for geometric calculations on polyhedral mesh elements.Comment: Code implementation available at https://github.com/devonmpowell/r3