Related papers: Algorithmic and asymptotic properties of groups
We compute the expected number of commutations appearing in a reduced word for the longest element in the symmetric group. The asymptotic behavior of this value is analyzed and shown to approach the length of the permutation, meaning that…
We study topological group theoretic properties of algebraic groups over local fields. In particular, we find conditions under which such groups have closed images under arbitrary continuous homomorphisms into arbitrary topological groups.
This is a translation. I have added translations for (possibly) outdated definitions in an appendix at the end. In this paper, we define distributive groups and show some properties of them. We then concern ourselves with the homogeinity of…
The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…
The goal of this paper is to study primitive groups that are contained in the union of maximal (in the symmetric group) imprimitive groups. The study of types of permutations that appear inside primitive groups goes back to the origins of…
The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (a)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…
We extend the notions of "$R_\infty$-property" and "full (extended) Reidemeister spectrum" to finite groups in a meaningful way. We provide examples of finite groups admitting these properties, if they exist, by looking at groups of small…
We study, in the context of algorithmic randomness, the closed amenable subgroups of the symmetric group $S_\infty$ of a countable set. In this paper we address this problem by investigating a link between the symmetries associated with…
In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…
A statistic can be a function of multiple samples. There is little existing work on asymptotic theory for such statistics when group membership is random. We propose a flexible framework that can handle both deterministic and random…
In a recent paper, Bacher and de la Harpe study the conjugacy growth series of finitary permutation groups. In the course of studying the coefficients of a series related to the finitary alternating group, they introduce generalized…
We consider metric ultraproducts of finite groups with respect to some classes of length functions. All sofic groups embed into these ultraproducts. We study embeddings of normed groups. We also show that in some natural situations such an…
Suppose $\Gamma$ is an arithmetic group defined over a global field $K$, that the $K$-type of $\Gamma$ is $A_n$ with $n \geq 2$, and that the ambient semisimple group that contains $\Gamma$ as a lattice has at least two noncocompact…
Extensive and systematic machine computations are carried out to investigate the integral cohomology of the Euclidean Bianchi groups and their congruence subgroups. The collected data give insight on several aspects, including the…
We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…
A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…
The Hidden Subgroup Problem is used in many quantum algorithms such as Simon's algorithm and Shor's factoring and discrete log algorithms. A polynomial time solution is known in case of abelian groups, and normal subgroups of arbitrary…
By recognizing them as fundamental groups of developable complexes of groups we prove that mapping class groups of compact orientable surfaces have finite asymptotic dimension.
I introduce modal group theory, in which we study the category of all groups, considering embeddability as providing a notion of modal possibility. Using HNN extensions and Britton's lemma, I demonstrate that the modal language of groups is…
An extension of the finite and infinite Lie groups properties of complex numbers and functions of complex variable is proposed. This extension is performed exploiting hypercomplex number systems that follow the elementary algebra rules. In…