English
Related papers

Related papers: Quantitative growth of multi-recurrence sequences

200 papers

In this paper we provide a complete proof for a bound on the growth of multi-recurrences which are defined over a number field. The proven bound was already stated by van der Poorten and Schlickewei forty years ago.

Number Theory · Mathematics 2023-04-12 Clemens Fuchs , Sebastian Heintze

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

Number Theory · Mathematics 2025-10-08 Armand Noubissie

Using a method we have utilized previously, namely through a finite power series expansion which also sometimes is known as the "radix polynomial" representation of an integer, we find an upper bound for a van der Waerden number that has a…

Number Theory · Mathematics 2016-07-05 Robert J Betts

Generalizing some popular sequences like Catalan's number, Schr\"oder's number, etc, we consider the sequence $s_n$ with $s_0=1$ and for $n\ge 1$, \begin{multline*} s_n=\sum_{x_1+\dots+x_{\ell_1}=n-1} \kappa_1 s_{x_1}\dots s_{x_{\ell_1}} +…

Combinatorics · Mathematics 2024-10-25 Vuong Bui

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

Number Theory · Mathematics 2018-05-24 Domingo Gómez-Pérez , Alina Ostafe , Min Sha

Motivated by the classical Hilbert's Sixteenth Problem, we extend some main developments obtained for Hilbert's number in the polynomial setting to the piecewise polynomial context. Specifically, we study the growth of the maximum number of…

Dynamical Systems · Mathematics 2026-01-30 Luana Ascoli , Douglas D. Novaes

Suppose that $(Z_n)_{n\geq0}$ is a supercritical branching process in independent and identically distributed random environment. The right tail function of the scaled growth rate for $(Z_n)_{n\geq0}$ is studied. The upper bounds for…

Probability · Mathematics 2021-03-02 Yinna Ye

Let $ (G_n)_{n=0}^{\infty} $ be a non-degenerate linear recurrence sequence with power sum representation $ G_n = a_1(n) \alpha_1^n + \cdots + a_t(n) \alpha_t^n $. In this paper we will prove a function field analogue of the well known…

Number Theory · Mathematics 2023-06-22 Clemens Fuchs , Sebastian Heintze

In [K. Bou-Rabee, B. Seward, J. Reine Angwe. Math. 2016] Bou-Rabee and Seward constructed examples of finitely generated residually finite groups $G$ whose residual finiteness growth function $\mathcal{F}_G$ can be at least as fast as any…

Group Theory · Mathematics 2024-08-08 Henry Bradford

We give necessary and sufficient conditions for a sequence to be exactly realizable as the sequence of numbers of periodic points in a dynamical system. Using these conditions, we show that no non-constant polynomial is realizable, and give…

Dynamical Systems · Mathematics 2007-05-23 Yash Puri , Thomas Ward

For a given natural number $n$, the second part of Hilbert's 16th Problem asks whether there exists a finite upper bound for the maximum number of limit cycles that planar polynomial vector fields of degree $n$ can have. This maximum number…

Dynamical Systems · Mathematics 2024-11-15 Claudio A. Buzzi , Douglas D. Novaes

We determine a lower gap property for the growth of an unbounded \(\mathbb{Z}\)-valued \(k\)-regular sequence. In particular, if \(f:\mathbb{N}\to\mathbb{Z}\) is an unbounded \(k\)-regular sequence, we show that there is a constant \(c>0\)…

Number Theory · Mathematics 2014-10-22 Jason P. Bell , Michael Coons , Kevin G. Hare

We give a new characterization of maximal repetitions (or runs) in strings based on Lyndon words. The characterization leads to a proof of what was known as the "runs" conjecture (Kolpakov \& Kucherov (FOCS '99)), which states that the…

Discrete Mathematics · Computer Science 2018-07-03 Hideo Bannai , Tomohiro I , Shunsuke Inenaga , Yuto Nakashima , Masayuki Takeda , Kazuya Tsuruta

Often in the analysis of first-order methods, assuming the existence of a quadratic growth bound (a generalization of strong convexity) facilitates much stronger convergence analysis. Hence the analysis is done twice, once for the general…

Optimization and Control · Mathematics 2019-05-16 Benjamin Grimmer

In this paper we initiate the study of computing a maximal (not necessarily maximum) repeating pattern in a single input string, where the corresponding problems have been studied (e.g., a maximal common subsequence) only in two or more…

Data Structures and Algorithms · Computer Science 2026-01-21 Mingyang Gong , Adiesha Liyanage , Braeden Sopp , Binhai Zhu

The first two authors have shown [KK99,KK00] that the sum the exponent (and thus the number) of maximal repetitions of exponent at least 2 (also called runs) is linear in the length of the word. The exponent 2 in the definition of a run may…

Discrete Mathematics · Computer Science 2009-06-26 Roman Kolpakov , Gregory Kucherov , Pascal Ochem

The repetition threshold of a class of sequences is the smallest number $r$ such that a sequence from the class contains no repetition with exponent $> r$. We focus on the class $\mathcal{C}_d$ of $d$-ary sequences rich in palindromes. In…

Combinatorics · Mathematics 2025-09-09 Lubomíra Dvořáková , Edita Pelantová

In this article we prove several new uniform upper bounds on the number of points of bounded height on varieties over $\mathbb{F}_q[t]$. For projective curves, we prove the analogue of Walsh' result with polynomial dependence on $q$ and the…

Number Theory · Mathematics 2020-03-27 Floris Vermeulen

In this paper, we study the periodicity structure of finite field linear recurring sequences whose period is not necessarily maximal and determine necessary and sufficient conditions for the characteristic polynomial~\(f\) to have exactly…

Combinatorics · Mathematics 2021-03-02 Ghurumuruhan Ganesan

The joint spectral radius of a finite set of real $d \times d$ matrices is defined to be the maximum possible exponential rate of growth of long products of matrices drawn from that set. A set of matrices is said to have the…

Optimization and Control · Mathematics 2012-01-31 Kevin G. Hare , Ian D. Morris , Nikita Sidorov , Jacques Theys
‹ Prev 1 2 3 10 Next ›