Related papers: Noncommutative rational P\'olya series

We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…

We consider the Noether's problem on the noncommutative real rational functions invariant under the linear action of a finite group. For abelian groups the invariant skew-fields are always rational. We show that for a solvable group the…

Let $\Delta$ be a finite set of nonzero linear forms in several variables with coefficients in a field $\mathbf K$ of characteristic zero. Consider the $\mathbf K$-algebra $R(\Delta)$ of rational functions on V which are regular outside…

We show that a formal power series in $2N$ non-commuting indeterminates is a positive non-commutative kernel if and only if the kernel on $N$-tuples of matrices of any size obtained from this series by matrix substitution is positive. We…

We study point modules of monomial algebras associated with symbolic dynamical systems, parametrized by proalgebraic varieties which 'linearize' the underlying dynamical systems. Faithful point modules correspond to transitive sub-systems,…

The set of formal power series with coefficients in an associative but noncommutative algebra becomes a loop with the substitution product. We initiate the study of this loop by describing certain Lie and Sabinin algebras related to it.…

We study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted…

We show the existence of classes of non-tiling domains satisfying P\'{o}lya's conjecture in any dimension, in both the Euclidean and non-Euclidean cases. This is a consequence of a more general observation asserting that if a domain…

In 1923 Schur considered the following problem. Let f(X) be a polynomial with integer coefficients that induces a bijection on the residue fields Z/pZ for infinitely many primes p. His conjecture, that such polynomials are compositions of…

Adopting the approach of [7] we study rational function carrying invariant line fields on the Julia set. In particular, we show that under certain weak conditions all possible measurable invariant line fields of a rational function on its…

We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…

We define and prove limit results for a class of dominant P\'olya sequences, which are randomly reinforced urn processes with color-specific random weights and unbounded number of possible colors. Under fairly mild assumptions on the…

This text, Chapter 23 in the "AutoMathA" handbook, is devoted to the study of rational subsets of groups, with particular emphasis on the automata-theoretic approach to finitely generated subgroups of free groups. Indeed, Stallings'…

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

The original Hilbert and P\'olya conjecture is the assertion that the non-trivial zeros of the Riemann zeta function can be the spectrum of a self-adjoint operator. So far no such operator was found. However the suggestion of Hilbert and…

We give a new proof of Fatou's theorem: {\em if an algebraic function has a power series expansion with bounded integer coefficients, then it must be a rational function.} This result is applied to show that for any non--trivial completely…

In this paper we introduce a class of noncommutative (finitely generated) monomial algebras whose Hilbert series are algebraic functions. We use the concept of graded homology and the theory of unambiguous context-free grammars for this…

Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…

The no invariant line fields conjecture is one of the main outstanding problems in traditional complex dynamics. In this paper we consider non-autonomous iteration where one works with compositions of sequences of polynomials with suitable…

Unambiguous automata are nondeterministic automata in which every word has at most one accepting run. In this paper we give a polynomial-time algorithm for model checking discrete-time Markov chains against \omega-regular specifications…