Displaying similar documents to “Recurrence for cosine series with bounded gaps”

The positivity problem for fourth order linear recurrence sequences is decidable

Pinthira Tangsupphathawat, Narong Punnim, Vichian Laohakosol (2012)

Colloquium Mathematicae

Similarity:

The problem whether each element of a sequence satisfying a fourth order linear recurrence with integer coefficients is nonnegative, referred to as the Positivity Problem for fourth order linear recurrence sequence, is shown to be decidable.

An inequality for Fibonacci numbers

Horst Alzer, Florian Luca (2022)

Mathematica Bohemica

Similarity:

We extend an inequality for Fibonacci numbers published by P. G. Popescu and J. L. Díaz-Barrero in 2006.

On two recurrence problems

Michael Boshernitzan, Eli Glasner (2009)

Fundamenta Mathematicae

Similarity:

We review some aspects of recurrence in topological dynamics and focus on two open problems. The first is an old one concerning the relation between Poincaré and Birkhoff recurrence; the second, due to the first author, is about moving recurrence. We provide a partial answer to a topological version of the moving recurrence problem.

On Balancing and Lucas-balancing Quaternions

Bijan Kumar Patel, Prasanta Kumar Ray (2021)

Communications in Mathematics

Similarity:

The aim of this article is to investigate two new classes of quaternions, namely, balancing and Lucas-balancing quaternions that are based on balancing and Lucas-balancing numbers, respectively. Further, some identities including Binet's formulas, summation formulas, Catalan's identity, etc. concerning these quaternions are also established.

A strengthening of a theorem of Marcinkiewicz

Konstantin E. Tikhomirov (2011)

Banach Center Publications

Similarity:

We consider a problem of intervals raised by I. Ya. Novikov in [Israel Math. Conf. Proc. 5 (1992), 290], which refines the well-known theorem of J. Marcinkiewicz concerning structure of closed sets [A. Zygmund, Trigonometric Series, Vol. I, Ch. IV, Theorem 2.1]. A positive solution to the problem for some specific cases is obtained. As a result, we strengthen the theorem of Marcinkiewicz for generalized Cantor sets.

On terms of linear recurrence sequences with only one distinct block of digits

Diego Marques, Alain Togbé (2011)

Colloquium Mathematicae

Similarity:

In 2000, Florian Luca proved that F₁₀ = 55 and L₅ = 11 are the largest numbers with only one distinct digit in the Fibonacci and Lucas sequences, respectively. In this paper, we find terms of a linear recurrence sequence with only one block of digits in its expansion in base g ≥ 2. As an application, we generalize Luca's result by finding the Fibonacci and Lucas numbers with only one distinct block of digits of length up to 10 in its decimal expansion.