English
Related papers

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

200 papers

An old question of Erdos asks if there exists, for each number N, a finite set S of integers greater than N and residue classes r(n) mod n for n in S whose union is all the integers. We prove that if $\sum_{n\in S} 1/n$ is bounded for such…

Number Theory · Mathematics 2007-05-23 Michael Filaseta , Kevin Ford , Sergei Konyagin , Carl Pomerance , Gang Yu

We develop novel techniques which allow us to prove a diverse range of results relating to subset sums and complete sequences of positive integers, including solutions to several longstanding open problems. These include: solutions to the…

Combinatorics · Mathematics 2021-05-03 David Conlon , Jacob Fox , Huy Tuan Pham

Let $f(m)$ be the largest integer such that for every set $A = \{a_1 < \cdots < a_m\}$ of $m$ positive integers and every open interval $I$ of length $2a_m$, there exist at least $f(m)$ disjoint pairs $(a, b)$ with $a \in A$ dividing $b \in…

Combinatorics · Mathematics 2026-03-31 Wouter van Doorn , Yanyang Li , Quanyu Tang

Given an odd integer polynomial f(x) of a degree k >=3, we construct a non-negative valued, normed trigonometric polynomial with the spectrum in the set of integer values of f(x) not greater than n, and a small free coefficient…

Number Theory · Mathematics 2013-01-17 Marina Nincevic , Sinisa Slijepcevic

For $U\in O(N)$ we have $||U||_1\leq N\sqrt{N}$, with equality if and only if $U=H/\sqrt{N}$, with $H$ Hadamard matrix. Motivated by this remark, we discuss in this paper the algebraic and analytic aspects of the computation of the maximum…

Functional Analysis · Mathematics 2019-02-27 Teodor Banica , Benoit Collins , Jean-Marc Schlenker

We refine a remark of Steinerberger (2024), proving that for $\alpha \in \mathbb{R}$, there exists integers $1 \leq b_{1}, \ldots, b_{k} \leq n$ such that \[ \left\| \sum_{j=1}^k \sqrt{b_j} - \alpha \right\| = O(n^{-\gamma_k}), \] where…

Number Theory · Mathematics 2025-03-21 Siddharth Iyer

Let $q$ be a power of a prime and $\mathbb{F}_q$ the finite field consisting of $q$ elements. We prove explicit upper bounds on the number of incidences between lines and Cartesian products in $\mathbb{F}_q^2$. We also use our results on…

Combinatorics · Mathematics 2018-08-17 Ali Mohammadi

Many exponential sums over finite fields, including Gauss sums and Kloosterman sums, arise as the Fourier transform with respect to a character of the trace function of an $\ell$-adic sheaf on a commutative algebraic group. We study the…

Algebraic Geometry · Mathematics 2019-11-28 Javier Fresán

In this paper we further study the relationship between convexity and additive growth, building on the work of Schoen and Shkredov (\cite{SS}) to get some improvements to earlier results of Elekes, Nathanson and Ruzsa (\cite{ENR}). In…

Combinatorics · Mathematics 2011-11-23 Liangpan Li , Oliver Roche-Newton

We study quantitative criteria for evaluating the strength of valid inequalities for Gomory and Johnson's finite and infinite group models and we describe the valid inequalities that are optimal for these criteria. We justify and focus on…

Optimization and Control · Mathematics 2018-06-12 Amitabh Basu , Michele Conforti , Marco Di Summa , Giacomo Zambelli

Consider a linear program of the form $\max\;c^{\top}x:Ax\leq b$, where $A$ is an $m\times n$ integral matrix. In 1986 Cook, Gerards, Schrijver, and Tardos proved that, given an optimal solution $x^{*}$, if an optimal integral solution…

Optimization and Control · Mathematics 2021-11-03 Marcel Celaya , Stefan Kuhlmann , Joseph Paat , Robert Weismantel

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Number Theory · Mathematics 2026-02-04 Christopher Atherfold

Let $N$ denote the number of solutions to the generalized Markoff-Hurwitz-type equation \[(a_1X_1^m+\cdots + a_nX_n^m+a)^k=bX_1\cdots X_n \] over the finite field $\mathbb{F}_q$, where $m,k$ are positive integers, and $a,b,a_i\in…

Let Mf denote the strong maximal function of f on R^n, that is the maximal average of f with respect to n-dimensional rectangles with sides parallel to the coordinate axes. For any dimension n>1 we prove the natural endpoint Fefferman-Stein…

Classical Analysis and ODEs · Mathematics 2015-09-01 Teresa Luque , Ioannis Parissis

Given graphs H_1,...,H_k, we study the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove a general upper bound of twice the sum of the numbers m_i, where m_i is one less than the order of…

Combinatorics · Mathematics 2007-05-23 Zoltan Furedi , Dhruv Mubayi , Douglas B. West

Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $\theta > 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$,…

Number Theory · Mathematics 2017-07-31 Angel Kumchev , Huafeng Liu

As a variant of the famous Tur\'an problem, we study $\mathrm{rex}(n,F)$, the maximum number of edges that an $n$-vertex regular graph can have without containing a copy of $F$. We determine $\mathrm{rex}(n,K_{r+1})$ for all pairs of…

Combinatorics · Mathematics 2019-12-24 Dániel Gerbner , Balázs Patkós , Zsolt Tuza , Máté Vizer

We give $L^1$-norm estimates for exponential sums of a finite sets $A$ consisting of integers or lattice points. Under the assumption that $A$ possesses sufficient multidimensional structure, our estimates are stronger than those of…

Number Theory · Mathematics 2020-06-19 Brandon Hanson

We find an upper bound for the sum $\sum_{x<n\leq 2x}\textbf{1}_{\mathbb{P}}(n+h_{i_{1}})\cdots\textbf{1}_{\mathbb{P}}(n+h_{i_{m+1}})w_{n}$, where $(h_{i_{1}},...,h_{i_{m+1}})$ is any $(m+1)$-tuple of elements in the admissible set…

Number Theory · Mathematics 2018-04-18 Daniele Mastrostefano

Cameron and Erd\H{o}s raised the question of how many maximal sum-free sets there are in $\{1, \dots , n\}$, giving a lower bound of $2^{\lfloor n/4 \rfloor }$. In this paper we prove that there are in fact at most $2^{(1/4+o(1))n}$ maximal…

Combinatorics · Mathematics 2014-09-22 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown