Related papers: On automatic subsets of the Gaussian integers
Pila and Tsimerman proved in 2017 that for every $k$ there exists at most finitely many $k$-tuples $(x_1,\ldots, x_k)$ of distinct non-zero singular moduli with the property "$x_1, \ldots,x_k$ are multiplicatively dependent, but any proper…
We give an efficient algorithm that, given a graph $G$ and a partition $V_1,\ldots,V_m$ of its vertex set, finds either an independent transversal (an independent set $\{v_1,\ldots,v_m\}$ in $G$ such that $v_i\in V_i$ for each $i$), or a…
Conditional independence in a multivariate normal (or Gaussian) distribution is characterized by the vanishing of subdeterminants of the distribution's covariance matrix. Gaussian conditional independence models thus correspond to algebraic…
We examine two counting problems that seem very group-theoretic on the surface but, on closer examination, turn out to concern integers with restrictions on their prime factors. First, given an odd prime $q$ and a finite abelian $q$-group…
This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not.…
The Gaussian moat problem asks whether it is possible to find an infinite sequence of distinct Gaussian prime numbers such that the difference between consecutive numbers in the sequence is bounded. In this paper, we have proved that the…
The paper gives a general condition on permutations, condition under which a semicircular matrix is free independent, or asymptotically free independent from the semicircular matrix obtained by permuting its entries. In particular, it is…
Let $E$ be an abelian scheme over a geometrically connected variety $X$ defined over $k$, a finitely generated field over $\mathbb{Q}$. Let $\eta$ be the generic point of $X$ and $x\in X$ a closed point. If $\mathfrak{g}_l$ and…
For every Turing machine, we construct an automaton group that simulates it. Precisely, starting from an initial configuration of the Turing machine, we explicitly construct an element of the group such that the Turing machine stops if, and…
Let A be a comodule algebra for a finite dimensional Hopf algebra K over an algebraically closed field k, and let A^K be the subalgebra of invariants. Let Z be a central subalgebra in A, which is a domain with quotient field Q. Assume that…
The set of modular invariants that can be obtained from Galois transformations is investigated systematically for WZW models. It is shown that a large subset of Galois modular invariants coincides with simple current invariants. For…
We prove that any $q$-automatic completely multiplicative function $f:\mathbb{N}\to\mathbb{C}$ essentially coincides with a Dirichlet character. This answers a question of J. P. Allouche and L. Goldmakher and confirms a conjecture of J.…
We study automaton groups without singular points, that is, points in the boundary for which the map that associates to each point its stabilizer, is not continuous. This is motivated by the problem of finding examples of infinite…
In the frame of Mahler's method for algebraic independence we show that the algebraic relations over Q linking the values of functions solutions of a system of functional equations come from the algebraic relations between the functions…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
Let K be a number field, let A be a finite dimensional semisimple K-algebra and let Lambda be an O_K-order in A. It was shown in previous work that, under certain hypotheses on A, there exists an algorithm that for a given (left)…
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
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…
Building on the seminal work of Gromov on endomorphisms of symbolic algebraic varieties [10], we introduce a notion of cellular automata over schemes which generalize affine algebraic cellular automata in [7]. We extend known results to…
We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…