English
Related papers

Related papers: Linear recurrences and rational Lambert series

200 papers

Let $\Gamma$ be a lattice in a simply connected nilpotent Lie group $G$. Given an infinite measure preserving action $T$ of $\Gamma$ and a "direction" in $G$ (i.e. an element $\theta$ of the projective space $P(\goth g)$ of the Lie algebra…

Dynamical Systems · Mathematics 2016-02-17 Alexandre I. Danilenko

Let ${\mathscr G}$ be a linear algebraic group over $k$, where $k$ is an algebraically closed field, a pseudo-finite field or the valuation ring of a nonarchimedean local field. Let $G= {\mathscr G}(k)$. We prove that if $\gamma, \delta\in…

Group Theory · Mathematics 2024-11-20 Benjamin Martin

We revisit an unpublished paper of Vervoort (2002) on the once reinforced random walk, and prove that this process is recurrent on any graph of the form $\mathbb{Z}\times \Gamma$, with $\Gamma$ a finite graph, for sufficiently large…

Probability · Mathematics 2018-07-20 Daniel Kious , Bruno Schapira , Arvind Singh

We substantially apply the Li criterion for the Riemann hypothesis to hold. Based upon a series representation for the sequence \{\lambda_k\}, which are certain logarithmic derivatives of the Riemann xi function evaluated at unity, we…

Mathematical Physics · Physics 2009-11-11 Mark W. Coffey

For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…

Commutative Algebra · Mathematics 2025-06-18 Martin Kreuzer , Florian Walsh

We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…

Combinatorics · Mathematics 2019-01-16 Richard P. Stanley

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

Logic in Computer Science · Computer Science 2026-03-12 Ruiwen Dong , Doron Shafrir

Let $ \nu $ be a probability distribution over the linear semi-group $ \mathrm{End}(E) $ for $ E $ a finite dimensional vector space over a locally compact field. We assume that $ \nu $ is proximal, strongly irreducible and that $…

Probability · Mathematics 2025-02-14 Axel Péneau

Unlike in statistical compression, where Shannon's entropy is a definitive lower bound, no such clear measure exists for the compressibility of repetitive sequences. Since statistical entropy does not capture repetitiveness, ad-hoc measures…

Data Structures and Algorithms · Computer Science 2021-01-18 Tomasz Kociumaka , Gonzalo Navarro , Nicola Prezza

A Lambert series generating function is a special series summed over an arithmetic function $f$ defined by \[ L_f(q) := \sum_{n \geq 1} \frac{f(n) q^n}{1-q^n} = \sum_{m \geq 1} (f \ast 1)(m) q^m. \] Because of the way the left-hand-side…

Number Theory · Mathematics 2026-03-10 Maxie Dion Schmidt

Purpose: To develop the algebraic foundation of finite commutative ternary $\Gamma$-semirings by identifying their intrinsic invariants, lattice organization, and radical behavior that generalize classical semiring and $\Gamma$-ring…

Rings and Algebras · Mathematics 2026-02-06 Chandrasekhar Gokavarapu , D Madhusudhana Rao

A constant term sequence is a sequence of rational numbers whose $n$-th term is the constant term of $P^n(\boldsymbol{x}) Q(\boldsymbol{x})$, where $P(\boldsymbol{x})$ and $Q(\boldsymbol{x})$ are multivariate Laurent polynomials. While the…

Number Theory · Mathematics 2023-07-19 Alin Bostan , Armin Straub , Sergey Yurkevich

Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…

Number Theory · Mathematics 2012-04-24 Christophe Reutenauer

Let $\Gamma_1$ and $\Gamma_2$ be two lattices of finite covolume in a semisimple Lie group $G$. We prove a spectral rigidity result for the representation spectra of the right regular representations $L^2(\Gamma_1 \backslash G)$ and…

Representation Theory · Mathematics 2025-10-15 Chandrasheel Bhagwat , Kaustabh Mondal

We show that for any finite-rank free group $\Gamma$, any word-equation in one variable of length $n$ with constants in $\Gamma$ fails to be satisfied by some element of $\Gamma$ of word-length $O(\log (n))$. By a result of the first…

Group Theory · Mathematics 2023-08-31 Henry Bradford , Jakob Schneider , Andreas Thom

Linear Recurrence Sequences (LRS) are a fundamental mathematical primitive for a plethora of applications such as the verification of probabilistic systems, model checking, computational biology, and economics. Positivity (are all terms of…

Logic in Computer Science · Computer Science 2023-07-14 Mihir Vahanwala

We consider a family of nonlinear recurrences with the Laurent property. Although these recurrences are not generated by mutations in a cluster algebra, they fit within the broader framework of Laurent phenomenon algebras, as introduced…

Exactly Solvable and Integrable Systems · Physics 2017-05-17 A. N. W. Hone , C. Ward

In this paper, given a simple linear recurrence sequence of algebraic numbers, which has either a dominant characteristic root or exactly two characteristic roots of maximal modulus, we give some explicit lower bounds for the index beyond…

Number Theory · Mathematics 2018-10-03 Min Sha

We consider sequences of finitely generated discrete subgroups Gamma_i=rho_i(Gamma) of a rank 1 Lie group G, where the representations rho_i are not necessarily faithful. We show that, for algebraically convergent sequences (Gamma_i),…

Group Theory · Mathematics 2007-08-21 Michael Kapovich

We systematically investigate the complexity of model checking the existential positive fragment of first-order logic. In particular, for a set of existential positive sentences, we consider model checking where the sentence is restricted…

Logic in Computer Science · Computer Science 2015-03-20 Hubie Chen