中文
相关论文

相关论文: Slightly improved sum-product estimates in fields …

200 篇论文

We give a simple matrix-based proof of congruence equations modulo a prime $p$ involving sums of binomial coefficients appearing in Pascal's triangle. These equations can be used to construct some groups of exponent $p^n$. These groups, as…

数论 · 数学 2024-09-04 Fernando Szechtman

For a prime number $p$ and a sequence of integers $a_0,\dots,a_k\in \{0,1,\dots,p\}$, let $s(a_0,\dots,a_k)$ be the minimum number of $(k+1)$-tuples $(x_0,\dots,x_k)\in A_0\times\dots\times A_k$ with $x_0=x_1+\dots + x_k$, over subsets…

组合数学 · 数学 2019-03-13 Ostap Chervak , Oleg Pikhurko , Katherine Staden

Let $p\geq 3$ be a prime and $n\geq 1$ be an integer. Let $K\subseteq {\mathbb{F}_p}$ denote a fixed subset with $0\in K$. Let $A\subseteq ({\mathbb{F}_p})^n$ be an arbitrary subset such that $$\{…

数论 · 数学 2018-12-06 Gábor Hegedűs

We extend a result due to Bourgain on the uniform distribution of residues by proving that subsets of the type $f(I)\cdot H$ is equidistributed (as $p$ tends to infinity) where $f$ is a polynomial, $I$ is an interval of $\Fp$ and $H$ is an…

数论 · 数学 2012-07-12 Norbert Hegyvári , Francois Hennecart

Let $R$ be a finite valuation ring of order $q^r.$ Using a point-plane incidence estimate in $R^3$, we obtain sum-product type estimates for subsets of $R$. In particular, we prove that for $A\subset R$, $$|AA+A|\gg \min\left\{q^{r},…

组合数学 · 数学 2017-01-30 Esen Aksoy Yazici

Based on new explicit estimates for the prime counting function, we improve the currently known estimates for the particular sequence $C_n = np_n - \sum_{k \leq n}p_k$, $n \geq 1$, involving the prime numbers.

数论 · 数学 2017-06-14 Christian Axler

We obtain a new estimate for Kloosterman sum with primes $p\leqslant X$ to composite modulo $q$, that is, for the exponential sum of the type \[ \sum\limits_{p\leqslant X,\;p\,\nmid q}\exp{\biggl(\frac{2\pi…

数论 · 数学 2019-11-25 M. A. Korolev

Let $p>3$ be a prime, and let $(\frac{\cdot}p)$ be the Legendre symbol. Let $b\in\mathbb Z$ and $\varepsilon\in\{\pm 1\}$. We mainly prove that $$\left|\left\{N_p(a,b):\ 1<a<p\ \text{and}\ \left(\frac…

数论 · 数学 2022-10-07 Qing-Hu Hou , Hao Pan , Zhi-Wei Sun

In this paper, we prove that the bound \[ \max \{ |8A-7A|,|5f(A)-4f(A)| \} \gg |A|^{\frac{3}{2} + \frac{1}{54}-o(1)} \] holds for all $A \subset \mathbb R$, and for all convex functions $f$ which satisfy an additional technical condition.…

组合数学 · 数学 2023-04-04 Oliver Roche-Newton

Given $d \in \mathbb{N}$, we establish sum-product estimates for finite, non-empty subsets of $\mathbb{R}^d$. This is equivalent to a sum-product result for sets of diagonal matrices. In particular, let $A$ be a finite, non-empty set of $d…

组合数学 · 数学 2021-01-27 Akshat Mudgal

In 2020, Roger Baker \cite{Bak} proved a result on the exceptional set of moduli in the prime number theorem for arithmetic progressions of the following kind. Let $\mathcal{S}$ be a set of pairwise coprime moduli $q\le x^{9/40}$. Then the…

数论 · 数学 2022-06-24 Stephan Baier , Sudhir Pujahari

Let $\|\cdot\|$ denote the minimum distance to an integer. For $0<\gamma< 1$, $\theta>0$ and $(\alpha, \beta) \in \mathbb{R} \setminus \{0\} \times \mathbb{R}$ we study when \begin{equation*} \|\alpha p^{\gamma}+\beta \|<p^{-\theta},…

数论 · 数学 2017-12-04 Alexander Dunn

Let $p$ be a sufficiently large prime number, $n$ be a positive odd integer with $n|\,p-1$ and $n>p^\varepsilon $, where $\varepsilon$ is a sufficiently small constant. Let $k(p,\,n)$ denote the least positive integer $k$ such that for…

数论 · 数学 2019-09-04 Ke Gong , Chaohua Jia

Let $\lambda(m)$ be the $m$th coefficient of a modular form $f(z)=\sum_{m\geq 1} \lambda(m)q^m$ of weight $k\geq 4$, let $p^n$ be a prime power, and let $\varepsilon>0$ be a small number. An approximate of the Atkin-Serre conjecture on the…

综合数学 · 数学 2021-09-03 N. A. Carella

We prove that the sumset or the productset of any finite set of real numbers, $A,$ is at least $|A|^{4/3-\epsilon},$ improving earlier bounds. Our main tool is a new upper bound on the multiplicative energy, $E(A,A).$

组合数学 · 数学 2008-06-23 Jozsef Solymosi

Let P be a set of points and $L$ a set of lines in (F_p)^2, with |P|,|L|\leq N and N<p. We show that P and L generate no more than C N^(3/2 - 1/806 + o(1)) incidences for some absolute constant C. This improves by an order of magnitude on…

组合数学 · 数学 2011-11-03 Timothy G. F. Jones

We prove that, if $m,n\geqslant 1$ and $a_1,\ldots,a_m$ are nonnegative integers, then \begin{align*} \frac{[a_1+\cdots+a_m+1]!}{[a_1]!\ldots[a_m]!}\sum^{n-1}_{h=0}q^h\prod_{i=1}^m{h\brack a_i} \equiv 0\pmod{[n]}, \end{align*} where…

数论 · 数学 2015-04-22 Victor J. W. Guo , Ji-Cai Liu

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

组合数学 · 数学 2010-09-14 Karsten Chipeniuk

For any polynomial $P(x)\in\mathbb{Z}[x],$ we study arithmetic dynamical systems generated by $\displaystyle{F_P(n)=\prod_{k\le n}}P(n)(\text{mod}\ p),$ $n\ge 1.$ We apply this to improve the lower bound on the number of distinct quadratic…

数论 · 数学 2018-10-16 Oleksiy Klurman , Marc Munsch

In this paper, we obtain a lower bound for the number of primes $p\leq x$ such that $p-1$ is a sum of two squares and $p+2$ has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and…

数论 · 数学 2025-02-28 Kunjakanan Nath , Likun Xie