Related papers: On Horn's Problem and its Volume Function

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

Polyhedral-type approximations of convex-like domains in $\mathbb{C}^d$ have been considered recently by the second author. In particular, the decay rate of the error in optimal volume approximation as a function of the number of facets has…

Via a non degenerate symmetric bilinear form we identify the coadjoint representation with a new representation and so we induce on the orbits a simplectic form. By considering Hamiltonian systems on the orbits we study some features of…

For a classical weight function $\rho$ defined on a simply connected open subset $\Omega$ of $\mathbb{R}^2$ (either bounded or unbounded) with piecewise $C^1$ boundary, we prove density and compact embedding of a matrix-weighted Sobolev…

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

The classification of the unitary irreducible representations of symmetry groups is a cornerstone of modern quantum physics, as it provides the fundamental building blocks for constructing the Hilbert spaces of theories admitting these…

We construct a quasi-polynomial time deterministic approximation algorithm for computing the volume of an independent set polytope with restrictions. Randomized polynomial time approximation algorithms for computing the volume of a convex…

To a knot in 3-space, one can associate a sequence of Laurent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Volume Conjecture for small angles states that the value of the $n$-th colored Jones polynomial at…

Union volume estimation is a classical algorithmic problem. Given a family of objects $O_1,\ldots,O_n \subseteq \mathbb{R}^d$, we want to approximate the volume of their union. In the special case where all objects are boxes (also known as…

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

There is a two-component log-gas system with Boltzmann factor which provides an interpolation between the eigenvalue PDF for $\beta = 1$ and $\beta = 4$ invariant random matrix ensembles. The solvability of this log-gas system relies on the…

We consider two well-known problems: upper bounding the volume of lower dimensional ellipsoids contained in convex bodies given their John ellipsoid, and lower bounding the volume of ellipsoids containing projections of convex bodies given…

In the Onsager model of one-component hard-particle systems, the entire phase behaviour is dictated by a function of relative orientation, which represents the amount of space excluded to one particle by another at this relative…

We investigate properties of the pseudo-Riemannian volume, entropy, and diameter for convex cocompact representations $\rho : \Gamma \to \mathrm{SO}(p,q+1)$ of closed $p$-manifold groups. In particular: We provide a uniform lower bound of…

Fully chaotic Hamiltonian systems possess an infinite number of classical solutions which are periodic, e.g. a trajectory ``p'' returns to its initial conditions after some fixed time tau_p. Our aim is to investigate the spectrum tau_1,…

We argue that the conventional method to calculate the OPE coefficients in the strong coupling limit for heavy-heavy-light operators in the N=4 Super-Yang-Mills theory has to be modified by integrating the light vertex operator not only…

The intrinsic volumes of a convex cone are geometric functionals that return basic structural information about the cone. Recent research has demonstrated that conic intrinsic volumes are valuable for understanding the behavior of random…

The univariate Ehrhart and $h^*$-polynomials of lattice polytopes have been widely studied. We describe methods from toric geometry for computing multivariate versions of volume, Ehrhart and $h^*$-polynomials of lattice polytropes, which…

We give a method for computing asymptotic formulas and approximations for the volumes of spectrahedra, based on the maximum-entropy principle from statistical physics. The method gives an approximate volume formula based on a single convex…

We use cotangent bundles of spaces of smooth embeddings to construct symplectic dual pairs involving the group of volume preserving diffeomorphisms. Via symplectic reduction we obtain descriptions of coadjoint orbits of this group in terms…