Related papers: On arithmetic progressions in Lucas sequences
Considering the sets of subsums of series (or achievement sets) we show that for conditionally convergent series the multidimensional case is much more complicated than that of the real line. Although we are far from the full topological…
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…
Formulae of the Lambek calculus are constructed using three binary connectives, multiplication and two divisions. We extend it using a unary connective, positive Kleene iteration. For this new operation, following its natural…
For an integer $b\geq 2$, a positive integer is called a $b$-Niven number if it is a multiple of the sum of the digits in its base-$b$ representation. In this article, we show that every arithmetic progression contains infinitely many…
In this paper we study a sequence involving the prime numbers by deriving two asymptotic formulas and finding new upper and lower bounds, which improve the currently known estimates.
B. Green and T. Tao have recently proved that 'the set of primes contains arbitrary long arithmetic progressions', answering to an old question with a remarkably simple formulation. The proof does not use any "transcendental" method and any…
Many mathematical statements have the following form. If something is true for all finite subsets of an infinite set $I$, then it is true for all of $I$. This paper describes some old and new results on infinite sets of linear and…
In this paper we consider some non linear Hawkes processes with signed reproduction function (or memory kernel) thus exhibiting both self-excitation and inhibition. We provide a Law of Large Numbers, a Central Limit Theorem and large…
We investigate the class of finite dimensional not necessary associative algebras that have slowly growing length, that is, for any algebra in this class its length is less than or equal to its dimension. We show that this class is…
We prove that a linear growth graph has finitely many horofunctions. This provides a short and simple proof that any finitely generated infinite group of linear growth is virtually cyclic.
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
Orders and fractional ideals in number fields provide interesting examples of lattices. We ask: what lattices arise from orders in number fields? We prove that all nontrivial multiplicative constraints on successive minima of orders come…
We investigate the problem of type isomorphisms in the presence of higher-order references. We first introduce a finitary programming language with sum types and higher-order references, for which we build a fully abstract games model…
Based on continued fractions with subtractions, we identify the set of real numbers with the set of infinite integer sequences with all terms but the first one greater or equal to two. Each such sequence produces in a canonical way a unique…
Progression, the task of updating a knowledge base to reflect action effects, generally requires second-order logic. Identifying first-order special cases, by restricting either the knowledge base or action effects, has long been a central…
Bugeaud, Mignotte, and Siksek proved that the only perfect powers in Fibonacci sequence are 0, 1, 8, and 144. In this paper, we study the polynomial analogue of the problem. Especially, we give a complete characterization of the Fibonacci…
In this paper, it is proved that there is an arithmetic progression of positive integers such that each of which is expressible neither as $p+F_m$ nor as $q+L_n$, where $ p,q $ are primes, $ F_m $ denotes the $ m $-th Fibonacci number and $…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
Continued fractions with prescribed structures on sequences of their partial quotients have been intensively studied in the literature. As far as an integer sequence, especially a randomly generated one is concerned, an attractive question…
We introduce partially lax limits of infinity-categories, which interpolate between ordinary limits and lax limits. Most naturally occurring examples of lax limits are only partially lax; we give examples arising from enriched categories…