Related papers: Measuring cones and other thick subsets in free gr…
We study families of subsets of $\omega$ which are independent with respect to the asymptotic density $\mathsf{d}$. We show, for instance, that there exists a maximal $\mathsf{d}$-independent family $\mathcal{A}$ such that…
We introduce a new measure on regular languages: their nondeterministic syntactic complexity. It is the least degree of any extension of the `canonical boolean representation' of the syntactic monoid. Equivalently, it is the least number of…
In this paper we study the asymptotic behavior of the number of summands in tensor products of finite dimensional representations of affine (semi)group (super)schemes and related objects.
We show that whether loops can be shortcut in a group's Cayley graph depends on the choice of finite generating set. Our example is the direct product of two rank-2 free groups and a consequence is that this group has asymptotic cones with…
We show that for any monoid M, the family of languages accepted by M-automata (or equivalently, generated by regular valence grammars over M) is completely determined by that part of M which lies outside the maximal ideal. Hence, every such…
How do we measure genuine understanding in artificial cognitive systems? Current approaches face a measurement gap: probabilistic systems refine confidence gradually, practice-based systems compile knowledge through repeated execution, and…
We discuss formulas for the asymptotic growth rate of the number of summands in tensor powers in certain (finite or infinite) monoidal categories. Our focus is on monoidal categories with infinitely many indecomposable objects, with our…
We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…
Recently there has been a significant effort to handle quantitative properties in formal verification and synthesis. While weighted automata over finite and infinite words provide a natural and flexible framework to express quantitative…
We study asymptotic behavior of the dimensions of the homology groups of subgroups of finite index in finitely generated subgroups of pro-$p$ extension of centralizers of free pro-$p$ groups. We also prove group theoretic structure…
The Stallings construction for finitely generated subgroups of free groups is generalized by introducing the concept of Stallings section, which allows an eficient computation of the core of a Schreier graph based on edge folding. It is…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
We study monads in the (pseudo-)double category $\mathbf{KSW}(\mathcal{K})$ where loose arrows are Mealy automata valued in an ambient monoidal category $\mathcal{K}$, and the category of tight arrows is $\mathcal{K}$. Such monads turn out…
This paper seeks to build on the extensive connections that have arisen between automata theory, combinatorics on words, fractal geometry, and model theory. Results in this paper establish a characterization for the behavior of the fractal…
It is relatively easy to construct a finitely generated group with infinite asymptotic dimension: the restricted wreath product of $\mathbb{Z}$ by $\mathbb{Z}$ provides an example. In light of this, it becomes interesting to consider the…
Let $F$ be a finitely generated free group. We present an algorithm such that, given a subgroup $H\leqslant F$, decides whether $H$ is the fixed subgroup of some family of automorphisms, or family of endomorphisms of $F$ and, in the…
For any group, there is a natural (pseudo-)norm on the vector space B1 of real (group) 1-boundaries, called the stable commutator length norm. This norm is closely related to, and can be thought of as a relative version of, the Gromov…
We propose another interpretation of well-known derivatives computations from regular expressions, due to Brzozowski, Antimirov or Lombardy and Sakarovitch, in order to abstract the underlying data structures (e.g. sets or linear…
We explore the connections between automata, groups, limit spaces of self-similar actions, and tilings. In particular, we show how a group acting ``nicely'' on a tree gives rise to a self-covering of a topological groupoid, and how the…
This paper presents a linear prioritized local algorithm that computes large independent sets on a random $d$-regular graph with small and fixed degree $d$. We studied experimentally the independence ratio obtained by the algorithm when $ d…