Related papers: Computing the Volume of Polytropes
We observe that a large part of the volume of a hyperbolic polyhedron is taken by a tubular neighbourhood of its boundary, and use this to give a new proof for the finiteness of arithmetic maximal reflection groups following a recent work…
Volume estimates of metric balls in manifolds find diverse applications in information and coding theory. In this paper, some new results for the volume of a metric ball in unitary group are derived via various tools from random matrix…
We study a class of 2-variable polynomials called exact polynomials which contains $A$-polynomials of knot complements. The Mahler measure of these polynomials can be computed in terms of a volume function defined on the vanishing set of…
We have found analytical expressions (polynomials) of the percolation probability for site percolation on a square lattice of size $L \times L$ sites when considering a plane (the crossing probability in a given direction), a cylinder…
Let $K$ be a convex body in $\mathbb{R}^d$ which slides freely in a ball. Let $K^{(n)}$ denote the intersection of $n$ closed half-spaces containing $K$ whose bounding hyperplanes are independent and identically distributed according to a…
Given a vector a $\in$ Rn, we provide an alternative and direct proof for the formula of the volume of sections delta $\cap$ {x : a T x \textless{}= t} and slices $\cap$ {x : a T x = t}, t $\in$ R, of the simplex delta. For slices the…
For a d-dimensional convex lattice polytope P, a formula for the boundary volume is derived in terms of the number of boundary lattice points on the first $\floor{d/2}$ dilations of P. As an application we give a necessary and sufficient…
We show that the volume of the inner $r$-neighborhood of a polytope in the $d$-dimensional Euclidean space is a pluri-phase Steiner-like function, i.e. a continuous piecewise polynomial function of degree $d$, proving thus a conjecture of…
Champanerkar, Kofman and Lal\'{i}n conjectured an inequality between bipyramid volume of links and Mahler measure of associated dimer models induced from alternating links on torus. Hyperbolic volume and Mahler measure can be related for…
We consider the question of when points in tropical affine space uniquely determine a tropical hypersurface. We introduce a notion of multiplicity of points so that this question may be meaningful even if some of the points coincide. We…
A generalized hyperbolic tetrahedra is a polyhedron (possibly non-compact) with finite volume in hyperbolic space, obtained from a tetrahedron by the polar truncation at the vertices lying outside the space. In this paper it is proved that…
Jukes-Cantor model is one of the most meaningful statistical models from a biological perspective. We are interested in computing the algebraic degrees for phylogenetic varieties, which we call phylogenetic degrees, associated to the…
A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…
In the present article, the volume of the hypersphere in n-dimensional euclidean space is recalculated in a rather original way by using the theory of generalized functions (tempered distributions). The calculation is performed by applying…
In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and…
We describe a technique to obtain linear descriptions for polytopes from extended formulations. The simple idea is to first define a suitable lifting function and then to find linear constraints that are valid for the polytope and guarantee…
We present a software suite for the analysis and optimization of ideal convex polyhedra in hyperbolic 3-space $\mathbb{H}^3$. Using Rivin's variational characterization of ideal polyhedra, we develop efficient algorithms for checking…
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…
A coarse-grained multi-blob description of polymer solutions is presented, based on soft, transferable effective interactions between bonded and non-bonded blobs. The number of blobs is chosen such that the blob density does not exceed…