English
Related papers

Related papers: Inradius of random lemniscates

200 papers

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

Combinatorics · Mathematics 2018-06-04 Benjamin Braun , Robert Davis , Liam Solus

Let $G$ be a graph of minimum degree at least $k$ and let $G_p$ be the random subgraph of $G$ obtained by keeping each edge independently with probability $p$. We are interested in the size of the largest complete minor that $G_p$ contains…

Combinatorics · Mathematics 2021-07-01 Joshua Erde , Mihyun Kang , Michael Krivelevich

The problem "A general characterization of uniqueness polynomial for non-critically injective polynomials" has been remained open since the last two decades. In this paper, we explore this open problem. To this end, we initiate a new…

Complex Variables · Mathematics 2025-02-11 Pratap Basak , Sanjay Mallick

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n/2$. Levit and Mandrescu…

Combinatorics · Mathematics 2017-09-26 Jason I. Brown , Ben Cameron

We prove that lemniscates (i.e., sets of the form $|P(z)|=1$ where $P$ is a complex polynomial) are irreducible real algebraic curves.

Algebraic Geometry · Mathematics 2024-12-03 S. Yu. Orevkov

The Newton polytope $P_f$ of a polynomial $f$ is well known to have a strong impact on its zeros, as in the Kouchnirenko-Bernstein theorem on the number of simultaneous zeros of $m$ polynomials with given Newton polytopes. In this article,…

Algebraic Geometry · Mathematics 2007-05-23 Bernard Shiffman , Steve Zelditch

Polynomial meshes (called sometimes "norming sets") allow us to estimate the supremum norm of polynomials on a fixed compact set by the norm on its discrete subset. We give a general construction of polynomial weakly admissible meshes on…

Numerical Analysis · Mathematics 2025-01-22 Leokadia Bialas-Ciez , Agnieszka Kowalska , Alvise Sommariva

We study integer programming instances over polytopes P(A,b)={x:Ax<=b} where the constraint matrix A is random, i.e., its entries are i.i.d. Gaussian or, more generally, its rows are i.i.d. from a spherically symmetric distribution. The…

Data Structures and Algorithms · Computer Science 2013-08-27 Karthekeyan Chandrasekaran , Santosh Vempala

Let $\Rx$ denote the ring of polynomials in $g$ freely non-commuting variables $x=(x_1,...,x_g)$. There is a natural involution * on $\Rx$ determined by $x_j^*=x_j$ and $(pq)^*=q^* p^*$ and a free polynomial $p\in\Rx$ is symmetric if it is…

Functional Analysis · Mathematics 2012-08-20 Sriram Balasubramanian , Scott McCullough

We relate the injectivity of the canonical map from $C(B_{E'})$ to $L_p(\mu)$, where $\mu$ is a regular Borel probability measure on the closed unit ball $B_{E'}$ of the dual $E'$ of a Banach space $E$ endowed with the weak* topology, to…

Functional Analysis · Mathematics 2012-10-12 Geraldo Botelho , Daniel Pellegrino , Pilar Rueda

We study the roots of a random polynomial over the field of $p$-adic numbers. For a random monic polynomial with i.i.d. coefficients in $\mathbb{Z}_p$, we obtain an estimate for the expected number of roots of this polynomial. In…

Number Theory · Mathematics 2021-12-22 Roy Shmueli

We study asymptotic zero distribution of random Laurent polynomials whose support are contained in dilates of a fixed integral polytope $P$ as their degree grow. We consider a large class of probability distributions including the ones…

Complex Variables · Mathematics 2017-06-06 Turgay Bayraktar

To minimize or upper-bound the value of a function "robustly", we might instead minimize or upper-bound the "epsilon-robust regularization", defined as the map from a point to the maximum value of the function within an epsilon-radius. This…

Optimization and Control · Mathematics 2010-06-10 Adrian S. Lewis , C. H. Jeffrey Pang

We study the a.s. convergence of a sequence of random embeddings of a fixed manifold into Euclidean spaces of increasing dimensions. We show that the limit is deterministic. As a consequence, we show that many intrinsic functionals of the…

Probability · Mathematics 2017-01-20 Sunder Ram Krishnan , Jonathan E. Taylor , Robert J. Adler

We establish asymptotic upper bounds on the number of zeros modulo $p$ of certain polynomials with integer coefficients, with $p$ prime numbers arbitrarily large. The polynomials we consider have degree of size $p$ and are obtained by…

Number Theory · Mathematics 2022-01-19 Amit Ghosh , Kenneth Ward

This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…

Dynamical Systems · Mathematics 2017-12-05 Saša V. Raković , Mario E. Villanueva

The plethysm coefficient $p(\nu, \mu, \lambda)$ is the multiplicity of the Schur function $s_\lambda$ in the plethysm product $s_\nu \circ s_\mu$. In this paper we use Schur--Weyl duality between wreath products of symmetric groups and the…

Representation Theory · Mathematics 2024-12-17 Chris Bowman , Rowena Paget , Mark Wildon

Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…

Number Theory · Mathematics 2026-05-19 Gennady Bachman

Complex 1-variable polynomials with connected Julia sets and only repelling periodic points are called \emph{dendritic}. By results of Kiwi, any dendritic polynomial is semi-conjugate to a topological polynomial whose topological Julia set…

Dynamical Systems · Mathematics 2021-12-21 Alexander Blokh , Lex Oversteegen , Ross Ptacek , Vladlen Timorin

For a convex lattice polytope $P\subset \mathbb R^d$ of dimension $d$ with vertices in $\mathbb Z^d$, denote by $L(P)$ its discrete volume which is defined as the number of integer points inside $P$. The classical result due to Ehrhart says…

Metric Geometry · Mathematics 2021-07-15 Mariia Dospolova