English
Related papers

Related papers: On some power sum problems of Montgomery and Turan

200 papers

For an even integer $k$, let $r_{2k}(n)$ be the number of representations of $n$ as a sum of $2k$ squares. The quantity $r_{2k}(n)$ is appoximated by the classical singular series $\rho_{2k}(n) \asymp n^{k-1}$. Deligne's bound on the…

Number Theory · Mathematics 2012-12-27 Jeremy Rouse

In this paper we investigate problems on almost everywhere convergence of subsequences of Riemann sums \md0 R_nf(x)=\frac{1}{n}\sum_{k=0}^{n-1}f\bigg(x+\frac{k}{n}\bigg),\quad x\in \ZT. \emd We establish a relevant connection between…

Classical Analysis and ODEs · Mathematics 2016-12-28 G. A. Karagulyan

We develop a theory of sesquilinear forms over finite fields, investigating their representations via polynomials and coefficient matrices, along with classification results for these forms. Through their connection to quadratic forms, we…

Number Theory · Mathematics 2025-07-01 Ruikai Chen

Refining an estimate of Croot, Dobbs, Friedlander, Hetzel and Pappalardi, we show that for all $k \geq 2$, the number of integers $1 \leq a \leq n$ such that the equation $a/n = 1/m_1 + \dotsc + 1/m_k$ has a solution in positive integers…

Number Theory · Mathematics 2022-10-17 Noah Lebowitz-Lockard , Victor Souza

Erdos conjectured that every odd number greater than one can be expressed as the sum of a squarefree number and a power of two. Subsequently, Odlyzko and McCranie provided numerical verification of this conjecture up to $10^7$ and $1.4\cdot…

Number Theory · Mathematics 2024-11-05 Christian Hercher

Given a positive integer $n$ and an $r$-uniform hypergraph (or $r$-graph for short) $F$, the Turan number $ex(n,F)$ of $F$ is the maximum number of edges in an $r$-graph on $n$ vertices that does not contain $F$ as a subgraph. The extension…

Combinatorics · Mathematics 2016-09-29 Tao Jiang , Yuejian Peng , Biao Wu

We prove that the upper bound for the van der Corput property of the set of perfect squares is O((log n)^{-1/3}), giving an answer to a problem considered by Ruzsa and Montgomery. We do it by constructing non-negative valued, normed…

Number Theory · Mathematics 2010-03-22 Sinisa Slijepcevic

Let $A$ be a subset of a finite field $F := \Z/q\Z$ for some prime $q$. If $|F|^\delta < |A| < |F|^{1-\delta}$ for some $\delta > 0$, then we prove the estimate $|A+A| + |A.A| \geq c(\delta) |A|^{1+\eps}$ for some $\eps = \eps(\delta) > 0$.…

Combinatorics · Mathematics 2007-05-23 Jean Bourgain , Nets Katz , Terence Tao

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

Number Theory · Mathematics 2019-06-03 Ali Mohammadi

What is the maximum number of $r$-term sums admitting rational values in $n$-element sets of irrational numbers? We determine the maximum when $r<4$ or $r\geq n/2$ and also in case when we drop the condition on the number of summands. It…

Combinatorics · Mathematics 2025-09-25 Benjamin Móricz , Zoltán Lóránt Nagy

Let $\mathcal{F}$ be a family of $r$-graphs. The Tur\'an number $ex_r(n;\mathcal{F})$ is defined to be the maximum number of edges in an $r$-graph of order $n$ that is $\mathcal{F}$-free. The famous Erd\H{o}s Matching Conjecture shows that…

Combinatorics · Mathematics 2018-12-11 Jian Wang , Weihua Yang

In this paper, we prove $\text{ex}(n, C_{2k})\le (16\sqrt{5}\sqrt{k\log k} + o(1))\cdot n^{1+1/k}$. We improved on Bukh--Jiang's method used in their 2017 publication, thereby reducing the best known upper bound by a factor of $\sqrt{5\log…

Combinatorics · Mathematics 2020-09-11 Zhiyang He

In this paper, we derive new properties of the Mertens function and discuss a likely upper bound of the absolute value of the Mertens function $\sqrt{\log{x!}}>|M(x)|$ when $x>1$. Using this likely bound we show that we have a sufficient…

General Mathematics · Mathematics 2021-04-19 Darrell Cox , Sourangshu Ghosh , Eldar Sultanow

Generalizing the classical result of Bohr, we show that if an n-variable power series converges in an n-circular bounded complete domain D and its sum has modulus less than 1, then the sum of the maximum of the moduli of the terms is less…

Complex Variables · Mathematics 2007-05-23 Lev Aizenberg

Writing for a general mathematical audience, we provide elementary upper and lower bounds on the growth (as a function of N) of the sum \sum_{n=1}^N (-1)^{\floor{n x}} for various fixed x. For example, if x is a quadratic irrational, then…

Number Theory · Mathematics 2007-05-23 Kevin O'Bryant , Bruce Reznick , Monika Serbinowska

A neat 1972 result of Pohl asserts that [3n/2]-2 comparisons are sufficient, and also necessary in the worst case, for finding both the minimum and the maximum of an n-element totally ordered set. The set is accessed via an oracle for…

Data Structures and Algorithms · Computer Science 2015-05-18 Michael Hoffmann , Jiří Matoušek , Yoshio Okamoto , Philipp Zumstein

Let $K\subset \mathbb{C}$ be a convex compact set, and let $\Pi_n(K)$ be the class of polynomials of exact degree $n$, all of whose zeros lie in $K$. The Tur\'an type inverse Markov factor is defined by $M_n(K)=\inf_{P\in \Pi_n(K)}…

Classical Analysis and ODEs · Mathematics 2025-05-20 Mikhail A. Komarov

We consider direct and inverse Jacobi transforms with measures $d\mu(t)=2^{2\rho}(\sinh t)^{2\alpha+1}(\cosh t)^{2\beta+1}\,dt$ and $d\sigma(\lambda)=(2\pi)^{-1}\bigl|\frac{2^{\rho-i\lambda}\Gamma(\alpha+1)\Gamma(i\lambda)}…

Classical Analysis and ODEs · Mathematics 2022-10-25 D. V. Gorbachev , V. I. Ivanov , S. Yu. Tikhonov

Given Mikhlin-H\"ormander multipliers $m_i$, $i=1,..., N$, with uniform estimates we prove an optimal $\sqrt{\log(N+1)}$ bound in $L^p$ for the maximal function $\sup_i|\cF^{-1}[m_i\hat f]|$ and related bounds for maximal functions…

Classical Analysis and ODEs · Mathematics 2010-03-15 Loukas Grafakos , Petr Honzik , Andreas Seeger

Let $f$ be a complex valued function on a finite field $F$ such that $f(0) = 0$, $f(1) = 1$, and $|f(x)| = 1$ for $x \neq 0$. Cohn asked if it follows that $f$ is a nontrivial multiplicative character provided that $\sum_{x \in F} f(x)…

Number Theory · Mathematics 2007-05-23 Par Kurlberg