相关论文: Finite automata and algebraic extensions of functi…
We develop Kummer theory for algebraic function fields in finitely many transcendental variables. We consider any finitely generated Kummer extension (possibly, over a cyclotomic extension) of an algebraic function field, and describe the…
Building over recent results, we expand the basic theory of algebraic extensions to the realm of superfields -a field with multivalued sum and product-, showing that every superfield has a (unique up to isomorphism) strong algebraic…
Let L be an infinite regular language on a totally ordered alphabet (A,<). Feeding a finite deterministic automaton (with output) with the words of L enumerated lexicographically with respect to < leads to an infinite sequence over the…
Building on the developments of many people including Evans, Greene, Katz, McCarthy, Ono, Roberts, and Rodriguez-Villegas, we consider period functions for hypergeometric type algebraic varieties over finite fields and consequently study…
The classical $q$-analogue of the integers was recently generalized by Morier-Genoud and Ovsienko to give $q$-analogues of rational numbers. Some combinatorial interpretations are already known, namely as the rank generating functions for…
We show how the combination of new "linearization" ideas in free probability theory with the powerful "realization" machinery -- developed over the last 50 years in fields including systems engineering and automata theory -- allows solving…
We introduce and study new versions of polylogarithms and a zeta function on a completion of $\mathbb F_q (x)$ at a finite place. The construction is based on the use of the Carlitz differential equations for $\mathbb F_q$-linear functions.
We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…
We define an extension of operator-valued positive definite functions from the real or complex setting to topological algebras, and describe their associated reproducing kernel spaces. The case of entire functions is of special interest,…
Model checking properties are often described by means of finite automata. Any particular such automaton divides the set of infinite trees into finitely many classes, according to which state has an infinite run. Building the full type…
Following up on a paper of Balamohan, Kuznetsov, and Tanny, we analyze a variant of Hofstadter's Q-sequence and show it is 2-automatic. An automaton computing the sequence is explicitly given.
We construct a new scheme of approximation of any multivalued algebraic function $f(z)$ by a sequence $\{r_{n}(z)\}_{n\in \mathbb{N}}$ of rational functions. The latter sequence is generated by a recurrence relation which is completely…
Prompted by an observation about the integral of exponential functions of the form $f(x)=\lambda e^{\alpha x}$, we investigate the possibility to exactly integrate families of functions generated from a given function by scaling or by…
We develop a theory of linear Mahler systems in several variables from the perspective of transcendence and algebraic independence, which also includes the possibility of dealing with several systems associated with sufficiently independent…
This work is devoted to the derivation of novel analytic results for special functions which are particularly useful in wireless communication theory. Capitalizing on recently reported series representations for the Nuttall $Q{-}$function…
We study the Horn problem in the context of algebraic codes on a smooth projective curve defined over a finite field, reducing the problem to the representation theory of the special linear group $SL(2,F_q)$. We characterize the…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
We introduce a measure called width, quantifying the amount of nondeterminism in automata. Width generalises the notion of good-for-games (GFG) automata, that correspond to NFAs of width 1, and where an accepting run can be built on-the-fly…
Motivated by Lang-Vojta's conjecture, we show that the set of dominant rational self-maps of an algebraic variety over a number field with only finitely many rational points in any given number field is finite by combining Amerik's theorem…
A mathematically rigorous Hamiltonian formulation for classical and quantum field theories is given. New results include clarifications of the structure of linear fields, and a plausible formulation for nonlinear fields. Many mathematical…