相关论文: Minimal presentation, finite quotients and lower c…

This article deals with the study of affine cactus groups from a combinatorial point of view. Those groups are extensions of cactus groups, which are related to braid and diagram groups and have gained an important place in many mathematics…

We prove that the lower central series of the cactus group associated with a non commutative Coxeter group never stabilizes. We also compute a minimal presentation in terms of generators for the cactus group associated with a finite Coxeter…

Cactus groups and their pure subgroups appear in various fields of mathematics and are currently attracting attention from diverse mathematical communities. They share similarities with both right-angled Coxeter groups and braid groups. In…

Following previous work on congruence subgroups and crystallographic braid groups, we study the lower central series of congruence braid groups related to the braid group $B_3$, showing in particular that corresponding quotients are almost…

A practical approach is proposed to construct short presentations for Euclidean crystallographic groups in terms of generators and relations. For our purposes a short presentation is the one with a small number of short relators for a given…

We derive a lower bound on the size of finite non-cyclic quotients of the braid group that is superexponential in the number of strands. We also derive a similar lower bound for nontrivial finite quotients of the commutator subgroup of the…

Cactus groups are traditionally defined based on symmetric groups, and pure cactus groups are particular subgroups of cactus groups. Mostovoy showed that pure cactus groups embed into right-angled Coxeter groups. We generalize this result…

Cactus doodles are combinatorial/geometric objects that are related to cactus groups in the same way as knots are related to braids. We define them in terms of local moves on plane curves, show that they can be obtained from elements of the…

In the paper it is proven that Carter subgroups of a finite group are conjugate. A complete classification of Carter subgroups in finite almost simple groups is also obtained.

This expository article revolves around the question to find short presentations of finite simple groups. This subject is one of the most active research areas of group theory in recent times. We bring together several known results on…

We describe various classes of infinitely presented groups that are condensation points in the space of marked groups. A well-known class of such groups consists of finitely generated groups admitting an infinite minimal presentation. We…

In this paper we give a description of the generators of the prime level congruence subgroups of braid groups. Also, we give a new presentation of the symplectic group over a finite field, and we calculate symmetric quotients of the prime…

In this expository paper, we discuss and compare the notions of braided and coboundary monoidal categories. Coboundary monoidal categories are analogues of braided monoidal categories in which the role of the braid group is replaced by the…

We construct a sequence of balanced finite presentations of the trivial group with two generators and two relators with the following property: The minimal number of relations required to demonstrate that a generator represents the trivial…

We describe the construction of a minimal presentation for the group of planar pure braids $\overline{P}_n$ on $n$ strands. The generators of this presentation are dual to the generators of the cohomology ring of $\overline{P}_n$ found by…

Cactus group is the fundamental group of the real locus of the Deligne-Mumford moduli space of stable rational curves. This group appears naturally as an analog of the braid group in coboundary monoidal categories. We define an action of…

The kernel of the natural projection of a graph product of groups onto their direct product is called the Cartesian subgroup of the graph product. This construction generalises commutator subgroups of right-angled Coxeter and Artin groups.…

Various descending chains of subgroups of a finite permutation group can be used to define a sequence of `basic' permutation groups that are analogues of composition factors for abstract finite groups. Primitive groups have been the…

Dinits, Karzanov and Lomonosov showed that the minimal edge cuts of a finite graph have the structure of a cactus, a tree-like graph constructed from cycles. Evangelidou and Papasoglu extended this to minimal cuts separating the ends of an…

In the paper we complete the classification of Carter subgroups in finite almost simple groups. In particular, we prove that Carter subgroups of every finite almost simple group are conjugate. Togeather with previous results by author and…