Related papers: Automatic Abelian Complexities of Parikh-Collinear…
Inspired by Pansiot's work on substitutions, we prove a similar theorem for automorphisms of a free group F of finite rank: if a right-infinite word X represents an attracting fixed point of an automorphism of F, the subword complexity of X…
A two-dimensional finite automaton has a read-only input head that moves in four directions on a finite array of cells labelled by symbols of the input alphabet. A three-way two-dimensional automaton is prohibited from making upward moves,…
We prove that topologically isomorphic linear cellular automaton shifts are algebraically isomorphic. Using this, we show that two distinct such shifts cannot be isomorphic. We conclude that the automorphism group of a linear cellular…
We define a determinant on the group of automorphisms of non-trivial Severi-Brauer surfaces over a perfect field. Using the generators and relations, we extend this determinant to birational maps between Severi-Brauer surfaces. Using this…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and present two new practical algorithms for computing Euler…
We introduce a large class of mappings, called enriched contractions, which includes, amongst many other contractive type mappings, the Picard-Banach contractions and some nonexpansive mappings. We show that any enriched contraction has a…
Let $f: \mathbb{A}^2 \to \mathbb{A}^2$ be a polynomial automorphism of dynamical degree $\delta \geq 2$ over a number field $K$. (This is equivalent to say that $f$ is a polynomial automorphism that is not triangularizable.) Then we…
We prove that for any automorphism $\alpha$ of a free group F of finite rank, one can efficiently compute a basis of the fixed point subgroup Fix(\alpha).
Generalizing the idea of self-similar groups defined by Mealy automata, we itroduce the notion of a self-similar automaton and a self-similar group over a changing alphabet. We show that every finitely generated residually-finite group is…
Difference sets are subsets of a group satisfying certain combinatorial property with respect to the group operation. They can be characterized using an equality in the group ring of the corresponding group. In this paper, we exploit the…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
An equation to compute the dp-rank of any abelian group is given. It is also shown that its dp-rank, or more generally that of any one-based group, agrees with its Vapnik-Chervonenkis density. Furthermore, strong abelian groups are…
The central open question in Descriptive Complexity is whether there is a logic that characterizes deterministic polynomial time (PTIME) on relational structures. Towards this goal, we define a logic that is obtained from first-order logic…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…
We show that for any integer n and any field k of characteristic different from 2 there are at most finitely many isomorphism classes of quadratic morphisms from the projective line over k to itself with a finite postcritical orbit of size…
We derive an explicit formula for the Abelian complexity of infinite words associated with quadratic Parry numbers.
This thesis has three goals related to the automorphism groups of finite $p$-groups. The primary goal is to provide a complete proof of a theorem showing that, in some asymptotic sense, the automorphism group of almost every finite…
We study the correctness of automatic differentiation (AD) in the context of a higher-order, Turing-complete language (PCF with real numbers), both in forward and reverse mode. Our main result is that, under mild hypotheses on the primitive…