Related papers: Random Subgroups of Rationals
The goal of the present paper is to provide a systematic and comprehensive study of rational stochastic languages over a semiring K \in {Q, Q +, R, R+}. A rational stochastic language is a probability distribution over a free monoid…
In 2022, using methods from ergodic theory, Kra, Moreira, Richter, and Robertson resolved a longstanding conjecture of Erd\H{o}s about sumsets in large subsets of the natural numbers. In this paper, we extend this result to several…
Generative molecular design has moved from proof-of-concept to real-world applicability, as marked by the surge in very recent papers reporting experimental validation. Key challenges in explainability and sample efficiency present…
A group $G$ is called residually finite if for every non-trivial element $g \in G$, there exists a finite quotient $Q$ of $G$ such that the element $g$ is non-trivial in the quotient as well. Instead of just investigating whether a group…
The Gruenberg-Kegel graph of a group is the undirected graph whose vertices are those primes which occur as the order of an element of the group, and distinct vertices $p$, $q$ are joined by an edge whenever the group has an element of…
We prove that for a suitably nice class of random substitutions, their corresponding subshifts have automorphism groups that contain an infinite simple subgroup and a copy of the automorphism group of a full shift. Hence, they are…
In this work we employ machine learning to understand structured mathematical data involving finite groups and derive a theorem about necessary properties of generators of finite simple groups. We create a database of all 2-generated…
Transformer-based language models are effective but complex, and understanding their inner workings and reasoning mechanisms is a significant challenge. Previous research has primarily explored how these models handle simple tasks like name…
We develop the theory of algorithmic randomness for the space $A^G$ where $A$ is a finite alphabet and $G$ is a computable amenable group. We give an effective version of the Shannon-McMillan-Breiman theorem in this setting. We also extend…
For modules over group rings we introduce the following numerical parameter. We say that a module A over a ring R has finite r-generator property if each f.g. (finitely generated) R-submodule of A can be generated exactly by r elements and…
It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…
A group presentation is said to have rational growth if the generating series associated to its growth function represents a rational function. A long-standing open question asks whether the Heisenberg group has rational growth for all…
The number of subgroups and the number of cyclic subgroups are natural combinatorial invariants of a finite group. We investigate how restrictions on these quantities, together with the number of distinct prime divisors of $|G|$, enforce…
It is well-known that the existence of more than two ends in the sense of J.R. Stallings for a finitely generated discrete group $G$ can be detected on the cohomology group $\mathrm{H}^1(G,R[G])$, where $R$ is either a finite field, the…
The article defines and studies the genus of finite state deterministic automata (FSA) and regular languages. Indeed, a FSA can be seen as a graph for which the notion of genus arises. At the same time, a FSA has a semantics via its…
Simple methods permit to generalize the concepts of iteration and of recursive processes. We shall see briefly on several examples what these methods generate. In additive sequences, we shall encounter not only the golden or the silver…
Let $G$ be a finite subgroup of $GL_4(\bm{Q})$. The group $G$ induces an action on $\bm{Q}(x_1,x_2,x_3,x_4)$, the rational function field of four variables over $\bm{Q}$. Theorem. The fixed subfield…
We show that the finiteness length of an $S$-arithmetic subgroup $\Gamma$ in a noncommutative isotropic absolutely almost simple group $G$ over a global function field is one less than the sum of the local ranks of $G$ taken over the places…
By algorithmic metatheorems for a model checking problem P over infinite-state systems we mean generic results that can be used to infer decidability (possibly complexity) of P not only over a specific class of infinite systems, but over a…
In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…