English
Related papers

Related papers: Upper Bounds for Stern's Diatomic Sequence and Rel…

200 papers

The Stern diatomic sequence is closely linked to continued fractions via the Gauss map on the unit interval, which in turn can be understood via systematic subdivisions of the unit interval. Higher dimensional analogues of continued…

Stern's diatomic sequence with its intrinsic repetition and refinement structure between consecutive powers of $2$ gives rise to a rather natural probability measure on the unit interval. We construct this measure and show that it is purely…

Number Theory · Mathematics 2018-03-19 Michael Baake , Michael Coons

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

This short note studies the asymptotic behavior of a generating function associated with the decimal expansion of \(2^n\). Our aims are twofold: (i) to present a problem on the best possible upper bound for this behavior, and (ii) to…

Combinatorics · Mathematics 2025-10-22 Hideaki Noda

We prove that the Stern diatomic sequence is asymptotically distributed according to a normal law, on a logarithmic scale. This is obtained by studying complex moments, and the analytic properties of a transfer operator.

Number Theory · Mathematics 2019-05-07 Sandro Bettin , Sary Drappeau , Lukas Spiegelhofer

We investigate the Stern polynomials defined by $B_0 ( t ) =0,B_1 ( t ) =1$, and for $n \geq 2$ by the recurrence relations $B_{2n}( t) =tB_{n}( t) ,$ $B_{2n+1}( t) =B_n( t) +B_{n+1}( t) $. We prove that all possible rational roots of that…

Combinatorics · Mathematics 2014-01-16 Maciej Gawron

We prove a lemma that is useful to get upper bounds for the number of partitions without a given subsum. From this we can deduce an improved upper bound for the number of sets represented by the (unrestricted or into unequal parts)…

Combinatorics · Mathematics 2007-11-07 Jean-Christophe Aval

This paper explores the partition properties of roller coaster permutations, a class of permutations characterized by maximizing the number of alternating runs in all subsequences. We establish a connection between the structure of these…

Combinatorics · Mathematics 2026-01-01 William Adamczak

A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map \[ D : (a_1, a_2, \ldots, a_n) \mapsto \big(|a_1-a_2|,|a_2-a_3|,\ldots,|a_n-a_1|\big). \] Such a sequence is eventually periodic and we denote by $P(n)$ the…

Number Theory · Mathematics 2020-07-08 Florian Breuer , Igor E. Shparlinski

Let lambda_s(n) denote the maximum length of a Davenport-Schinzel sequence of order s on n symbols. For s=3 it is known that lambda_3(n) = Theta(n alpha(n)) (Hart and Sharir, 1986). For general s>=4 there are almost-tight upper and lower…

Discrete Mathematics · Computer Science 2013-03-25 Gabriel Nivasch

Recall that a Stirling permutation is a permutation on the multiset $\{1,1,2,2,\ldots,n,n\}$ such that any numbers appearing between repeated values of $i$ must be greater than $i$. We call a Stirling permutation ``flattened'' if the…

Combinatorics · Mathematics 2023-11-29 Adam Buck , Jennifer Elder , Azia A. Figueroa , Pamela E. Harris , Kimberly Harry , Anthony Simpson

The restricted partition function $p_N(n)$ counts the partitions of the integer $n$ into at most $N$ parts. In the nineteenth century Sylvester described these partitions as a sum of waves. We give detailed descriptions of these waves and,…

Number Theory · Mathematics 2018-04-02 Cormac O'Sullivan

Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…

Number Theory · Mathematics 2016-11-10 Laurent Habsieger , Alain Plagne

We consider a variant of Stern's diatomic sequence, studied recently by Northshield. We prove that this sequence $b$ is invariant under \emph{digit reversal} in base $3$, that is, $b_n=b_{n^R}$, where $n^R$ is obtained by reversing the…

Number Theory · Mathematics 2017-09-19 Lukas Spiegelhofer

In this paper we study uniform distribution properties of digital sequences over a finite field of prime order. In 1998 it was shown by Larcher that for almost all $s$-dimensional digital sequences the star discrepancy $D_N^\ast$ satisfies…

Number Theory · Mathematics 2013-02-19 Gerhard Larcher , Friedrich Pillichshammer

We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…

Metric Geometry · Mathematics 2023-03-07 Alexander Barg , Peter Boyvalenkov , Maya Stoyanova

This note reports on the number of s-partitions of a natural number n. In an s-partition each cell has the form $2^k-1$ for some integer k. Such partitions have potential applications in cryptography, specifically in distributed…

Combinatorics · Mathematics 2007-05-23 William M. Y. Goh , Pawel Hitczenko , Ali Shokoufandeh

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

Combinatorics · Mathematics 2019-01-16 Richard P. Stanley

We prove a number of results related to a problem of Po-Shen Loh, which is equivalent to a problem in Ramsey theory. Let $a=(a_1,a_2,a_3)$ and $b=(b_1,b_2,b_3)$ be two triples of integers. Define $a$ to be 2-less than $b$ if $a_i<b_i$ for…

Combinatorics · Mathematics 2023-06-22 W. T. Gowers , J. Long

For every $p\leq n$ positive integer we obtain the lower bound $(3-\frac{1}{p+1})n^2-\big(2\binom{2p}{p+1}-\binom{2p-2}{p-1}+2\big)n$ for the rank of the $n\times n$ matrix multiplication. This bound improves the previous one…

Computational Complexity · Computer Science 2013-11-08 Alex Massarenti , Emanuele Raviolo