Related papers: Semi-interlaced polytopes
Let D be a division ring. We say that D is left algebraic over a (not necessarily central) subfield K of D if every x in D satisfies a polynomial equation x^n + a_{n-1}x^{n-1}+...+a_0=0 with a_0,...,a_{n-1} in K. We show that if D is a…
Alon and F\"uredi (European J. Combin. 1993) gave a tight bound for the following hyperplane covering problem: find the minimum number of hyperplanes required to cover all points of the n-dimensional hypercube {0,1}^n except the origin.…
We study the class of (locally) anti-blocking bodies as well as some associated classes of convex bodies. For these bodies, we prove geometric inequalities regarding volumes and mixed volumes, including Godberson's conjecture, near-optimal…
In this article we prove a formula for the volume of 4-dimensional polytopes, in terms of their face bivectors, and the crossings within their boundary graph. This proves that the volume is an invariant of bivector-coloured graphs in $S^3$.
For a hyperbolic knot and a natural number n, we consider the Alexander polynomial twisted by the n-th symmetric power of a lift of the holonomy. We establish the asymptotic behavior of these twisted Alexander polynomials evaluated at unit…
The (combinatorial) diameter of a polytope $P \subseteq \mathbb R^d$ is the maximum value of a shortest path between a pair of vertices on the 1-skeleton of $P$, that is the graph where the nodes are given by the $0$-dimensional faces of…
The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…
For a polynomial $P$ mapping the integers into the integers, define an averaging operator $A_{N} f(x):=\frac{1}{N}\sum_{k=1}^N f(x+P(k))$ acting on functions on the integers. We prove sufficient conditions for the $\ell^{p}$-improving…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
In this paper we develop a theory of volume polynomials of generalized virtual polytopes based on the study of topology of affine subspace arrangements in a real Euclidean space. We apply this theory to obtain a topological version of the…
In this paper, we generalize the result on the average volume of random polytopes with vertices following beta distributionsto the case of non-identically distributed vectors. Specifically,we consider the convex hull of independent random…
Let $X_1,\ldots,X_n$ be i.i.d.\ random points in the $d$-dimensional Euclidean space sampled according to one of the following probability densities: $$ f_{d,\beta} (x) = \text{const} \cdot (1-\|x\|^2)^{\beta}, \quad \|x\|\leq 1, \quad…
The path to the solution of Feder-Vardi dichotomy conjecture by Bulatov and Zhuk led through showing that more and more general algebraic conditions imply polynomial-time algorithms for the finite-domain Constraint Satisfaction Problems…
We present a simple phenomenological formula which approximates the hyperbolic volume of a knot using only a single evaluation of its Jones polynomial at a root of unity. The average error is just $2.86$% on the first $1.7$ million knots,…
The r-parallel set to a set A in a Euclidean space consists of all points with distance at most r from A. We clarify the relation between the volume and the surface area of parallel sets and study the asymptotic behaviour of both quantities…
We study mixed-moment models (full zeroth moment, half higher moments) for a Fokker-Planck equation in one space dimension. Mixed-moment minimum-entropy models are known to overcome the zero net-flux problem of full-moment minimum entropy…
By calculating the first order variation of the dual mixed volumes, we put forward a new concept Orlicz multiple dual mixed volumes. The classical dual mixed volumes and dual Aleksandrov-Fenchel inequality are generalized to the Orlicz…
We consider polyhedra and 4-polytopes in Minkowski spacetime - in particular, null polyhedra with zero volume, and 4-polytopes that have such polyhedra as their hyperfaces. We present the basic properties of several classes of null-faced…
We suggest a method of computing volume for a simple polytope $P$ in three-dimensional hyperbolic space $\mathbb{H}^3$. This method combines the combinatorial reduction of $P$ as a trivalent graph $\Gamma$ (the $1$-skeleton of $P$) by…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…