Related papers: Subgroups of braid groups generated by Birman-Ko-L…
In this article we give a concept of ground subgroup for finite and countable groups. By our definition such a subgroup of a group depends on a given subset of the group and on a given partition of the subset. For finite and free groups we…
In this paper we parametrize the Teichm\"uller spaces of constructible Koebe groups, that is Kleinian group that arise as covering of $2-$orbifolds determined by certain normal subgroups of their fundamental groups. We also study the…
We describe an algorithm that computes the index of a finitely generated subgroup in a finitely $L$-presented group provided that this index is finite. This algorithm shows that the subgroup membership problem for finite index subgroups in…
Statistical and probabilistic characteristics of locally free group with growing number of generators are defined and their application to statistics of braid groups is given.
Let $G$ be a finite simple group of Lie type and let $P$ be a Sylow $2$-subgroup of $G$. In this paper, we prove that for any nontrivial element $x \in G$, there exists $g \in G$ such that $G = \langle P, x^g \rangle$. By combining this…
Let $G$ be a finite almost simple group. It is well known that $G$ can be generated by 3 elements, and in previous work we showed that 6 generators suffice for all maximal subgroups of $G$. In this paper we consider subgroups at the next…
In the study of Fuchsian groups, it is a nontrivial problem to determine a set of generators. Using a dynamical approach we construct for any cocompact arithmetic Fuchsian group a fundamental region in $\mathbf{SL}_2(\mathbb{R})$ from which…
We prove several new results on the structure of the subgroup generated by a small doubling subset of an ordered group, abelian or not. We obtain precise results generalizing Freiman's 3k-3 and 3k-2 theorems in the integers and several…
We give a description of elementary subgroups (in the sense of first-order logic) of finitely generated virtually free groups. In particular, we recover the fact that elementary subgroups of finitely generated free groups are free factors.…
For the elements of a numerical semigroup which are larger than the Frobenius number, we introduce the definition of, seed, by broadening the notion of generator. This new concept allows us to explore the semigroup tree in an alternative…
The background of this paper is the following: search of the minimal systems of generators for this class of group which still was not founded also problem of representation for this class of group, exploration of systems of generators for…
It is shown that a closed solvable subgroup of a connected Lie group is compactly generated. In particular, every discrete solvable subgroup of a connected Lie group is finitely generated. Generalizations to locally compact groups are…
We show that any two elements of the pure braid group either commute or generate a free group, settling a question of Luis Paris. Our proof involves the theory of 3-manifolds and the theory of group actions on trees.
The braid group appears in many scientific fields and its representations are instrumental in understanding topological quantum algorithms, topological entropy, classification of manifolds and so on. In this work, we study planer diagrams…
A definition of atomic codeword for a group code is presented. Some properties of atomic codewords of group codes are investigated. Using these properties, it is shown that every minimal tail-biting trellis for a group code over a finite…
We give a method to construct new self-adjoint representations of the braid group. In particular, we give a family of irreducible self-adjoint representations of dimension arbitrarily large. Moreover we give sufficient conditions for a…
An $f$-subgroup is a linear recurring sequence subgroup, a multiplicative subgroup of a field whose elements can be generated (without repetition) by a linear recurrence relation, with characteristic polynomial $f$. It is called…
The rank of a finite semigroup is the smallest number of elements required to generate the semigroup. A formula is given for the rank of an arbitrary (non necessarily regular) Rees matrix semigroup over a group. The formula is expressed in…
We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…