English
Related papers

Related papers: On further questions regarding unit fractions

200 papers

We study the number of values taken by the sums $\sum_{i=u}^{v-1} a_i$, where $a_1,a_2,\dots,a_n$ is a permutation of $1,2,\dots,n$ and $1 \leq u < v \leq n+1$. In particular, we show that for a random choice of a permutation, with high…

Combinatorics · Mathematics 2021-08-31 Jakub Konieczny

A set of positive integers $A \subset \mathbb{Z}_{> 0}$ is \emph{log-sparse} if there is an absolute constant $C$ so that for any positive integer $x$ the sequence contains at most $C$ elements in the interval $[x,2x)$. In this note we…

Combinatorics · Mathematics 2021-04-20 Noga Alon , Ryan Alweiss , Yang P. Liu , Anders Martinsson , Shyam Narayanan

We prove upper and lower bounds for certain sums of products of fractional parts by using majoring and minorizing functions from Fourier analysis. In special cases the upper bounds are sharp if there exist counterexamples to the Littlewood…

Number Theory · Mathematics 2013-09-09 Thai Hoang Le , Jeffrey D. Vaaler

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

We prove that if $A\subseteq \{1,\dots,N\}$ does not contain any non-trivial three-term arithmetic progression, then $$|A|\ll \frac{(\log\log N)^{3+o(1)}}{\log N}N\,.$$

Number Theory · Mathematics 2020-05-05 Tomasz Schoen

Let $\{u_n\}_{n=1}^{\infty}$ be the Sylvester's sequence (sequence A000058 in the OEIS), and let $ a_1 < a_2 < \cdots $ be any other positive integer sequence satisfying $ \sum_{i=1}^\infty \frac{1}{a_i} = 1 $. In this paper, we solve a…

Number Theory · Mathematics 2025-03-24 Zheng Li , Quanyu Tang

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

Number Theory · Mathematics 2016-12-15 Eknath Ghate , T. N. Venkataramana

In this note we consider fractions of the form 1/m and their floating-point representation in various arithmetic bases. For instance, what is 1/7 in base 2005? And, what about 1/4? We give a simple algorithm to answer these questions. In…

Number Theory · Mathematics 2023-10-24 Juan B. Gil , Michael D. Weiner

Cameron and Erd\H{o}s asked whether the number of \emph{maximal} sum-free sets in $\{1, \dots , n\}$ is much smaller than the number of sum-free sets. In the same paper they gave a lower bound of $2^{\lfloor n/4 \rfloor }$ for the number of…

Combinatorics · Mathematics 2018-05-14 József Balogh , Hong Liu , Maryam Sharifzadeh , Andrew Treglown

For a class of arithmetic subgroups $\Gamma$ in SU(d,1) we prove that for every positive integer $n$ there exists a subgroup $\Gamma_n$ of finite index in $\Gamma$, which lifts to the $n$-fold connected cover of of SU(d,1). Consequently…

Group Theory · Mathematics 2021-08-11 Richard M. Hill

We consider two classes of $q$-continued fraction whose odd and even parts are limit 1-periodic for $|q|>1$, and give theorems which guarantee the convergence of the continued fraction, or of its odd- and even parts, at points outside the…

Number Theory · Mathematics 2019-01-01 Douglas Bowman , James Mc Laughlin

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

Number Theory · Mathematics 2007-05-23 Zhi-Wei Sun

We show that each rational number $r$, $0\le r<1$, occurs as the fractional part of a Dedekind sum $S(m,n)$.

Number Theory · Mathematics 2013-10-15 Kurt Girstmair

We show that if a subset A of {1,...,N} does not contain any solutions to the equation x+y+z=3w with the variables not all equal, then A has size at most exp(-c(log N)^{1/7}) N, where c > 0 is some absolute constant. In view of Behrend's…

Combinatorics · Mathematics 2014-08-13 Tomasz Schoen , Olof Sisask

Our main result states that when A, B, C are subsets of Z/NZ of respective densities \alpha,\beta,\gamma, the sumset A + B + C contains an arithmetic progression of length at least e^{c(\log N)^c} for densities \alpha > (\log N)^{-2 +…

Number Theory · Mathematics 2013-10-10 Kevin Henriot

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

We prove a special case of Erd\H{o}s' unit distance problem using a corollary of the subspace theorem bounding the number of solutions of linear equations from a multiplicative group. We restrict our attention to unit distances coming from…

Combinatorics · Mathematics 2012-11-30 Ryan Schwartz

We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…

Number Theory · Mathematics 2021-02-25 Thomas F. Bloom , James Maynard

Let $\mathbb{N}$ be the set of natural numbers and $\mathcal{S}_r=\big\{1^r, 2^r, 3^r,\cdots\big\}$ the set of $r$-th powers, where $r\ge 2$ is a natural number. Let $\mathcal{W}_r$ be an additive complement of $\mathcal{S}_r$ and $$…

Number Theory · Mathematics 2026-05-19 Yuchen Ding , Csaba Sándor , Zihan Zhang

The Diophantine sums $\sum_{n=1}^N \| n \alpha \|^{-1}$ and $\sum_{n=1}^N n^{-1} \| n \alpha \|^{-1}$ appear in many different areas including the ergodic theory of circle rotations, lattice point counting and random walks, often in…

Number Theory · Mathematics 2024-07-09 Bence Borda