English
Related papers

Related papers: New Subexponential Fewnomial Hypersurface Bounds

200 papers

For a finite set $X$ of points in the plane, a set $S$ in the plane, and a positive integer $k$, we say that a $k$-element subset $Y$ of $X$ is captured by $S$ if there is a homothetic copy $S'$ of $S$ such that $X\cap S' = Y$, i.e., $S'$…

Combinatorics · Mathematics 2015-07-14 Maria Axenovich , Torsten Ueckerdt

Let $H$ be a graph with maximum degree $d$, and let $d'\ge 0$. We show that for some $c>0$ depending on $H,d'$, and all integers $n\ge 0$, there are at most $c^n$ unlabelled simple $d$-connected $n$-vertex graphs with maximum degree at most…

Combinatorics · Mathematics 2019-10-11 Maria Chudnovsky , Martin Loebl , Paul Seymour

Given $s \ge k\ge 3$, let $h^{(k)}(s)$ be the minimum $t$ such that there exist arbitrarily large $k$-uniform hypergraphs $H$ whose independence number is at most polylogarithmic in the number of vertices and in which every $s$ vertices…

Combinatorics · Mathematics 2020-05-13 Dhruv Mubayi , Alexander Razborov

We study the set of $D$ such that a given irreducible hypersurface $C$ of degree $d$ has infinitely many points of degree $D$ over $\mathbb{Q}$. We give a new explicit proof that this set contains all (positive) multiples of the index of…

Number Theory · Mathematics 2025-10-21 Lea Beneish , Andrew Granville

Let f(x) = f(x_1, ..., x_n) = \sum_{|S| <= k} a_S \prod_{i \in S} x_i be an n-variate real multilinear polynomial of degree at most k, where S \subseteq [n] = {1, 2, ..., n}. For its "one-block decoupled" version, f~(y,z) = \sum_{|S| <= k}…

Discrete Mathematics · Computer Science 2015-12-08 Ryan O'Donnell , Yu Zhao

We provide several constructions for problems in Ramsey theory. First, we prove a superexponential lower bound for the classical 4-uniform Ramsey number $r_4(5,n)$, and the same for the iterated $(k-4)$-fold logarithm of the $k$-uniform…

Combinatorics · Mathematics 2018-02-21 Dhruv Mubayi , Andrew Suk

We give bounds for exponential sums over curves defined over Galois rings. We first define summation subsets as the images of lifts of points from affine opens of the reduced curve, and we give bounds for the degrees of their coordinate…

Number Theory · Mathematics 2007-05-23 Regis Blache

We show that for bounded domains in $\mathbb C^n$ with $\mathcal C^{1,1}$ smooth boundary, if there is a closed set $F$ of $2n-1$-Lebesgue measure $0$ such that $\partial \Omega \setminus F$ is $\mathcal C^{2}$-smooth and locally…

Complex Variables · Mathematics 2025-10-22 Quang Dieu Nguyen , Pascal J. Thomas

Pseudoline arrangements are fundamental objects in discrete and computational geometry, and different works have tackled the problem of improving the known bounds on the number of simple arrangements of $n$ pseudolines over the past…

Computational Geometry · Computer Science 2025-03-10 Justin Dallant

Let $Y$ be a smooth complex projective variety. We study the cohomology of smooth families of hypersurfaces $X\to B$ for $B\subset{\bf P}H^0(Y,O(d))$ a codimension $c$ subvariety. We give an asymptotically optimal bound on $c$ and $k$ for…

Algebraic Geometry · Mathematics 2007-05-23 Ania Otwinowska

In an innovative inverse-problem construction the measured, experimental energies $E_1$, $E_2$, ...$E_N$ of a quantum bound-state system are assumed fitted by an N-plet of zeros of a classical orthogonal polynomial $f_N(E)$. We reconstruct…

Quantum Physics · Physics 2010-11-23 Miloslav Znojil

The set of roots of any finite system of exponential sums in the space $\mathbb{C}^n$ is called an exponential variety. We define the intersection index of varieties of complementary dimensions, and the ring of classes of numerical…

Algebraic Geometry · Mathematics 2024-07-04 B. Kazarnovskii

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…

Combinatorics · Mathematics 2014-10-15 Jean Cardinal , Csaba D. Tóth , David R. Wood

We consider the set $$\mathcal{A} = \left\{10\cdot a + 11\cdot b \ | \gcd(a,b)=1, a\geq 1, b\geq 2a+1 \right\}.$$ We will prove that $\mathcal{A}$ is unbounded and that there exists a natural number $M\notin \mathcal{A}$ for which…

General Mathematics · Mathematics 2021-08-05 Antonio Linero-Bas , Daniel Nieves-Roldán

Let $r_k(s, e; t)$ denote the smallest $N$ such that any red/blue edge coloring of the complete $k$-uniform hypergraph on $N$ vertices contains either $e$ red edges among some $s$ vertices, or a blue clique of size $t$. Erd\H os and Hajnal…

Combinatorics · Mathematics 2025-07-15 Ruben Ascoli , Xiaoyu He , Hung-Hsun Hans Yu

Let $f_{1}, \ldots, f_{k}$ be polynomials defining an algebraic set in affine $n$-space over a finite field. Suppose $k>n$. We prove that there exists a system of polynomials $g_{1}, \ldots, g_{n}$, each being a linear combination with…

Algebraic Geometry · Mathematics 2022-04-26 Stefan Barańczuk

Motivated by a question of Rubel, we consider the problem of characterizing which noncompact hypersurfaces in $\RR^n$ can be regular level sets of a harmonic function modulo a $C^\infty$ diffeomorphism, as well as certain generalizations to…

Analysis of PDEs · Mathematics 2012-09-27 Alberto Enciso , Daniel Peralta-Salas

We bound an exponential sum that appears in the study of irregularities of distribution (the low-frequency Fourier energy of the sum of several Dirac measures) by geometric quantities: a special case is that for all $\left\{ x_1, \dots,…

Number Theory · Mathematics 2017-09-05 Stefan Steinerberger

For every $k>3$, we give a construction of planar point sets with many collinear $k$-tuples and no collinear $(k+1)$-tuples. We show that there are $n_0=n_0(k)$ and $c=c(k)$ such that if $n\geq n_0$, then there exists a set of $n$ points in…

Combinatorics · Mathematics 2013-09-25 József Solymosi , Miloš Stojaković

Let $F_h(n)$ denote the minimum cardinality of an additive {\em $h$-fold basis} of $\{1,2,\cdots,n\}$: a set $S$ such that any integer in $\{1,2,\cdots, n\}$ can be written as a sum of at most $h$ elements from $S$. While the trivial bounds…

Combinatorics · Mathematics 2025-11-12 Eric James Faust , Michael Tait