English
Related papers

Related papers: On (almost) realizable subsequences of linearly re…

200 papers

We prove that many sequences of positive numbers $(a_n)$ defined by finite linear difference equations $a_{n+k}=c_{k-1}a_{n+k-1}+...+c_0a_n$ with suitable non negative reals coefficients $c_i$ satisfy Bendford's Law on the first digit in…

Dynamical Systems · Mathematics 2010-08-18 Hugues Deligny , Paul Jolissaint

Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…

Number Theory · Mathematics 2023-06-06 Jacob Hartzer , Christopher O'Neill

Let $\varphi$ be the Euler's function and fix an integer $k\ge 0$. We show that, for every initial value $x_1\ge 1$, the sequence of positive integers $(x_n)_{n\ge 1}$ defined by $x_{n+1}=\varphi(x_n)+k$ for all $n\ge 1$ is eventually…

Number Theory · Mathematics 2023-02-06 Paolo Leonetti , Florian Luca

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

Combinatorics · Mathematics 2007-05-23 Sergey Kitaev , Tyrrell B. McAllister , T. Kyle Petersen

More than twenty-five years ago, Manickam, Miklos, and Singhi conjectured that for positive integers $n,k$ with $n \geq 4k$, every set of $n$ real numbers with nonnegative sum has at least $\binom{n-1}{k-1}$ $k$-element subsets whose sum is…

Combinatorics · Mathematics 2014-07-22 Ameera Chowdhury , Ghassan Sarkis , Shahriar Shahriari

Consider a mixing dynamical systems $([0,1], T, \mu)$, for instance a piecewise expanding interval map with a Gibbs measure $\mu$. Given a non-summable sequence $(m_k)$ of non-negative numbers, one may define $r_k (x)$ such that $\mu (B(x,…

Dynamical Systems · Mathematics 2024-05-07 Tomas Persson

Consider "lagged" Fibonacci sequences $a(n) = a(n-1)+a(\lfloor n/k\rfloor)$ for $k > 1$. We show that $\lim_{n\to\infty} a(kn)/a(n)\cdot\ln n/n = k\ln k$ and we demonstrate the slow numerical convergence to this limit and how to deal with…

Combinatorics · Mathematics 2009-12-15 Stephan Mertens , Stefan Boettcher

We show that various aspects of k-automatic sequences -- such as having an unbordered factor of length n -- are both decidable and effectively enumerable. As a consequence it follows that many related sequences are either k-automatic or…

Formal Languages and Automata Theory · Computer Science 2011-10-14 Emilie Charlier , Narad Rampersad , Jeffrey Shallit

A sequence $\Big(u_n\Big)_{n=0}^{\infty}$ is said to be convex if it satisfies the following inequality $$ 2u_n\leq u_{n-1}+u_{n+1}\qquad \mbox{for all}\qquad n\in\mathbb{N}. $$ We present several characterizations of convex sequences and…

General Mathematics · Mathematics 2025-05-30 Angshuman Robin Goswami

Let $\{a_i\}_{i=1}^\ell$ be a strongly unimodal positive integer sequence with peak position $k$. The rank of such sequence is defined to be $\ell-2k+1$. Let $u(m,n)$ denote the number of sequences $\{a_i\}_{i=1}^\ell$ with rank $m$ and…

Combinatorics · Mathematics 2024-07-26 Wenston J. T. Zang

It's the age-old recurrence with a twist: sum the last two terms and if the result is composite, divide by its smallest prime divisor to get the next term (e.g., 0, 1, 1, 2, 3, 5, 4, 3, 7, ...). These sequences exhibit pseudo-random…

Number Theory · Mathematics 2016-01-06 Richard K. Guy , Tanya Khovanova , Julian Salazar

Zeckendorf proved that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}$, and later researchers showed that the distribution of the number of summands needed for such decompositions of integers in…

We establish mean convergence for multiple ergodic averages with iterates given by distinct fractional powers of primes and related multiple recurrence results. A consequence of our main result is that every set of integers with positive…

Dynamical Systems · Mathematics 2022-05-19 Nikos Frantzikinakis

For any recurrent random walk (S_n)_{n>0} on R, there are increasing sequences (g_n)_{n>0} converging to infinity for which (g_n S_n)_{n>0} has at least one finite accumulation point. For one class of random walks, we give a criterion on…

Probability · Mathematics 2007-05-23 Dimitrios Cheliotis

The linear complexity of a sequence $s$ is one of the measures of its predictability. It represents the smallest degree of a linear recursion which the sequence satisfies. There are several algorithms to find the linear complexity of a…

Cryptography and Security · Computer Science 2019-12-30 Yeow Meng Chee , Johan Chrisnata , Tuvi Etzion , Han Mao Kiah

For any measure preserving system $(X,\mathcal{X},\mu,T)$ and $A\in\mathcal{X}$ with $\mu(A)>0$, we show that there exist infinitely many primes $p$ such that $\mu\bigl(A\cap T^{-(p-1)}A\cap T^{-2(p-1)}A\bigr) > 0$ (the same holds with…

Dynamical Systems · Mathematics 2007-05-23 Nikos Frantzikinakis , Bernard Host , Bryna Kra

Fix a finite set $S \subset {GL}(k,\mathbb{Z})$. Denote by $a_n$ the number of products of matrices in $S$ of length $n$ that are equal to 1. We show that the sequence $\{a_n\}$ is not always P-recursive. This answers a question of…

Combinatorics · Mathematics 2015-02-25 Scott Garrabrant , Igor Pak

In the spirit of the famous KOML\'OS (1967) theorem, every sequence of nonnegative, measurable functions $\{ f_n \}_{n \in \N}$ on a probability space, contains a subsequence which - along with all its subsequences - converges a.e. in…

Probability · Mathematics 2022-04-11 Ioannis Karatzas , Walter Schachermayer

Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute…

Combinatorics · Mathematics 2023-06-22 Wenjie Fang

We determine periodic and aperiodic points of certain piecewise affine maps in the Euclidean plane. Using these maps, we prove for $\lambda\in\{\frac{\pm1\pm\sqrt5}2,\pm\sqrt2,\pm\sqrt3\}$ that all integer sequences $(a_k)_{k\in\mathbb Z}$…

Dynamical Systems · Mathematics 2008-09-16 Shigeki Akiyama , Horst Brunotte , Attila Petho , Wolfgang Steiner
‹ Prev 1 8 9 10 Next ›