English
Related papers

Related papers: Quantitative Steinitz theorem and polarity

200 papers

A well-known theorem of Quillen says that if $r(z,\bar{z})$ is a bihomogeneous polynomial on ${\mathbb{C}}^n$ positive on the sphere, then there exists $d$ such that $r(z,\bar{z}){\lVert z \rVert}^{2d}$ is a squared norm. We obtain…

Algebraic Geometry · Mathematics 2013-12-05 Jennifer Halfpap , Jiri Lebl

We show that, if the interior of a lattice d-polytope P contains at least one lattice point, then it contains a lattice point whose coefficient of asymmetry with respect to P is at most b for some number b depending on d only. As an…

Combinatorics · Mathematics 2007-05-23 Oleg Pikhurko

Let $K \subset {\mathbb R}^2$ be an $o$-symmetric convex body, and $K^*$ its polar body. Then we have $|K|\cdot |K^*| \ge 8$, with equality if and only if $K$ is a parallelogram. ($| \cdot |$ denotes volume). If $K \subset {\mathbb R}^2$ is…

Metric Geometry · Mathematics 2015-07-07 K. J. Böröczky , E. Makai , M. Meyer , S. Reisner

Let $P$ and $Q$ be two convex polytopes both contained in the interior of an Euclidean ball $r\textbf{B}^{d}$. We prove that $P=Q$ provided that their sight cones from any point on the sphere $rS^{d-1}$ are congruent. We also prove an…

Metric Geometry · Mathematics 2018-11-14 Sergii Myroshnychenko

We present a solution of the algebraic version of Birkhoff Conjecture on integrable billiards. Namely we show that every polynomially integrable real bounded convex planar billiard with smooth boundary is an ellipse. We extend this result…

Dynamical Systems · Mathematics 2019-02-25 Alexey Glutsyuk

Given a bounded domain $D \subset {\mathbb R}^n$ strictly starlike with respect to $0 \in D\,,$ we define a quasi-inversion w.r.t. the boundary $\partial D \,.$ We show that the quasi-inversion is bi-Lipschitz w.r.t. the chordal metric if…

Complex Variables · Mathematics 2015-12-17 David Kalaj , Matti Vuorinen , Gendi Wang

We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most $9$ lattice points on its boundary, where a polygon $P$ is called pseudointegral if the Ehrhart function of $P$ is a polynomial. We…

Combinatorics · Mathematics 2025-01-14 Tyrrell B. McAllister , Jason S. Williford

Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form…

Number Theory · Mathematics 2018-03-29 Bryce Kerr , Ali Mohammadi

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Number Theory · Mathematics 2024-01-24 Clemens Fuchs , Vincenzo Mantova , Umberto Zannier

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

An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…

Metric Geometry · Mathematics 2021-12-16 Csaba Vincze , Márk Oláh , Letícia Lengyel

We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…

Number Theory · Mathematics 2016-08-23 Nikolai Bliznyakov , Stanislav Kondratyev

We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…

Metric Geometry · Mathematics 2008-08-11 Matija Cencelj , Dušan Repovš , Mikhail Skopenkov

Recently Guth and Katz \cite{GK2} invented, as a step in their nearly complete solution of Erd\H{o}s's distinct distances problem, a new method for partitioning finite point sets in $\R^d$, based on the Stone--Tukey polynomial ham-sandwich…

Combinatorics · Mathematics 2011-03-01 Haim Kaplan , Jiří Matoušek , Micha Sharir

We apply the techniques developed by Marcus, Spielman and Srivastava, working with principal submatrices in place of rank $1$ decompositions to give an alternate proof of their results on restricted invertibility. We show that one can find…

Functional Analysis · Mathematics 2017-03-16 Mohan Ravichandran

We prove that for q>=1, there exists r(q)<1 such that for p>r(q), the number of points in large boxes which belongs to the infinite cluster has a normal central limit behaviour under the random cluster measure phi_{p,q} on Z^d, d>=2.…

Probability · Mathematics 2007-05-23 Olivier Garet

Let $p:\mathbb{C} \rightarrow \mathbb{C}$ be a polynomial. The Gauss-Lucas theorem states that its critical points, $p'(z) = 0$, are contained in the convex hull of its roots. We prove a stability version whose simplest form is as follows:…

Complex Variables · Mathematics 2018-12-18 Stefan Steinerberger

We prove bounds on intersections of algebraic varieties in $\mathbb{C}^4$ with Cartesian products of finite sets from $\mathbb{C}^2$, and we point out connections with several classic theorems from combinatorial geometry. Consider an…

Combinatorics · Mathematics 2017-12-21 Hossein Nassajian Mojarrad , Thang Pham , Claudiu Valculescu , Frank de Zeeuw

We consider the convex hull of a finite sample of i.i.d. points uniformly distributed in a convex body in $\R^d$, $d\geq 2$. We prove an exponential deviation inequality, which leads to rate optimal upper bounds on all the moments of the…

Statistics Theory · Mathematics 2013-11-13 Victor-Emmanuel Brunel

Putinar's Positivstellensatz is a central theorem in real algebraic geometry. It states the following: If you have a set $S= \{ x \in R^n \ | \ g_1 (x) \geq 0, ... , g_m(x) \geq 0\}$ described by some real polynomials $g_i$, then every real…

Algebraic Geometry · Mathematics 2016-03-23 Tom-Lukas Kriel
‹ Prev 1 3 4 5 6 7 10 Next ›