相关论文: A Skolem-Mahler-Lech Theorem in Positive Character…

The Skolem-Mahler-Lech theorem states that if $f(n)$ is a sequence given by a linear recurrence over a field of characteristic 0,then the set of $m$ such that $f(m)$ is equal to 0 is the union of a finite number of arithmetic progressions…

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros of a linear recurrence sequence is the union of a finite set and finitely many arithmetic progressions. The corresponding computational question, the Skolem Problem,…

The Skolem Problem asks, given an integer linear recurrence sequence (LRS), to determine whether the sequence contains a zero term or not. Its decidability is a longstanding open problem in theoretical computer science and automata theory.…

Let $K$ be a field of characteristic zero and suppose that $f:\mathbb{N}\to K$ satisfies a recurrence of the form $$f(n)\ =\ \sum_{i=1}^d P_i(n) f(n-i),$$ for $n$ sufficiently large, where $P_1(z),...,P_d(z)$ are polynomials in $K[z]$.…

This paper proves a commutative algebraic extension of a generalized Skolem-Mahler-Lech theorem due to the first author. Let $A$ be a finitely generated commutative $K$-algebra over a field of characteristic $0$, and let $\sigma$ be a…

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…

The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…

The Skolem Problem asks to determine whether a given integer linear recurrence sequence has a zero term. This problem arises across a wide range of topics in computer science, including loop termination, formal languages, automata theory,…

Let $K$ be a field of characteristic $p>0$ and let $f(t_1,...,t_d)$ be a power series in $d$ variables with coefficients in $K$ that is algebraic over the field of multivariate rational functions $K(t_1,...,t_d)$. We prove a generalization…

The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) has a zero term. Showing decidability of this problem is equivalent to giving an effective proof of the Skolem-Mahler-Lech Theorem, which asserts that a…

Ufnarovski remarked in 1990 that it is unknown whether any finitely presented associative algebra of linear growth is automaton, that is, whether the set of normal words in the algebra form a regular language. If the algebra is graded, then…

We propose a new definition of effective formulas for problems in enumerative combinatorics. We outline the proof of the fact that every linear recurrence sequence of integers has such a formula. It follows from a lower bound that can be…

In 1990, Ku. Nishioka proved a fundamental theorem for Mahler's method, which is the analog of the Siegel-Shidlovskii theorem for Mahler functions. In this article, we establish a version of the theorem of Ku. Nishioka which is also valid…

The classical Hermite-Biehler theorem describes possible zero sets of complex linear combinations of two real polynomials whose zeros strictly interlace. We provide the full characterization of zero sets for the case when this interlacing…

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…

In this paper we study the Lefschetz properties of monomial complete intersections in positive characteristic. We give a complete classification of the strong Lefschetz property when the number of variables is at least three, which proves a…

We show that in a parametric family of linear recurrence sequences $a_1(\alpha) f_1(\alpha)^n + \ldots + a_k(\alpha) f_k(\alpha)^n$ with the coefficients $a_i$ and characteristic roots $f_i$, $i=1, \ldots,k$, given by rational functions…

We show that only a rather small proportion of linear equations are solvable in elements of a fixed finitely generated subgroup of a multiplicative group of a number field. The argument is based on modular techniques combined with a…

In this work we extend our study on a link between automaticity and certain algebraic power series over finite fields. Our starting point is a family of sequences in a finite field of characteristic $2$, recently introduced by the first…

We prove that every Mahler series, over a field of characteristic $0$, with multiplicative coefficients is regular in the sense of Allouche and Shallit. We also obtain an explicit characterization of such series. This yields a joint…