English
Related papers

Related papers: Asymptotic behavior of growth functions of D0L-sys…

200 papers

This paper develops further and systematically the asymptotic expansion theory that was initiated by Foias and Saut in [11]. We study the long-time dynamics of a large class of dissipative systems of nonlinear ordinary differential…

Dynamical Systems · Mathematics 2020-09-18 Dat Cao , Luan Hoang

Let $\mathcal R_{n}$ be the set of all rational functions of the type $r(z) = f(z)/w(z)$, where $f(z)$ is a polynomial of degree at most $n$ and $w(z) = \prod_{j=1}^{n}(z-\beta_j)$, $|\beta_j|>1$ for $1\leq j\leq n$. In this work, we…

Complex Variables · Mathematics 2026-02-19 N. A. Rather , Mohmmad Shafi Wani , Danish Rashid Bhat

Motivated by applications in the theory of numeration systems and recognizable sets of integers, this paper deals with morphic words when erasing morphisms are taken into account. Cobham showed that if an infinite word $w =g(f^\omega(a))$…

Combinatorics · Mathematics 2016-04-18 Emilie Charlier , Julien Leroy , Michel Rigo

Let $L_{k,\alpha}^{\mathbb{Z}}$ denote the set of all bi-infinite $\alpha$-power free words over an alphabet with $k$ letters, where $\alpha$ is a positive rational number and $k$ is positive integer. We prove that if $\alpha\geq 5$, $k\geq…

Formal Languages and Automata Theory · Computer Science 2023-07-10 Josef Rukavicka

The exponential generating functions of {n^(n+m)} for arbitrary integer m are expressed as rational functions of the e.g.f. of {n^(n-1)} [the tree function] and then of the e.g.f. of {n^n} [the endofunction function]. The coefficients in…

Combinatorics · Mathematics 2016-09-07 Leonard M. Smiley

A restricted growth function (RGF) of length n is a sequence w = w_1 w_2 ... w_n of positive integers such that w_1 = 1 and w_i is at most 1 + max{w_1,..., w_{i-1}} for i at least 2. RGFs are of interest because they are in natural…

We prove a result that can be seen as an analogue of the P\'olya-Carlson theorem for multivariate D-finite power series with coefficients in $\bar{\mathbb{Q}}$. In the special case that the coefficients are algebraic integers, our main…

Number Theory · Mathematics 2023-06-06 Jason P. Bell , Shaoshi Chen , Khoa D. Nguyen , Umberto Zannier

An L-system (for lossless compression) is a CPD0L-system extended with two parameters $d$ and $n$, which determines unambiguously a string $w = \tau(\varphi^d(s))[1:n]$, where $\varphi$ is the morphism of the system, $s$ is its axiom, and…

Data Structures and Algorithms · Computer Science 2022-06-06 Gonzalo Navarro , Cristian Urbina

A famous result of Christol gives that a power series $F(t)=\sum_{n\ge 0} f(n)t^n$ with coefficients in a finite field $\mathbb{F}_q$ of characteristic $p$ is algebraic over the field of rational functions in $t$ if and only if there is a…

Number Theory · Mathematics 2019-11-04 Seda Albayrak , Jason P. Bell

Let $G$ be a finitely generated group with a finite generating set $S$. For $g\in G$, let $l_S(g)$ be the length of the shortest word over $S$ representing $g$. The growth series of $G$ with respect to $S$ is the series $A(t) =…

Group Theory · Mathematics 2014-01-16 Yoshiyuki Nakagawa , Makoto Tamura , Yasushi Yamashita

This note is an attempt to unconditionally prove the existence of weak one way functions (OWF). Starting from a provably intractable decision problem $L_D$ (whose existence is nonconstructively assured from the well-known discrete…

Computational Complexity · Computer Science 2023-07-19 Stefan Rass

Given a sequence of distinct positive integers $w_0 , w_1, w_2, \ldots$ and any positive integer $n$, we define the discriminator function $\mathcal{D}_{\bf w}(n)$ to be the smallest positive integer $m$ such that $w_0,\ldots, w_{n-1}$ are…

Number Theory · Mathematics 2020-12-01 A. de Clercq , F. Luca , L. Martirosyan , M. Matthis , P. Moree , M. A. Stoumen , M. Weiß

We describe several infinite series of rational conformal field theories whose conformal characters are modular units, i.e. which are modular functions having no zeros or poles in the upper complex half plane, and which thus possess simple…

High Energy Physics - Theory · Physics 2009-10-30 Wolfgang Eholzer , Nils-Peter Skoruppa

The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…

Dynamical Systems · Mathematics 2012-01-30 A. A. Prikhod'ko

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

The ability of Large Language Models (LLMs) to perform reasoning tasks such as deduction has been widely investigated in recent years. Yet, their capacity to generate proofs-faithful, human-readable explanations of why conclusions…

Artificial Intelligence · Computer Science 2026-01-21 Hui Yang , Jiaoyan Chen , Uli Sattler

Let $P$ be a partially ordered set and consider the free monoid $P^*$ of all words over $P$. If $w,w'\in P^*$ then $w'$ is a factor of $w$ if there are words $u,v$ with $w=uw'v$. Define generalized factor order on $P^*$ by letting $u\le w$…

Combinatorics · Mathematics 2008-06-24 Sergey Kitaev , Jeffrey Liese , Jeffrey Remmel , Bruce E. Sagan

We consider integer sequences that satisfy a recursion of the form $x_{n+1} = P(x_n)$ for some polynomial $P$ of degree $d > 1$. If such a sequence tends to infinity, then it satisfies an asymptotic formula of the form $x_n \sim A…

Number Theory · Mathematics 2020-08-07 Stephan Wagner , Volker Ziegler

Let $w$ be a finite word of length $n$. In this paper, we study the maximum possible number of distinct rational power factors in a finite word. A rational power is a word of the form $u=p^kp'$, where $p$ is a nonempty finite word, $k$ is…

Combinatorics · Mathematics 2026-05-15 Shuo Li , Yuan Song

The algebraic properties of formal power series, whose coefficients show factorial growth and admit a certain well-behaved asymptotic expansion, are discussed. It is shown that these series form a subring of $\mathbb{R}[[x]]$. This subring…

Combinatorics · Mathematics 2020-08-07 Michael Borinsky