English
Related papers

Related papers: On distinct consecutive $r$-differences

200 papers

Let $s(n)$ be the number of different remainders $n \bmod k$, where $1 \leq k \leq \lfloor n/2 \rfloor$. This rather natural sequence is sequence A283190 in the OEIS and while some basic facts are known, it seems that surprisingly it has…

Number Theory · Mathematics 2025-08-29 Omkar Baraskar , Ingrid Vukusic

We consider the problem of identifying tandem scattered subsequences within a string. Our algorithm identifies a longest subsequence which occurs twice without overlap in a string. This algorithm is based on the Hunt-Szymanski algorithm,…

Data Structures and Algorithms · Computer Science 2020-06-26 Luís M. S. Russo , Alexandre P. Francisco

A second order finite-difference equation has two linearly independent solutions. It is shown here that, like in the continuous case, at most one of the two can be a polynomial solution. The uniqueness in the classical continuous…

Mathematical Physics · Physics 2015-09-18 Alexander Moroz

We show that two notions of continued fraction normality, one where overlapping occurrences of finite patterns are counted as distinct occurrences, and another where only disjoint occurrences are counted as distinct, are identical. This…

Dynamical Systems · Mathematics 2019-09-11 Satyadev Nandakumar , Subin Pulari , Prateek Vishnoi , Gopal Viswanathan

We establish a central limit theorem for counting large continued fraction digits $(a_n)$, i.e. we count occurrences $\{a_n>b_n\}$, where $(b_n)$ is a sequence of positive integers. Our result improves a similar result by Philipp which…

Probability · Mathematics 2021-12-02 Marc Kesseböhmer , Tanja Schindler

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

Combinatorics · Mathematics 2022-10-31 Simone Costa , Marco Dalai , Stefano Della Fiore

Consider an infinite sequence $(x_k)_{k=1}^{\infty}$ on the unit circle $\mathbb{S}^1$. We may interpret the first $n$ elements $(x_k)_{k=1}^{n}$ as places where the `circular stick' $\mathbb{S}^1$ is broken into a total of $n+1$ pieces. It…

Combinatorics · Mathematics 2025-11-19 François Clément , Stefan Steinerberger

Assuming projective determinacy, we extend Spector's strong version of the Spector-Gandy Theorem to all odd levels of the projective hierarchy: Theorem. For every space $X$ which is a finite product of the natural numbers $N$ and Baire…

Logic · Mathematics 2022-02-09 Joan R. Moschovakis , Yiannis N. Moschovakis

Recently, generalizations of the classical Three Gap Theorem to higher dimensions attracted a lot of attention. In particular, upper bounds for the number of nearest neighbor distances have been established for the Euclidean and the maximum…

Number Theory · Mathematics 2021-05-07 Christian Weiß

In the present work a new simple proof of the theorem of Gallagher about the average of the singular series in the Hardy-Littlewood prime k-tuple conjecture is proved (in an even stronger form) which is uniform with respect to k (if the…

Number Theory · Mathematics 2010-04-08 Janos Pintz

Pairs of consecutive integers have the same height in the Collatz problem with surprising frequency. Garner gave a conjectural family of conditions for exactly when this occurs. Our main result is an infinite family of counterexamples to…

Number Theory · Mathematics 2015-12-01 Marcus Elia , Amanda Tucker

Update: This work reproduces an earlier result of Peck, which the author was initially unaware of. The method of the proof is essentially the same as the original work of Peck. There are no new results. We show that the sum of squares of…

Number Theory · Mathematics 2012-11-07 J. Maynard

We study the unit distance and distinct distances problems over the planar hypercomplex numbers: the dual numbers $\mathbb{D}$ and the double numbers $\mathbb{S}$. We show that the distinct distances problem in $\mathbb{S}^2$ behaves…

Combinatorics · Mathematics 2020-02-18 David FitzPatrick

The $3k-4$ Theorem is a classical result which asserts that if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with \begin{equation}\label{hyp}|A+B|=|A|+|B|+r\leq |A|+|B|+\min\{|A|,\,|B|\}-3-\delta,\end{equation} where $\delta=1$ if…

Number Theory · Mathematics 2019-12-02 David J. Grynkiewicz

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

Combinatorics · Mathematics 2010-09-14 Karsten Chipeniuk

New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…

Combinatorics · Mathematics 2016-11-22 Bernardo Abrego , Silvia Fernandez-Merchant , Daniel J. Katz , Levon Kolesnikov

A sequence $S=s_{1}s_{2}..._{n}$ is \emph{nonrepetitive} if no two adjacent blocks of $S$ are identical. In 1906 Thue proved that there exist arbitrarily long nonrepetitive sequences over 3-element set of symbols. We study a generalization…

Combinatorics · Mathematics 2011-04-15 Jarosław Grytczuk , Jakub Kozik , Marcin Witkowski

We define discrete generating series for arbitrary functions \( f \colon \mathbb{Z}^n \rightarrow \mathbb{C} \) and derive functional relations that these series satisfy. For linear difference equations with constant coefficients, we…

Classical Analysis and ODEs · Mathematics 2025-05-01 Vitaly Alekseev , Tom Cuchta , Alexander Lyapin

There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…

Combinatorics · Mathematics 2007-05-23 Sergey Avgustinovich , Sergey Kitaev

Let surreal numbers be defined by means of sign sequences. We give a proof that if $S < T$ are sets of surreals, then there is some surreal $w$ such that $S < w < T$. The classical proof is simplified by observing that, for every set $S$ of…

Number Theory · Mathematics 2018-05-22 Paolo Lipparini