English
Related papers

Related papers: A robust version of Freiman's $3k-4$ Theorem and a…

200 papers

Let $k_i\in \mathbb N$ $(i\ge 1)$ satisfy $2\le k_1\le k_2\le \ldots $. Freiman's theorem shows that when $j\in \mathbb N$, there exists $s=s(j)\in \mathbb N$ such that all large integers $n$ are represented in the form…

Number Theory · Mathematics 2024-02-21 Joerg Bruedern , Trevor D. Wooley

Two-stage robust optimization is a fundamental paradigm for modeling and solving optimization problems with uncertain parameters. A now classical method within this paradigm is finite adaptability, introduced by Bertsimas and Caramanis…

Optimization and Control · Mathematics 2025-03-13 Safia Kedad-Sidhoum , Anton Medvedev , Frédéric Meunier

We obtain a strong invariance principle for nonconventional sums and applying this result we derive for them a version of the law of iterated logarithm, as well as an almost sure central limit theorem. Among motivations for such results are…

Probability · Mathematics 2012-09-11 Yuri Kifer

We observe that the classical Faulhaber's theorem on sums of odd powers also holds for an arbitrary arithmetic progression, namely, the odd power sums of any arithmetic progression $a+b, a+2b, ..., a+nb$ is a polynomial in $na+n(n+1)b/2$.…

Combinatorics · Mathematics 2008-07-28 William Y. C. Chen , Amy M. Fu , Iris F. Zhang

We prove Fermat's Last Theorem over ${\mathbb Q}(\sqrt{5})$ and ${\mathbb Q}(\sqrt{17})$ for prime exponents $p \ge 5$ in certain congruence classes modulo $48$ by using a combination of the modular method and Brauer-Manin obstructions…

Number Theory · Mathematics 2022-03-16 Imin Chen , Aisosa Efemwonkieke , David Sun

In 1935, Erd\H{o}s proved that the sums $f_k=\sum_n 1/(n\log n)$, over integers $n$ with exactly $k$ prime factors, are bounded by an absolute constant, and in 1993 Zhang proved that $f_k$ is maximized by the prime sum $f_1=\sum_p 1/(p\log…

Number Theory · Mathematics 2024-12-02 Ofir Gorodetsky , Jared Duker Lichtman , Mo Dick Wong

Write $f_k({\boldsymbol \alpha};X)=\sum_{x\le X}e(\alpha_1x+\ldots +\alpha_kx^k)$ $(k\ge 3)$. We show that there is a set ${\mathfrak B}\subseteq [0,1)^{k-2}$ of full measure with the property that whenever $(\alpha_2,\ldots…

Number Theory · Mathematics 2023-09-29 Trevor D. Wooley

We prove new results on additive properties of finite sets $A$ with small multiplicative doubling $|AA|\leq M|A|$ in the category of real/complex sets as well as multiplicative subgroups in the prime residue field. The improvements are…

Combinatorics · Mathematics 2017-12-04 Brendan Murphy , Misha Rudnev , Ilya D. Shkredov , Yurii N. Shteinikov

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv

The $_{3}F_{2}$ hypergeometric function plays a very significant role in the theory of hypergeometric and generalized hypergeometric series. Despite that $_{3}F_{2}$ hypergeometric function has several applications in mathematics, also it…

Classical Analysis and ODEs · Mathematics 2017-05-24 Medhat A. Rakha , Mohammed M. Awad , Asmaa O. Mohammed

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The Kemperman Structure Theorem characterizes all subsets $A,\,B\subseteq G$ satisfying…

Number Theory · Mathematics 2018-04-20 David J. Grynkiewicz

In 1995, Brouwer proved that the toughness of a connected $k$-regular graph $G$ is at least $k/\lambda-2$, where $\lambda$ is the maximum absolute value of the non-trivial eigenvalues of $G$. Brouwer conjectured that one can improve this…

Combinatorics · Mathematics 2013-12-10 Sebastian M. Cioabă , Wiseley Wong

We give a simple proof of a well-known theorem of G\'al and of the recent related results of Aistleitner, Berkes and Seip [1] regarding the size of GCD sums. In fact, our method obtains the asymptotically sharp constant in G\'al's theorem,…

Number Theory · Mathematics 2014-08-12 Mark Lewko , Maksym Radziwill

In the framework of generalized Oppenheim expansions we prove strong law of large numbers for lightly trimmed sums. In the first part of this work we identify a particular class of expansions for which we provide a convergence result…

Probability · Mathematics 2023-11-07 Milto Hadjikyriakou , Rita Giuliano

Let $A$ and $B$ be sets of $k\ge5$ elements in $F=\mathbb{Z}/p\mathbb{Z}$ the field with $p>2k-2$ elements. We denote by $A\dot{+}B$ the set of different elements of $F$ that can be written in the form $a+b$, where $a\in A$, $b\in B$,…

A generalised summation method is considered based on the Fourier series of periodic distributions. It is shown that $$ e^{it}-2e^{2it}+3e^{3it}-4e^{4it}+-\cdots = {\mathrm P\mathrm f} {\displaystyle \frac{e^{it}}{(1+e^{it})^2}} +i\pi…

Functional Analysis · Mathematics 2020-03-31 Amol Sasane

The starting point of this work is an equality between two quantities $A$ and $B$ found in the literature, which involve the {\em doubling-modulo-an-odd-integer} map, i.e., $x\in {\mathbb N} \mapsto 2x \bmod{(2n+1)}$ for some positive…

Number Theory · Mathematics 2025-04-25 Jean-Paul Allouche , Manon Stipulanti , Jia-Yan Yao

Our main aim is to apply the theory of regularly varying functions to the asymptotical analysis at infinity of solutions of Friedmann cosmological equations. A new constant $\Gamma$ is introduced related to the Friedmann cosmological…

General Relativity and Quantum Cosmology · Physics 2017-03-21 Žarko Mijajlović , Nadežda Pejović , Stevo Šegan , Goran Damljanović

We give an effective version with explicit constants of a mean value theorem of Vaughan related to the values of \psi(y, \chi), the twisted summatory function associated to the von Mangoldt function \Lambda and a Dirichlet character \chi.…

Number Theory · Mathematics 2013-12-05 Amir Akbary , Kyle Hambrook

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

Number Theory · Mathematics 2024-10-30 Zander Kelley , Raghu Meka