Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1706.06470

Algebras of linear growth and the dynamical Mordell-Lang conjecture

Dmitri Piontkovski
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 the rationality of the Hilbert series of the algebra follows from the affirmative answer to Ufnarovski's question. Assuming that the ground field has a positive characteristic, we show that the answer to Ufnarovskii's question is positive if and only if the basic field is an algebraic extension of its prime subfield. Moreover, in the "only if" part we show that there exists a finitely presented graded algebra of linear growth with irrational Hilbert series. In addition, over an arbitrary infinite basic field, the set of Hilbert series of the quadratic algebras of linear growth with $5$ generators is infinite. Our approach is based on a connection with the dynamical Mordell--Lang conjecture. This conjecture describes the intersection of an orbit of an algebraic variety endomorphism with a subvariety. We show that the positive answer to Ufnarovski's question implies some known cases of the dynamical Mordell--Lang conjecture. In particular, the positive answer for a class of algebras is equivalent to the Skolem--Mahler--Lech theorem which says that the set of the zero elements of any linear recurrent sequence over a zero characteristic field is the finite union of several arithmetic progressions. In particular, the counter-examples to this theorem in the finite characteristic case give examples of algebras with irrational Hilbert series.

Explore related subjects

math.RA

Keep this discovery

BibTeXRIS

Dmitri Piontkovski. 2017-06-20. Algebras of linear growth and the dynamical Mordell-Lang conjecture. https://arxiv.org/abs/1706.06470

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

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗