中文
相关论文

相关论文: Further bounds in the polynomial Szemer\'{e}di the…

200 篇论文

Using recent developments on the theory of locally decodable codes, we prove that the critical size for Szemer\'edi's theorem with random differences is bounded from above by $N^{1-\frac{2}{k} + o(1)}$ for length-$k$ progressions. This…

组合数学 · 数学 2024-11-06 Jop Briët , Davi Castro-Silva

We use spectral theory and algebraic geometry to establish a higher-degree analogue of a Szemer\'edi--Trotter-type theorem over finite fields, with an application to polynomial expansion.

组合数学 · 数学 2026-02-25 Nuno Arala , Sam Chow

We obtain new upper bounds on the number of distinct roots of lacunary polynomials over finite fields. Our focus will be on polynomials for which there is a large gap between consecutive exponents in the monomial expansion.

数论 · 数学 2021-04-08 Jozsef Solymosi , Ethan P. White , Chi Hoi Yip

We prove new lower bounds on the maximum size of subsets $A\subseteq \{1,\dots,N\}$ or $A\subseteq \mathbb{F}_p^n$ not containing three-term arithmetic progressions. In the setting of $\{1,\dots,N\}$, this is the first improvement upon a…

数论 · 数学 2024-06-19 Christian Elsholtz , Zach Hunter , Laura Proske , Lisa Sauermann

We establish upper bounds on the size of the largest subset of $\{1,2,\dots,N\}$ lacking nonzero differences of the form $h(p_1,\dots,p_{\ell})$, where $h\in \mathbb{Z}[x_1,\dots,x_{\ell}]$ is a fixed polynomial satisfying appropriate…

数论 · 数学 2024-05-03 John R. Doyle , Alex Rice

We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…

动力系统 · 数学 2012-02-23 Nikos Frantzikinakis

We study the mixing properties of progressions $(x,xg,xg^2)$, $(x,xg,xg^2,xg^3)$ of length three and four in a model class of finite non-abelian groups, namely the special linear groups $SL_d(F)$ over a finite field $F$, with $d$ bounded.…

组合数学 · 数学 2013-06-03 Terence Tao

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is a power of a prime. For a set $A \subset \mathbb{F}_q$, under certain structural restrictions, we prove a new explicit lower bound on the size of the product set $A(A + 1)$.…

数论 · 数学 2018-07-31 Ali Mohammadi

We establish new upper bounds about symmetric bilinear complexity in any extension of finite fields. Note that these bounds are not asymptotical but uniform. Moreover we give examples of Shimura curves that do not descend over their field…

信息论 · 计算机科学 2017-06-13 Stéphane Ballet , Julia Pieltant , Matthieu Rambaud , Jeroen Sijsling

We extend the best known bound on the largest subset of {1,2,...,N} with no square differences to the largest possible class of quadratic polynomials.

经典分析与常微分方程 · 数学 2012-03-29 Mariah Hamel , Neil Lyall , Alex Rice

We consider multivariable polynomials over a fixed number field, linear in some of the variables. For a system of such polynomials satisfying certain technical conditions we prove the existence of search bounds for simultaneous zeros with…

数论 · 数学 2022-11-14 Maxwell Forst , Lenny Fukshansky

Given finite sets $X_1,\dotsc,X_m$ in $\mathbb{R}^d$ (with $d$ fixed), we prove that there are respective subsets $Y_1,\dotsc,Y_m$ with $|Y_i|\ge \frac{1}{\operatorname{poly}(m)}|X_i|$ such that, for $y_1\in Y_1,\dotsc,y_m\in Y_m$, the…

组合数学 · 数学 2023-09-20 Boris Bukh , Alexey Vasileuski

Let $P_1,\dots,P_m\in\mathbb{Z}[y]$ be polynomials with distinct degrees, each having zero constant term. We show that any subset $A$ of $\{1,\dots,N\}$ with no nontrivial progressions of the form $x,x+P_1(y),\dots,x+P_m(y)$ has size…

数论 · 数学 2021-01-06 Sarah Peluse

A nonlinear version of Roth's theorem states that dense sets of integers contain configurations of the form $x$, $x+d$, $x+d^2$. We obtain a multidimensional version of this result, which can be regarded as a first step towards…

数论 · 数学 2024-07-12 Sarah Peluse , Sean Prendiville , Xuancheng Shao

We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic…

数论 · 数学 2020-02-19 Igor E. Shparlinski , Jose Felipe Voloch

For a large prime $p$, and a polynomial $f$ over a finite field $F_p$ of $p$ elements, we obtain a lower bound on the size of the multiplicative subgroup of $F_p^*$ containing $H\ge 1$ consecutive values $f(x)$, $x = u+1, \ldots, u+H$,…

数论 · 数学 2014-01-28 Igor E. Shparlinski

Let F be a fixed finite field of characteristic at least 5. Let G = F^n be the n-dimensional vector space over F, and write N := |G|. We show that if A is a subset of G with size at least c_F N(log N)^{-c}, for some absolute constant c > 0…

组合数学 · 数学 2014-02-26 Ben Green , Terence Tao

Under mild conditions on $n,p$, we give a lower bound on the number of $n$-variable balanced symmetric polynomials over finite fields $GF(p)$, where $p$ is a prime number. The existence of nonlinear balanced symmetric polynomials is an…

组合数学 · 数学 2007-05-23 Thomas W. Cusick , Yuan Li , Pantelimon Stanica

Motivated by the effective bounds of ordinary differential equations, we prove an effective version of uniform bounding for partial differential fields with commuting derivations. More precisely, we provide an upper bound for the size of…

代数几何 · 数学 2015-10-28 James Freitag , Omar Leon Sanchez

Let $P(t),Q(t)\in \mathbb{Q}(t)$ be rational functions such that $P(t),Q(t)$ and the constant function $1$ are linearly independent over $\mathbb{Q}$, we prove an asymptotic formula for the number of the corner configurations…

数论 · 数学 2025-01-10 Zi Li Lim