Related papers: The Critical Exponent is Computable for Automatic …
Given a number field K, we consider families of critically separable rational maps of degree d over K possessing a certain fixed-point and multiplier structure. With suitable notions of isomorphism and good reduction between rational maps…
The celebrated Trakhtenbrot's theorem states that the set of finitely valid sentences of first-order logic is not computably enumerable. In this note we will extend this theorem by proving that the finite satisfiability problem of any…
We prove that there exists an exponent beyond which all continuous conventional powers of n-by-n doubly nonnegative matrices are doubly nonnegative. We show that this critical exponent cannot be less than $n-2$ and we conjecture that it is…
A word-to-word function is rational if it can be realized by a non-deterministic one-way transducer. Over finite words, it is a classical result that any rational function is regular, i.e. it can be computed by a deterministic two-way…
We define geometric critical exponents for systems that undergo continuous second order classical and quantum phase transitions. These relate scalar quantities on the information theoretic parameter manifolds of such systems, near…
Consider $k\ge 2$ distinct, linearly independent, homogeneous linear recurrences of order $k$ satisfying the same recurrence relation. We prove that the recurrences are related to a decomposable form of degree $k$, and there is a very broad…
We give a criterion for the Kac conjecture asserting that the free term of the polynomial counting the absolutely indecomposable representations of a quiver over a finite field of given dimension coincides with the corresponding root…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
We introduce the notion of expandability in the context of automaton semigroups and groups: a word is k-expandable if one can append a suffix to it such that the size of the orbit under the action of the automaton increases by at least k.…
Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…
In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion…
We obtain an effective analytic formula, with explicit constants, for the number of distinct irreducible factors of a polynomial $f \in \mathbb{Z}[x]$. We use an explicit version of Mertens' theorem for number fields to estimate a related…
We revisit a technique of S. Lehr on automata and use it to prove old and new results in a simple way. We give a very simple proof of the 1986 theorem of Honkala that it is decidable whether a given k-automatic sequence is ultimately…
We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…
In the present paper and as an application of Roth's theorem concerning the rational approximation of algebraic numbers, we give a sufficient condition that will assure us that a sum, product and quotient of some series of positive rational…
We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…
Nondeterministic weighted automata are finite automata with numerical weights on transitions. They define quantitative languages L that assign to each word w a real number L(w). The value of an infinite word w is computed as the maximal…
We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.
We determine the critical exponent and the recurrence function of complementary symmetric Rote sequences. The formulae are expressed in terms of the continued fraction expansions associated with the S-adic representations of the…
We present a sharp upper bound for the number of generators of a finite group in terms of the ratio between the order and the exponent.