中文
相关论文

相关论文: On sets of large exponential sums

200 篇论文

We show that a certain two-dimensional family of Weyl sums of length $P$ takes values as large as $P^{3/4 + o(1)}$ on almost all linear slices of the unit torus, contradicting a widely held expectation that Weyl sums should exhibit…

数论 · 数学 2020-12-17 Julia Brandes , Igor E. Shparlinski

The notions of special and extraspecial pairs of roots were introduced by Carter for calculating structure constants, [Ca72]. Let $\{r, s\}$ be a special pair of roots for which the structure constant $N(r,s)$ is sought, and let $\{r_1,…

表示论 · 数学 2025-10-21 Rafael Stekolshchik

For any sufficiently large $\ell$, suppose that $\ell$ can be expressed as $$ \ell=p_1^4+p_2^4+p_3^4+ \cdots +p_8^4,$$ where $p_1, p_2,p_3,\cdots, p_8$ are primes.For such $\ell$, in this paper we will use circle method and sieves to prove…

数论 · 数学 2026-01-26 Yang Qu , Rong Ma

In this paper we construct explicit sampling sets and present reconstruction algorithms for Fourier signals on finite vector spaces $G$, with $|G|=p^r$ for a suitable prime $p$. The two sets have sizes of order $O(pt^2r^2)$ and…

数值分析 · 数学 2017-07-11 Lucia Morotti

A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…

The paper surveys recent progress in understanding geometric, topological and combinatorial properties of large simplicial complexes, focusing mainly on ampleness, connectivity and universality. In the first part of the paper we concentrate…

组合数学 · 数学 2023-01-19 Michael Farber

We introduce a pregeometry that provides a metric and dimensionality over a Borel set (Wheeler's "bucket of dust") without assuming probability amplitudes for adjacency. Rather, a non-trivial metric is produced over a Borel set X per a…

广义相对论与量子宇宙学 · 物理学 2007-05-23 W. M. Stuckey

We investigate exponential sums over singular binary quartic forms, proving an explicit formula for the finite field Fourier transform of this set. Our formula shares much in common with analogous formulas proved previously for other vector…

Given an integer $d \ge 2$, what is the least $r$ so that there is a set of binary quadratic forms $\{f_1,\dots,f_r\}$ for which $\{f_j^d\}$ is non-trivially linearly dependent? We show that if $r \le 4$, then $d \le 5$, and for $d \ge 4$,…

数论 · 数学 2020-01-08 Bruce Reznick

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

数论 · 数学 2026-05-26 Artyom Radomskii

A book $B_n$ is a graph which consists of $n$ triangles sharing a common edge. In this paper, we study Ramsey numbers of quadrilateral versus books. Previous results give the exact value of $r(C_4,B_n)$ for $1\le n\le 14$. We aim to show…

组合数学 · 数学 2021-08-26 Tianyu Li , Qizhong Lin , Xing Peng

We characterize the structure of maximum-size sum-free subsets of a random subset of an Abelian group $G$. In particular, we determine the threshold $p_c \approx \sqrt{\log n / n}$ above which, with high probability as $|G| \to \infty$,…

组合数学 · 数学 2012-11-19 József Balogh , Robert Morris , Wojciech Samotij

Consider an irreducible finite Coxeter system. We show that for any nonnegative integer n the sum of the nth powers of the Coxeter exponents can be written uniformly as a polynomial in four parameters: h (the Coxeter number), r (the rank),…

组合数学 · 数学 2012-08-13 John M. Burns , Ruedi Suter

Lagrange's Four Squares Theorem states that any positive integer can be expressed as the sum of four integer squares. We investigate the analogous question over Quaternion rings, focusing on squares of elements of Quaternion rings with…

数论 · 数学 2017-04-10 Anna Cooke , Spencer Hamblen , Sam Whitfield

We extend two well-known results in additive number theory, S\'ark\"ozy's theorem on square differences in dense sets and a theorem of Green on long arithmetic progressions in sumsets, to subsets of random sets of asymptotic density 0. Our…

数论 · 数学 2007-05-23 Mariah Hamel , Izabella Laba

We prove results on the structure of a subset of the circle group having positive inner Haar measure and doubling constant close to the minimum. These results go toward a continuous analogue in the circle of Freiman's $3k-4$ theorem from…

组合数学 · 数学 2018-07-11 Pablo Candela , Anne de Roton

We answer two questions of Kra, Moreira, Richter and Robertson regarding the existence of infinite sumsets of the form $B + C$ in dense and sparse sets of integers and the relation of sumsets to sets of recurrence. We then further…

动力系统 · 数学 2025-10-16 Luke Hetzel

We study the number of irreducible polynomials over $\mathbf{F}_{q}$ with some coefficients prescribed. Using the technique developed by Bourgain, we show that there is an irreducible polynomial of degree $n$ with $r$ coefficients…

数论 · 数学 2016-01-27 Junsoo Ha

We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…

组合数学 · 数学 2017-12-12 Lutz Warnke

We show that there are infinitely many square numbers , which are constrocted by putting two square numbers together , that non of them are divisible by $10$ . We also investigate the interesting properties of some square numbers.

综合数学 · 数学 2019-02-28 Farid Jokar