Related papers: Polynomial Bounds in Koldobsky's Discrete Slicing …

In 2016 Ananyan and Hochster proved Stillman's conjecture by showing the existence of a uniform upper bound on the length of an $R_\eta$-sequence containing fixed $n$ forms of degree at most $d$ in polynomial rings over a field. This result…

Makeev conjectured that every constant-width body is inscribed in the dual difference body of a regular simplex. We prove that homologically, there are an odd number of such circumscribing bodies in dimension 3, and therefore geometrically…

We show that an $n$-dimensional Riemannian manifold with $n$-nonnegative or $n$-nonpositive curvature operator of the second kind has restricted holonomy $SO(n)$ or is flat. The result does not depend on completeness and can be improved…

We consider maximum packings of edge-disjoint $4$-cliques in the complete graph $K_n$. When $n \equiv 1$ or $4 \pmod{12}$, these are simply block designs. In other congruence classes, there are necessarily uncovered edges; we examine the…

We generalize the classical Hardy and Faber-Krahn inequalities to arbitrary functions on a convex body $\Omega \subset \mathbb{R}^n$, not necessarily vanishing on the boundary $\partial \Omega$. This reduces the study of the Neumann…

Erd\H{o}s asked what is the maximum number $\alpha(n)$ such that every set of $n$ points in the plane with no four on a line contains $\alpha(n)$ points in general position. We consider variants of this question for $d$-dimensional point…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

A homemorphism between domains in $\mathbb R^n$, $n\ge 2$ is quasiconformal, with its intricate analytic and geometric consequences, if the (pointwise) linear dilatation -- a purely metric quantity -- is uniformly bounded. Gehring proved…

For a semialgebraic set K in R^n, let P_d(K) be the cone of polynomials in R^n of degrees at most d that are nonnegative on K. This paper studies the geometry of its boundary. When K=R^n and d is even, we show that its boundary lies on the…

In this paper, we investigate the boundary H\"{o}lder regularity for elliptic equations (precisely, the Poisson equation, linear equations in divergence form and non-divergence form, the p-Laplace equations and fully nonlinear elliptic…

In 1992, Kalai and Kleitman proved that the diameter of a $d$-dimensional polyhedron with $n$ facets is at most $n^{2+\log_2 d}$. In 2014, Todd improved the Kalai-Kleitman bound to $(n-d)^{\log_2 d}$. We improve the Todd bound to…

The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex…

Let $\Gamma$ be a nonuniform lattice acting on real hyperbolic n-space. We show that in dimension greater than or equal to 4, the volume of a representation is constant on each connected component of the representation variety of $\Gamma$…

By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…

We present a new proof (based on spectral decomposition) of a bound originally proved by Sidelnikov~\, for the frame potentials $\sum_{ij} \left( {\bf P}_i \cdot {\bf P}_j \right)^\ell $ on a unit--sphere in $d$ dimensions. Sidelnikov's…

Let $\mathrm{R}$ be a real closed field. We prove that the number of semi-algebraically connected components of a real hypersurface in $\mathrm{R}^n$ defined by a multi-affine polynomial of degree $d$ is bounded by $2^{d-1}$. This bound is…

Given an open bounded subset $\Omega$ of $\mathbb{R}^n$, which is convex and satisfies an interior sphere condition, we consider the pde $-\Delta_{\infty} u = 1$ in $\Omega$, subject to the homogeneous boundary condition $u = 0$ on…

In every dimension $d\ge1$, we establish the existence of a constant $v_d>0$ and of a subset $\mathcal U_d$ of $\mathbb R^d$ such that the following holds: $\mathcal C+\mathcal U_d=\mathbb R^d$ for every convex set $\mathcal C\subset…

The Monotone Upper Bound Problem (Klee, 1965) asks if the number M(d,n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d,n) = M_{ubt}(d,n), the maximal…