Related papers: Unmixing the mixed volume computation
It is shown that any smooth closed orientable manifold of dimension $2k + 1$, $k \geq 2$, admits a smooth polynomially convex embedding into $\mathbb C^{3k}$. This improves by $1$ the previously known lower bound of $3k+1$ on the possible…
This paper, about a fluid-like system of spatially confined particles, reveals the analytic structure for both, the canonical and grand canonical partition functions. The studied system is inhomogeneously distributed in a region whose…
A polycube is an orthogonal polyhedron composed of unit cubes glued together along entire faces, and homeomorphic to a sphere. A layer of a polycube refers to the portion lying between two horizontal cross-sections spaced one unit apart. We…
Let $K$ be a convex compact $GB$-subset of a separable Hilbert space $H$. Denote by $\mathrm{Spec}_k K$ the set $\{(\xi_1(h), \ldots, \xi_k(h))\colon h\in K\}\subset \mathbb{R}^k,$ where $\xi_1, \ldots, \xi_k$ are independent copies of the…
We study the problem of bounding the number of cusps of a complex hyperbolic manifold in terms of its volume. Applying algebro-geometric methods using Mumford's work on toroidal compactifications and its generalization due to N. Mok and…
It is known that the volume function for hyperbolic manifolds of dimension $\geq 3$ is finite-to-one. We show that the number of nonhomeomorphic hyperbolic 4-manifolds with the same volume can be made arbitrarily large. This is done by…
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
We introduce the notion of quadratic hull of a linear code, and give some of its properties. We then show that any symmetric bilinear multiplication algorithm for a finite-dimensional algebra over a field can be obtained by…
In this paper we consider the following analog of Bezout inequality for mixed volumes: $$V(P_1,\dots,P_r,\Delta^{n-r})V_n(\Delta)^{r-1}\leq \prod_{i=1}^r V(P_i,\Delta^{n-1})\ \text{ for }2\leq r\leq n.$$ We show that the above inequality is…
Counting Euclidean triangulations with vertices in a finite set $\C$ of the convex hull $\conv(\C)$ of $\C$ is difficult in general, both algorithmically and theoretically. The aim of this paper is to describe nearly convex polygons, a…
Coupled cluster theory produced arguably the most widely used high-accuracy computational quantum chemistry methods. Despite the approach's overall great computational success, its mathematical understanding is so far limited to results…
We investigate weighted floating bodies of polytopes. We show that the weighted volume depends on the complete flags of the polytope. This connection is obtained by introducing flag simplices, which translate between the metric and…
Taking the convex hull of a curve is a natural construction in computational geometry. On the other hand, path signatures, central in stochastic analysis, capture geometric properties of curves, although their exact interpretation for…
Given an $n$-dimensional convex body by a membership oracle in general, it is known that any polynomial-time deterministic algorithm cannot approximate its volume within ratio $(n/\log n)^n$. There is a substantial progress on randomized…
The notion of hidden symmetry algebra used in the context of exactly solvable systems is re-examined from the purely algebraic way, analyzing subspaces of commuting polynomials that generate finite-dimensional quadratic algebras. By…
The classical volume polynomial in algebraic geometry measures the degrees of ample (and nef) divisors on a smooth projective variety. We introduce an analogous volume polynomial for matroids, and give a complete combinatorial formula. For…
We give a short survey on computational techniques which can be used to solve the representation conversion problem for polyhedra up to symmetries. We in particular discuss decomposition methods, which reduce the problem to a number of…
Symmetry plays a central role in accelerating symbolic computation involving polynomials. This chapter surveys recent developments and foundational methods that leverage the inherent symmetries of polynomial systems to reduce complexity,…
This paper focuses on the investigation of volumes of large Coxeter hyperbolic polyhedron. First, the paper investigates the smallest possible volume for a large Coxeter hyperbolic polyhedron and then looks at the volume of pyramids with…
The cone-volume measure of a polytope with centroid at the origin is proved to satisfy the subspace concentration condition. As a consequence a conjectured (a dozen years ago) fundamental sharp affine isoperimetric inequality for the…