Search arXivSearch

arXiv · 2508.00944

Positivity of Nearly Linearly Recurrent Sequences

Abstract

Nearly linear recurrences generalise linear recurrences and can be represented as special cases of both linear time-invariant systems in control theory and linear-constraint loops in program analysis. We formulate the Positivity Problem for such recurrences: given a recurrence and initial values, decide whether every sequence satisfying the recurrence is termwise nonnegative. This problem generalises Positivity for linear recurrence sequences and is a special case of halfspace non-reachability for linear time-invariant systems. Our main result is a decision procedure for order-2 recurrences. The termination of the procedure relies on a transcendence theorem of independent interest: we prove that certain convergent series obtained by summing the absolute values of terms of algebraic linear recurrence sequences are transcendental.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Amaury Pouly, Mahsa Shirmohammadi, James Worrell. 2026-07-26. Positivity of Nearly Linearly Recurrent Sequences. https://arxiv.org/abs/2508.00944

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS