English
Related papers

Related papers: Some Linear Recurrences Motivated by Stern's Diato…

200 papers

We unify Linear Algebra by proposing a definition of determinants via one equation that implies all known properties of them:\\ 1. Cramer's Rule,\\ 2. Cofactor expansion,\\ 3. Antisymmetry of determinants,\\ 4. Linearity of determinants,\\…

Geometric Topology · Mathematics 2023-06-05 Jerzy Dydak

Starting from a result of Stewart, Tijdeman and Ruzsa on iterated difference sequences, we introduce the notion of iterated compositions of linear operations. We prove a general result on the stability of such compositions (with bounded…

Number Theory · Mathematics 2010-05-21 Norbert Hegyvári , Francois Hennecart , Alain Plagne

We consider series of the form $$ \frac{p}{q} +\sum_{j=2}^\infty \frac{1}{x_j}, $$ where $x_1=q$ and the integer sequence $(x_n)$ satisfies a certain non-autonomous recurrence of second order, which entails that $x_n|x_{n+1}$ for $n\geq 1$.…

Number Theory · Mathematics 2016-03-11 Andrew N. W. Hone

This note is devoted to study the recurrent numerical sequence defined by: $a_0 = 0$, $a_n = \frac{n}{2} a_{n - 1} + (n - 1)!$ ($\forall n \geq 1$). Although, it is immediate that ${(a_n)}_n$ is constituted of rational numbers with…

Number Theory · Mathematics 2022-04-22 Bakir Farhi

The Fibonacci numbers are the prototypical example of a recursive sequence, but grow too quickly to enumerate sets of integer partitions. The same is true for the other classical sequences $a(n)$ defined by Fibonacci-like recursions: the…

Combinatorics · Mathematics 2023-03-22 Cristina Ballantine , George Beck

Given a positive integer $n$, the small divisors of $n$ are defined as the positive divisors that do not exceed $\sqrt{n}.$ Ianucci previously classified all $n$ for which the small divisors of $n$ form an arithmetic progression. In this…

Number Theory · Mathematics 2021-08-31 A. Anas Chentouf

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

This paper establishes an abstract Korovkin-type approximation theorem in general spaces, extending the framework of approximation theory to accommodate broader contexts. A critical result supporting this theorem is the proof that any…

Functional Analysis · Mathematics 2025-09-03 Dilek Söylemez , Mehmet Ünver

The Eulerian triangle is a classical array of combinatorial numbers defined by a linear recursion. The associated boundary problem asks one to find all extreme nonnegative solutions to a dual recursion. Exploiting connections with random…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Grigori Olshanski

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…

Dynamical Systems · Mathematics 2016-06-08 Huang Yuke , Wen Zhiying

It is shown that the unique representation of positive integers in terms of tribonacci numbers and the unique representation in terms of iterated A, B and C sequences defined from the tribonacci word are equivalent. Two auxiliary…

Number Theory · Mathematics 2020-09-25 Wolfdieter Lang

We prove that the uniform recurrence of morphic sequences is decidable. For this we show that the number of derived sequences of uniformly recurrent morphic sequences is bounded. As a corollary we obtain that uniformly recurrent morphic…

Combinatorics · Mathematics 2012-09-03 Fabien Durand

This paper presents both a proof method and a result. The proof method presented is particularly suitable for uniformly proving families of identities satisfied by a family of recursive sequences. To illustrate the method, we study the…

Combinatorics · Mathematics 2021-07-09 Russell Jay Hendel

A set $R\subset \mathbb{N}$ is called rational if it is well-approximable by finite unions of arithmetic progressions. Examples of rational sets include many classical sets of number-theoretical origin such as the set of squarefree numbers,…

Dynamical Systems · Mathematics 2022-05-16 Vitaly Bergelson , Joanna Kułaga-Przymus , Mariusz Lemańczyk , Florian K. Richter

Using a structure theorem from [FG2010] we prove a version of multiple recurrence for sets of positive measure in a general stationary dynamical system.

Dynamical Systems · Mathematics 2011-11-03 Hillel Furstenberg , Eli Glasner

Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…

Information Theory · Computer Science 2010-07-26 Graham H. Norton

We give a simplified presentation of some results about recurrences of certain sequences of binomial sums in terms of (generalized) Fibonacci and Lucas polynomials.

Number Theory · Mathematics 2022-12-06 Johann Cigler

Six families of generalized hypergeometric series in a variable $x$ and an arbitrary number of parameters are considered. Each of them is indexed by an integer $n$. Linear recurrence relations in $n$ relate these functions and their product…

Classical Analysis and ODEs · Mathematics 2022-10-25 Nicolas Brisebarre , Bruno Salvy

Farey sequences, Stern-Brocot sequences, the Calkin-Wilf sequences are shown to be generated via almost identical second order recurrence relations. These sequences have combinatorial, computational, and geometric applications, and are…

Number Theory · Mathematics 2014-05-26 S. P. Glasby

We derive, in order of magnitude, the observed astrophysical and cosmological scales in the Universe, from neutron stars to superclusters of galaxies, up to, asymptotically, the observed radius of the Universe. This result is obtained by…

Astrophysics · Physics 2007-05-23 S. Capozziello , S. De Martino , S. De Siena , F. Guerra , F. Illuminati