English
Related papers

Related papers: Zeros of random tropical polynomials, random polyt…

200 papers

Pick $d+1$ points uniformly at random on the unit sphere in $\mathbb R^d$. What is the expected value of the angle sum of the simplex spanned by these points? Choose $n$ points uniformly at random in the $d$-dimensional ball. What is the…

Probability · Mathematics 2020-03-04 Zakhar Kabluchko

This paper introduces the notion of probabilistic zero bounds for random polynomials. It presents new results regarding the probabilistic bounds of random polynomials whose coefficients are independently and identically distributed as…

Complex Variables · Mathematics 2026-05-27 Sajad A. Sheikh , Mohammad Ibrahim Mir

We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…

Metric Geometry · Mathematics 2020-05-22 Florian Besau , Daniel Rosen , Christoph Thäle

A $0/1$-polytope in $\mathbb{R}^n$ is the convex hull of a subset of $\{0,1\}^n$. The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and whose edges are the one-dimensional faces of $P$. A…

Combinatorics · Mathematics 2025-09-15 Asaf Ferber , Michael Krivelevich , Marcelo Sales , Wojciech Samotij

We prove the central limit theorem for the volume and the $f$-vector of the Poisson random polytope $\Pi_{\eta}$ in a fixed convex polytope $P\subset\mathbb{R}^d$. Here, $\Pi_{\eta}$ is the convex hull of the intersection of a Poisson…

Probability · Mathematics 2010-10-19 Imre Bárány , Matthias Reitzner

Sparse polynomial systems with vertical coefficient dependencies arise naturally when describing the critical points of optimization problems and, when augmented with linear forms, the steady states of chemical reaction networks. Moreover,…

Algebraic Geometry · Mathematics 2026-05-11 Elisenda Feliu , Paul Alexander Helminck , Oskar Henriksson , Yue Ren , Benjamin Schröter , Máté L. Telek

The entropy of a tropical ideal is introduced. The radical of a tropical ideal consists of all tropical polynomials vanishing on the tropical prevariety determined by the ideal. We prove that the entropy of the radical of a tropical…

Algebraic Geometry · Mathematics 2020-12-01 Dima Grigoriev

We consider sequences of random variables whose probability generating functions are polynomials all of whose roots lie on the unit circle. The distribution of such random variables has only been sporadically studied in the literature. We…

Probability · Mathematics 2013-01-11 Hsien-Kuei Hwang , Vytas Zacharovas

The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev $p$-norm ($1<p<\infty$) for the case $p=1$. Some relevant examples are indicated. The second part deals…

Complex Variables · Mathematics 2021-12-17 Abel Díaz-González , Héctor Pijeira-Cabrera , Javier Quintero-Roba

We introduce the notion of tropical defects, certificates that a system of polynomial equations is not a tropical basis, and provide two algorithms for finding them in affine spaces of complementary dimension to the zero set. We use these…

Algebraic Geometry · Mathematics 2019-11-12 Paul Görlach , Yue Ren , Jeff Sommars

We prove matching asymptotic lower and upper bounds on the variances of the intrinsic volumes and the number of $k$-faces of $d$-dimensional random beta-polytopes. Using Stein's methods, we establish central limit theorems for the intrinsic…

Metric Geometry · Mathematics 2025-12-04 Ferenc Fodor , Balázs Grünfelder

In theory of one complex variable, Gauss-Lucas Theorem states that the critical points of a non constant polynomial belong to the convex hull of the set of zeros of the polynomial. The exact analogue of this result cannot hold, in general,…

Complex Variables · Mathematics 2017-11-08 Sorin G. Gal , J. Oscar González-Cervantes , Irene Sabadini

The expected number of real zeros of an algebraic polynomial $a_0+a_1x+a_2x^2+a_3x^3+....+a_{n-1}x^{n-1}$ depends on the types of random coefficients, with large $n.$ In this article, we show that when the random coefficients…

Functional Analysis · Mathematics 2019-10-17 Sabita Sahoo , Partiswari Maharana

A soft random graph $G(n,r,p)$ can be obtained from the random geometric graph $G(n,r)$ by keeping every edge in $G(n,r)$ with probability $p$. The soft random simplicial complexes is a model for random simplicial complexes built over the…

Probability · Mathematics 2025-07-15 Julián David Candela

We consider random polytopes in the $d$-dimensional Euclidean space that are the convex hulls i.i.d. random points selected according to beta-prime distributions. These distributions are rotationally symmetric, heavy-tailed, and their…

Metric Geometry · Mathematics 2026-03-24 Ferenc Fodor , Balázs Grünfelder

We study equidistribution problem of zeros in relation to a sequence of $Z$-asymptotically Chebyshev polynomials on $\mathbb{C}^{m}$. We use certain results obtained in a very recent work of Bayraktar, Bloom and Levenberg and have an…

Complex Variables · Mathematics 2025-01-29 Ozan Günyüz

For a $d$-dimensional random vector $X$, let $p_{n, X}(\theta)$ be the probability that the convex hull of $n$ independent copies of $X$ contains a given point $\theta$. We provide several sharp inequalities regarding $p_{n, X}(\theta)$ and…

Probability · Mathematics 2023-01-11 Satoshi Hayakawa , Terry Lyons , Harald Oberhauser

Consider a random simplex $[X_1,\ldots,X_n]$ defined as the convex hull of independent identically distributed random points $X_1,\ldots,X_n$ in $\mathbb{R}^{n-1}$ with the following beta density: $$ f_{n-1,\beta} (x) \propto…

Probability · Mathematics 2020-07-14 Zakhar Kabluchko

We use Turan type inequalities to give new non-asymptotic bounds on the extreme zeros of orthogonal polynomials in terms of the coefficients of their three term recurrence. Most of our results deal with symmetric polynomials satisfying the…

Classical Analysis and ODEs · Mathematics 2025-10-20 Ilia Krasikov

We propose a general methodology for testing whether a given polynomial with integer coefficients is identically zero. The methodology evaluates the polynomial at efficiently computable approximations of suitable irrational points. In…

Data Structures and Algorithms · Computer Science 2007-05-23 Zhi-Zhong Chen , Ming-Yang Kao
‹ Prev 1 4 5 6 7 8 10 Next ›