Related papers: Expected Multivolumes of Random Amoebas

The asymptotics, as $n\to\infty$, for the expected number of distinct part sizes in a random composition of an integer n is obtained.

In this paper, we compute the number of self-intersections of a plane projection of a generic complete intersection curve defined by polynomials with the given support. Moreover, we discuss the tropical counterpart of this problem.

We investigate the asymptotic properties of random polytopes arising as convex hulls of $n$ independent random points sampled from a family of block-beta distributions. Notably, this family includes the uniform distribution on a product of…

Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…

We determine the number of singularities - counted whit multiplicities - of generic distributions of dimension and codimension one on smooth complete intersections in compact toric orbifolds with isolated singularities. We also present some…

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…

We provide two algorithms for computing the volume of a convex polytope with half-space representation {x>=0; Ax <=b} for some (m,n) matrix A and some m-vector b. Both algorithms have a O(n^m) computational complexity which makes them…

We propose a method to compute complex volume of 2-bridge link complements. Our construction sheds light on a relationship between cluster variables with coefficients and canonical decompositions of link complements.

In a closed manifold of positive dimension $n$, we estimate the expected volume and Euler characteristic for random submanifolds of codimension $r\in \{1,...,n\}$ in two different settings. On one hand, we consider a closed Riemannian…

We prove an explicit combinatorial formula for the expected number of faces of the zero polytope of the homogeneous and isotropic Poisson hyperplane tessellation in $\mathbb R^d$. The expected $f$-vector is expressed through the…

We describe a maximum entropy approach for computing volumes and counting integer points in polyhedra. To estimate the number of points from a particular set X in R^n in a polyhedron P in R^n, by solving a certain entropy maximization…

Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the…

We experimentally study the fundamental problem of computing the volume of a convex polytope given as an intersection of linear inequalities. We implement and evaluate practical randomized algorithms for accurately approximating the…

We investigate the real algebraic complexity of contours of amoebas associated with algebraic hypersurfaces and complete intersections in complex algebraic tori. Motivated by the foundational estimates of Lang--Shapiro--Shustin \cite{LSS},…

We prove an asymptotic estimate for the number of mxn non-negative integer matrices (contingency tables) with prescribed row and column sums and, more generally, for the number of integer feasible flows in a network. Similarly, we estimate…

Random 2-cell embeddings of a given graph $G$ are obtained by choosing a random local rotation around every vertex. We analyze the expected number of faces, $\mathbb{E}[F_G]$, of such an embedding which is equivalent to studying its average…

An identity due to Efron dating from 1965 relates the expected volume of the convex hull of $n$ random points to the expected number of vertices of the convex hull of $n+1$ random points. Forty years later this identity was extended from…

We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…

In this paper we discuss two different existing algorithms for computing topological entropy and we perform one of them in order to compute the isentropes for cubic polynomials.

We continue the study of engineered complete intersections (ECI) -- an umbrella generality for a number of important objects in combinatoiral and applied algebraic geometry (such as nondegenerate toric complete intersections, critical loci…