
In this paper, we provide a full characterization for the existence of the limit lim 𝑛→∞ 𝑈𝑛+𝑝 𝑈𝑛 where (𝑈𝑛)𝑛≥0 is a linear recurrence sequence of complex numbers, provided that the sequence of moduli (|𝑈𝑛|)𝑛≥0 is eventually increasing. This characterization has a very simple form, and is based on the roots of the minimal polynomial of the sequence (𝑈𝑛)𝑛≥0. When 𝑝 =1, the considered limit is sometimes called the Kepler limit. Our result thus also provides a characterization for the existence of the Kepler limit, as the hypothesis on the increasing moduli is not needed in this case. This work extends research conducted by Fiorenza and Vincenzi for the case 𝑝 =1.
This paper studies the pseudorandomness of four celebrated binary sequence constructions by several authors (Goubin, Gyarmati, Mauduit, Pethő, Rivat, and Sárközy) based on computational evidence. Furthermore, a new theorem establishes a strong link between the correlation measure and the combined measure: for families of sequences satisfying a certain closure property: low correlation (𝐶ℓ) implies a low combined measure (𝑄ℓ). This theoretical result confirms that controlling standard correlation is a powerful method for controlling correlation along arithmetic progressions for broad classes of pseudorandom sequence families. By applying this new theorem, we derive new upper bounds for the combined measure 𝑄ℓ for the established four constructions, thereby confirming their strong combined-measure properties.
For a common class of slowly varying functions 𝑓, this note studies the empirical distributions modulo one of sequences (𝑓(𝑝𝑛)) where 𝑝𝑛 denotes the 𝑛-th prime number. By means of a Kantorovich metric for probability measures on the circle, simple explicit bounds are established for the deviation of these empirical distributions from their limit set, a circle consisting of all rotated copies of a single exponential distribution. Despite their simplicity the established bounds often are sharp. They complement known results in the literature and give rise to several intriguing quantitative questions.
Finite binary sequences with strong pseudorandom properties are essential for secure cryptographic systems. The power generator, defined by a modular exponentiation recurrence, is a widely used method for creating such sequences. While its pseudorandomness has been extensively analysed for prime moduli, real-world cryptographic applications like the RSA and Blum–Blum–Shub generators rely heavily on composite moduli. This paper bridges that gap by investigating the power generator’s behaviour when the modulus is a product of distinct primes. Building upon Gyarmati’s exponential sum estimates for prime moduli, we demonstrate that the generator retains its strong pseudorandom characteristics in the composite case. The approach is based on the Chinese Remainder Theorem, enabling the generalization of character sum bounds. Ultimately, we establish new upper bounds for the pseudorandom measures introduced by Mauduit and Sárközy, specifically the well-distribution and correlation measures.
In this paper, we study a fractional-order Keller–Segel coupled system focusing on their dynamic behavior and nonlinear wave structures. The Caputo–Fabrizio fractional derivative is used. This derivative has a non-singular kernel. It is suitable for real physical problems. The homotopy perturbation transform method (HPTM) is applied. The method provides an efficient semi-analytical solution. It avoids linearization and discretization. The solution is obtained in series form. The convergence of the solution is smooth and rapid. The dynamic behavior of the system is analyzed. The effect of different fractional orders 𝛼 is examined. Two-dimensional 2D graphs are plotted for various 𝛼 ∈(0,1) values. Three-dimensional 3D surfaces are also presented. These graphs show the evolution of the solution clearly. Nonlinear wave structures are observed. The amplitude and shape of waves change with 𝛼. The results show that fractional order plays a key role. The proposed method is simple and accurate. It can be used for many nonlinear fractional models.