Related papers: Measuring cones and other thick subsets in free gr…
We study subsets $E$ of finitely generated groups where the set of all words over a given finite generating set that lie in $E$ forms a context-free language. We call these sets recognisably context-free. They are invariant of the choice of…
The identification of a deterministic finite automaton (DFA) from labeled examples is a well-studied problem in the literature; however, prior work focuses on the identification of monolithic DFAs. Although monolithic DFAs provide accurate…
In this paper we characterize the congruence associated to the direct sum of all irreducible representations of a finite semigroup over an arbitrary field, generalizing results of Rhodes for the field of complex numbers. Applications are…
Clean markings on surfaces were a key component in Masur and Minsky's hierarchy machinery, which proved to be a powerful tool in the study of mapping class groups. We construct a marking graph for irreducible finite-type Artin groups which…
We offer a criterion for showing that the automorphism group of an ultrahomogeneous structure is topologically 2-generated and even has a cyclically dense conjugacy class. We then show how finite topological rank of the automorphism group…
We determine the asymptotics of the independence number of the random $d$-regular graph for all $d \ge d_0$. It is highly concentrated, with constant-order fluctuations around $n\alpha_* - c_*\log n$ for explicit constants $\alpha_*(d)$ and…
This paper provides a unified framework for analyzing tensor estimation problems that allow for nonlinear observations, heteroskedastic noise, and covariate information. We study a general class of high-dimensional models where each…
The goal of the paper is to automatize the selection of mechanisms which are able to describe a set of measurements. In order to do so first we construct a set of possible mechanism fulfilling chemically reasonable requirements with a given…
We give a conjecture for the asymptotic growth rate of the number of indecomposable summands in the tensor powers of representations of finite monoids, expressing it in terms of the (Brauer) character table of the monoid's group of units.…
We introduce the notions of topological entropy of a formal language and of a topological automaton. We show that the entropy function is surjective and bound the entropy of languages accepted by deterministic {\epsilon}-free push-down…
We introduce group crosscoders, an extension of crosscoders that systematically discover and analyse symmetrical features in neural networks. While neural networks often develop equivariant representations without explicit architectural…
Takahasi's theorem on chains of subgroups of bounded rank in a free group is generalized to several classes of semigroups. As an application, it is proved that the subsemigroups of periodic points are finitely generated and periodic orbits…
A general method is presented for deriving the limiting behavior of estimators that are defined as the values of parameters optimizing an empirical criterion function. The asymptotic behavior of such estimators is typically deduced from…
We prove various estimates for the asymptotics of counting functions associated to point sets of coherent frames and Riesz sequences. The obtained results recover the necessary density conditions for coherent frames and Riesz sequences for…
In repeated Measure Designs with multiple groups, the primary purpose is to compare different groups in various aspects. For several reasons, the number of measurements and therefore the dimension of the observation vectors can depend on…
For an arbitrary group $G$ and arbitrary set $A$, we define a monoid structure on the set of all uniformly continuous functions $A^G\to A$ and then we show that it is naturally isomorphic to the monoid of cellular automata $\mathrm{CA}(G,…
We describe all finite subsemigroups of a free left regular band of infinite rank. Moreover, we show applications of this result in algebraic geometry and model theory.
Convex rank tests are partitions of the symmetric group which have desirable geometric properties. The statistical tests defined by such partitions involve counting all permutations in the equivalence classes. Each class consists of the…
We study the class of monoids that arise as the submonoid of right units of finitely presented special inverse monoids (SIMs). Gray and Ru\v{s}kuc (2024) gave the first example of a finitely presented SIM whose submonoid of right units does…
Using combinatorial properties of incomplete sets in a free monoid we construct a series of n-state deterministic automata with zero whose shortest synchronizing word has length n^2/4+n/2-1.