English
Related papers

Related papers: Expected Multivolumes of Random Amoebas

200 papers

We outline a strategy for computing intersection numbers on smooth varieties with torus actions using a residue formula of Bott. As an example, Gromov-Witten numbers of twisted cubic and elliptic quartic curves on some general complete…

alg-geom · Mathematics 2008-02-03 G. Ellingsrud , S. A. Strømme

We describe a model of random links based on random 4-valent maps, which can be sampled due to the work of Schaeffer. We will look at the relationship between the combinatorial information in the diagram and the hyperbolic volume.…

Geometric Topology · Mathematics 2017-01-31 Malik Obeidin

For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…

Metric Geometry · Mathematics 2017-06-13 Rolf Schneider

There is presented an algorithm for computing the topological degree for a large class of polynomial mappings. As an application there is given an effective algebraic formula for the intersection number of a polynomial immersion M --> R^2m,…

Algebraic Geometry · Mathematics 2008-07-14 Iwona Karolkiewicz , Aleksandra Nowel , Zbigniew Szafraniec

Let K be a convex body in $R^d$. A random polytope is the convex hull $[x_1,...,x_n]$ of finitely many points chosen at random in K. $\Bbb E(K,n)$ is the expectation of the volume of a random polytope of n randomly chosen points. I.…

Metric Geometry · Mathematics 2016-09-06 Carsten Schütt

We derive explicit formulae for the expected volume and the expected number of facets of the convex hull of several multidimensional Gaussian random walks in terms of the Gaussian persistence probabilities. Special cases include the already…

Probability · Mathematics 2020-12-25 Julien Randon-Furling , Dmitry Zaporozhets

We give a complete description of amoebas and coamoebas of $k$-dimensional very affine linear spaces in $(\mathbb{C}^*)^{n}$. This include an upper bound of their dimension, and we show that if a $k$-dimensional very affine linear space in…

Algebraic Geometry · Mathematics 2016-09-14 Mounir Nisse , Mikael Passare

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

Metric Geometry · Mathematics 2014-10-15 Károly J. Böröczky , Ferenc Fodor , Daniel Hug

Let $T$ be the triangle in the plane with vertices $(0, 0)$, $(0,1)$ and $(0, 1)$. The convex hull $T_n$ of points $(0, 1)$, $(1, 0)$ and $n$ independent random points uniformly distributed in $T$ is the random convex chain. In this paper…

Probability · Mathematics 2025-10-20 Anna Gusakova , Anna Muranova

In this paper, we establish effective equidistribution of transverse intersection points between properly immersed totally geodesic submanifolds of complementary dimensions in a finite-volume hyperbolic manifold with respect to the…

Dynamical Systems · Mathematics 2025-12-02 Tina Torkaman , Yongquan Zhang

Let $X_1,\ldots,X_N$, $N>n$, be independent random points in $\mathbb{R}^n$, distributed according to the so-called beta or beta-prime distribution, respectively. We establish threshold phenomena for the volume, intrinsic volumes, or more…

Metric Geometry · Mathematics 2018-06-15 Gilles Bonnet , Giorgos Chasapis , Julian Grote , Daniel Temesvari , Nicola Turchi

For two families of random polytopes we compute explicitly the expected sums of the conic intrinsic volumes and the Grassmann angles at all faces of any given dimension of the polytope under consideration. As special cases, we compute the…

Probability · Mathematics 2020-07-16 Thomas Godland , Zakhar Kabluchko , Dmitry Zaporozhets

The collection $\mathcal{M}_n$ of all metric spaces on $n$ points whose diameter is at most $2$ can naturally be viewed as a compact convex subset of $\mathbb{R}^{\binom{n}{2}}$, known as the metric polytope. In this paper, we study the…

Probability · Mathematics 2022-05-31 Gady Kozma , Tom Meyerovitch , Ron Peled , Wojciech Samotij

Intrinsic volumes, which generalize both Euler characteristic and Lebesgue volume, are important properties of $d$-dimensional sets. A random cubical complex is a union of unit cubes, each with vertices on a regular cubic lattice,…

Probability · Mathematics 2021-08-24 Michael Werman , Matthew L. Wright

We review results of papers written on the topic of polynomial amoebas with an emphasis on computational aspects of the topic. The polynomial amoebas have a lot of applications in various domains of science. Computation of the amoeba for a…

Complex Variables · Mathematics 2022-11-18 Vitaly A. Krasikov

This article is a survey on the topic of polynomial amoebas. We review results of papers written on the topic with an emphasis on its computational aspects. Polynomial amoebas have numerous applications in various domains of mathematics and…

Complex Variables · Mathematics 2023-05-02 Vitaly A. Krasikov

We present a deterministic polynomial-time algorithm for estimating the volume of a hypercube intersected by a fixed number of constraints of the type $f(x) \leq b$, where $f$ is the sum of univariate functions that are each nonnegative,…

Data Structures and Algorithms · Computer Science 2026-05-20 Kyra Gunluk

The convex hull of several i.i.d. beta distributed random vectors in $\mathbb R^d$ is called the random beta polytope. Recently, the expected values of their intrinsic volumes, number of faces, normal and tangent angles and other quantities…

Probability · Mathematics 2021-11-16 Ekaterina Simarova

We present a new algorithm to calculate exact hypervolumes. Given a set of $d$-dimensional points, it computes the hypervolume of the dominated space. Determining this value is an important subroutine of Multiobjective Evolutionary…

Data Structures and Algorithms · Computer Science 2012-11-30 Luís M. S. Russo , Alexandre P. Francisco

We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…

Optimization and Control · Mathematics 2024-08-30 Marius Costandin