Related papers: Congruence subgroups of braid groups
Using generating functions, we enumerate regular semisimple conjugacy classes in the finite classical groups. For the general linear, unitary, and symplectic groups this gives a different approach to known results; for the special…
We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…
In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…
The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and super summit sets, provide effective…
We describe the fundamental groups of ordered and unordered $k-$point sets in the n-dimensional complex space $C^n$ generating an affine subspace of fixed dimension.
We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…
In this paper we introduce the framed pure braid group on $n$ strands of an oriented surface, a topological generalisation of the pure braid group $P_n$. We give different equivalents definitions for framed pure braid groups and we study…
We classify finite primitive permutation groups having a suborbit of length 5. As a corollary, we obtain a classification of finite vertex-primitive graphs of valency 5. In the process, we also classify finite almost simple groups that have…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very particular structure.…
Normal subgroups and there properties for finite and infinite iterated wreath products $S_{n_1}\wr \ldots \wr S_{n_m}$, $n, m \in \mathbb{N}$ are founded. The special classes of normal subgroups and there orders are investigated. Special…
In this paper we obtain significant bounds for the number of maximal subgroups of a given index of a finite group. These results allow us to give new bounds for the number of random generators needed to generate a finite $d$-generated group…
We determine a set of generators for the Brunnian braids on a general surface $M$ for $M\not=S^2$ or $\RP^2$. For the case $M=S^2$ or $\RP^2$, a set of generators for the Brunnian braids on $M$ is given by our generating set together with…
The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…
The notion of a braided chord diagram is introduced and studied. An equivalence relation is given which identifies all braidings of a fixed chord diagram. It is shown that finite-type invariants are stratified by braid index for knots which…
This article presents the construction of finitely generated branch groups with uncountably many maximal subgroups using embedding techniques. This addresses a question posed by Grigorchuk.
We show the boundedness of finite subgroups in any anisotropic reductive algebraic group over a perfect field that contains all roots of 1. Also, we provide explicit bounds for orders of finite subgroups of automorphism groups of…
Given a semisimple group over a local field of residual characteristic p, its topological group of rational points admits maximal pro-p-subgroups. Quasi-split simply-connected semisimple groups can be described in the combinatorial terms of…
The phylogenetic semigroup on a graph generalizes the Jukes-Cantor binary model on a tree. Minimal generating sets of phylogenetic semigroups have been described for trivalent trees by Buczy\'nska and Wi\'sniewski, and for trivalent graphs…
For every group genetic code with finite number of generating and at most with one defining relation we introduce the braid group of this genetic code. This construction includes the braid group of Euclidean plane, the braid groups of…