English
Related papers

Related papers: Sum-product estimates in finite fields

200 papers

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…

Number Theory · Mathematics 2015-04-22 Victor J. W. Guo , Ji-Cai Liu

We study the Vapnik-Chervonenkis (VC) dimension of the set of quadratic residues (i.e. squares) in finite fields, $\mathbb F_q$, when considered as a subset of the additive group. We conjecture that as $q \to \infty$, the squares have the…

Combinatorics · Mathematics 2024-08-02 Brian McDonald , Anurag Sahay , Emmett L. Wyman

Sums of Kloosterman sums have deep connections with the theory of modular forms, and their estimation has many important consequences. Kuznetsov used his famous trace formula and got a power-saving estimate with respect to $x$ with implied…

Number Theory · Mathematics 2025-04-15 Qihang Sun

In this paper we study sums and products in a field. Let $F$ be a field with ${\rm ch}(F)\not=2$, where ${\rm ch}(F)$ is the characteristic of $F$. For any integer $k\ge4$, we show that each $x\in F$ can be written as $a_1+\ldots+a_k$ with…

Number Theory · Mathematics 2018-07-04 Guang-Liang Zhou , Zhi-Wei Sun

Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…

Symbolic Computation · Computer Science 2022-10-26 Robert Dougherty-Bliss

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

Combinatorics · Mathematics 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

Let $l$ be a finite field of cardinality $q$ and let $n$ be in $\mathbb{Z}_{\geq 1}$. Let $f_1,\ldots,f_n \in l[x_1,\ldots,x_n]$ not all constant and consider the evaluation map $f=(f_1,\ldots,f_n) \colon l^n \to l^n$. Set…

Number Theory · Mathematics 2015-09-08 Michiel Kosters

In this paper, we use methods from spectral graph theory to obtain some results on the sum-product problem over finite valuation rings $\mathcal{R}$ of order $q^r$ which generalize recent results given by Hegyv\'ari and Hennecart (2013).…

Number Theory · Mathematics 2016-11-22 Le Quang Ham , Thang Pham , Le Anh Vinh

We design and analyze an algorithm for computing solutions with coefficients in a finite field $\mathbb{F}_q$ of underdetermined systems defined over $\mathbb{F}_q$. The algorithm is based on reductions to zero-dimensional searches. The…

Algebraic Geometry · Mathematics 2022-07-22 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

In this paper, with the help of the theory of matrices and finite fields we generalize Zolotarev's theorem to an arbitrary finite dimensional vector space over $\mathbb{F}_q$, where $\mathbb{F}_q$ denotes the finite field with $q$ elements.

Number Theory · Mathematics 2021-01-28 Hai-Liang Wu , Li-Yuan Wang

We prove that for all $q>61$, every non-zero element in the finite field $\mathbb{F}_{q}$ can be written as a linear combination of two primitive roots of $\mathbb{F}_{q}$. This resolves a conjecture posed by Cohen and Mullen.

Number Theory · Mathematics 2014-03-19 Stephen D. Cohen , Tomás Oliveira e Silva , Tim Trudgian

We show that if $E \subset \mathbb{F}_q^d$, the $d$-dimensional vector space over the finite field with $q$ elements, and $|E| \geq \rho q^d$, where $ q^{-\frac{1}{2}}\ll \rho \leq 1$, then $E$ contains an isometric copy of at least $c…

Combinatorics · Mathematics 2010-09-22 David Covert , Derrick Hart , Alex Iosevich , Steven Senger , Ignacio Uriarte-Tuero

In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…

Number Theory · Mathematics 2016-06-07 Mohamed El Bachraoui

Erd\H{o}s, S\'ark\"ozy, and S\'os studied the asymptotics of the maximum size of a subset of $\{1,2,\ldots, N\}$ such that it does not contain $k$ distinct elements whose product is a perfect square. More generally, Verstra\"ete proposed a…

Combinatorics · Mathematics 2026-01-26 Hyunwoo Lee , Chi Hoi Yip , Semin Yoo

In this paper we study incidences for hyperbolas in $\mathbf{F}_p$ and show how linear sum--product methods work for such curves. As an application we give a purely combinatorial proof of a nontrivial upper bound for bilinear forms of…

Number Theory · Mathematics 2019-05-02 Ilya D. Shkredov

For each odd prime power q, and each integer k, we determine the sum of the k-th powers of all elements x in F_q for which both x and x+1 are squares in F_q^*. We also solve the analogous problem when one or both of x and x+1 is a…

Number Theory · Mathematics 2023-09-27 Zhiguo Ding , Michael E. Zieve

Let $\mathbb{F}_p$ be a prime field of order $p,$ and $A$ be a set in $\mathbb{F}_p$ with $|A| \leq p^{1/2}.$ In this note, we show that \[\max\{|A+A|, |f(A, A)|\}\gtrsim |A|^{\frac{6}{5}+\frac{4}{305}},\] where $f(x, y)$ is a…

Combinatorics · Mathematics 2019-04-17 Mozhgan Mirzaei

In this note we report about a method to deal with finite energy sum rules. With a reasonable knowledge of the main resonances of the spectrum, the method guarantees that we can find a nice duality matching between the low energy hadronic…

High Energy Physics - Phenomenology · Physics 2015-09-11 J. Bordes , J. A. Peñarrocha , Michael J. Baker

In this paper we find a new lower bound on the number of imaginary quadratic extensions of the function field $\mathbb{F}_{q}(x)$ whose class groups have elements of a fixed odd order. More precisely, for $q$, a power of an odd prime, and…

Number Theory · Mathematics 2011-02-21 Pradipto Banerjee , Srinivas Kotyada

The classification of maximal function fields over a finite field is a difficult open problem, and even determining isomorphism classes among known function fields is challenging in general. We study a particular family of maximal function…

Number Theory · Mathematics 2024-12-09 Jonathan Niemann
‹ Prev 1 8 9 10 Next ›