Related papers: Subgroups of braid groups generated by Birman-Ko-L…
Let $F$ be a finitely generated free group. By using Bestvina-Handel theory, as well as some further improvements, the eigengroups of a given automorphism of $F$ (and its fixed subgroup among them) are globally analyzed and described. In…
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…
We analyze the structure of locally compact groups which can be built up from p-adic Lie groups, for p in a given set of primes. In particular, we calculate the scale function and determine tidy subgroups for such groups, and use them to…
We describe the block structure of finitely generated subgroups of branch groups with the so-called subgroup induction property, including the first Grigorchuk group $\mathcal{G}$ and the torsion GGS groups.
Let p be a prime number. We study the dimensions of Brauer constructions of Young and Young permutation modules with respect to p-subgroups of the symmetric groups. They depend only on partitions labelling the modules and the orbits of the…
We define invariants of words in arbitrary groups, measuring how letters in a word are interleaving, perfectly detecting the dimension series of a group. These are the letter-braiding invariants. On free groups, braiding invariants coincide…
We provide an elementary proof that subgroups of free groups are free via group actions.
Some curious structural similarities between a recent braid- and Hurwitz algebraic description of the unbroken internal symmetries for a single generations of Standard Model fermions were recently identified. The non-trivial braid groups…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
Given an arbitrary group $G$ we construct a semigroup of idempotents (band) $B_G$ with the property that the free idempotent generated semigroup over $B_G$ has a maximal subgroup isomorphic to $G$. If $G$ is finitely presented then $B_G$ is…
The structure of transformation semigroups on a finite set is analyzed by introducing a hierarchy of functions mapping subsets to subsets. The resulting hierarchy of semigroups has a corresponding hierarchy of minimal ideals, or kernels.…
We describe a procedure which verifies that a group given by generators and relators is word-hyperbolic. This procedure always works with a group which is word-hyperbolic, provided there is sufficient memory and time devoted to the problem.…
Hughes defined a class of groups that act as local similarities on compact ultrametric spaces. Guba and Sapir had previously defined braided diagram groups over semigroup presentations. The two classes of groups share some common…
Theoretical background and an implementation of the (p)-group generation algorithm by Newman and O'Brien are used to provide computational evidence of a new type of periodically repeating patterns in pruned descendant trees of finite…
In this paper we study Thurston's automaton on the braid groups via binary operations. These binary operations are obtained from the construction of this automaton. We study these operations and find some connections between them in a "skew…
The notion of chain groups of homeomorphisms of the interval was introduced by Kim, Koberda and Lodha as a generalization of Thompson's group $F$. In this paper, we study an $S^1$-version of chain groups: ring groups. We study the…
Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…
In this article we look into characterizing primitive groups in the following way. Given a primitive group we single out a subset of its generators such that these generators alone (the so-called primitive generators) imply the group is…
Let $G$ be a finite group and let $H$ be a proper subgroup of $G$ of minimal index. By applying an old result of Y. Berkovich, we provide a polynomial algorithm for computing $|G : H|$ for a permutation group $G$. Moreover, we find $H$…
We determine the image of the braid groups inside the Iwahori-Hecke algebras of type A, when defined over a finite field, in the semisimple case, and for suitably large (but controlable) order of the defining (quantum) parameter.