Related papers: Automatic Sequences and Curves over Finite Fields
A deterministic finite automaton in which every non-empty set of states occurs as the image of the whole state set under the action of a suitable input word is called completely reachable. We characterize such automata in terms of graphs…
We revisit the method of small subgraph conditioning, used to establish that random regular graphs are Hamiltonian a.a.s. We refine this method using new technical machinery for random $d$-regular graphs on $n$ vertices that hold not just…
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…
An automata network with $n$ components over a finite alphabet $Q$ of size $q$ is a discrete dynamical system described by the successive iterations of a function $f:Q^n\to Q^n$. In most applications, the main parameter is the interaction…
An algebraic system from a finite set $\Sigma$ of cardinality $k$ and an $n$-ary operation $f$ invertible in each argument is called an $n$-ary quasigroup of order $k$. An autotopy of an $n$-ary quasigroup $(\Sigma,f)$ is a collection…
Arithmetic-geometric mean sequences were already studied over real and complex numbers, and recently, Michael J. Griffin, Ken Ono, Neelam Saikia and Wei-Lun Tsai considered them over finite fields $\mathbb{F}_q$ such that $q \equiv 3 \pmod…
Using a geometric approach involving Riemann surface orbifolds, we provide lower bounds for the genus of an irreducible algebraic curve of the form $E_{A,B}:\, A(x)-B(y)=0$, where $A, B\in\mathbb C(z)$. We also investigate "series" of…
Let $\mathbb{F}_q$ be the finite field of order $q=p^h$ with $p>2$ prime and $h>1$, and let $\mathbb{F}_{\bar{q}}$ be a subfield of $\mathbb{F}_q$. From any two $\bar{q}$-linearized polynomials $L_1,L_2 \in \overline{\mathbb{F}}_q[T]$ of…
The zeta function of a curve over a finite field may be expressed in terms of the characteristic polynomial of a unitary symplectic matrix, called the Frobenius class of the curve. We compute the expected value of the trace of the n-th…
The gonality sequence $(\gamma_r)_{r\geq1}$ of a finite graph / metric graph / algebraic curve comprises the minimal degrees $\gamma_r$ of linear systems of rank $r$. For the complete graph $K_d$, we show that $\gamma_r = kd - h$ if…
Automata with monitor counters, where the transitions do not depend on counter values, and nested weighted automata are two expressive automata-theoretic frameworks for quantitative properties. For a well-studied and wide class of…
For any sequences $\mathbf{u}=\{u(n)\}_{n\geq0}, \mathbf{v}=\{v(n)\}_{n\geq0},$ we define $\mathbf{u}\mathbf{v}:=\{u(n)v(n)\}_{n\geq0}$ and $\mathbf{u}+\mathbf{v}:=\{u(n)+v(n)\}_{n\geq0}$. Let $f_i(x)~(0\leq i< k)$ be sequence polynomials…
Cellular automata are a fundamental computational model with applications in mathematics, computer science, and physics. In this work, we explore the study of cellular automata to cases where the universe is a group, introducing the concept…
We introduce a new geometric tool for analyzing groups of finite automata. To each finite automaton we associate a square complex. The square complex is covered by a product of two trees iff the automaton is bi-reversible. Using this method…
We study the group of automorphisms of the affine plane preserving some given curve, over any field. The group is proven to be algebraic, except in the case where the curve is a bunch of parallel lines. Moreover, a classification of the…
Under some hypotheses (symmetry, confluence), we enumerate all quadratically presented algebras, generated by creation and destruction operators, in which number operators exist. We show that these are algebras of bosons, fermions, their…
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…
The process algebra has been used successfully to provide a novel formulation of quantum mechanics in which non-relativistic quantum mechanics (NRQM) emerges as an effective theory asymptotically. The process algebra is applied here to the…
Recent algorithmic advances in algebraic automata theory drew attention to semigroupoids (semicategories). These are mathematical descriptions of typed computational processes, but they have not been studied systematically in the context of…
How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…