Related papers: Closure Properties in the Class of Multiple Contex…

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

Word maps in a group, an analogue of polynomials in groups, are defined by substitution of formal words. Lubotzky gave a characterization of the images of word maps in finite simple groups, and a consequence of his characterization is the…

We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…

It is shown that for graph groups (right-angled Artin groups) the conjugacy problem as well as a restricted version of the simultaneous conjugacy problem can be solved in polynomial time even if input words are represented in a compressed…

We show that the fundamental group of a geometrically clean graph of finite rank free groups does not need to be virtually compact special, answering a question of Wise. This implies that the class of the virtually VH-clean graphs of finite…

We give lower bounds on the complexity of the word problem of certain non-solvable groups: for a large class of non-solvable infinite groups, including in particular free groups, Grigorchuk's group and Thompson's groups, we prove that their…

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…

We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…

Over an algebraically closed field, various finiteness results are known regarding the automorphism group of a K3 surface and the action of the automorphisms on the Picard lattice. We formulate and prove versions of these results over…

A characterization is completed for finite groups acting arc-transitively on maps with square-free Euler characteristic, associated with infinite families of regular maps of square-free Euler characteristic presented. This is based on a…

We discuss in the context of finite extensions two classical theorems of Takahasi and Howson on subgroups of free groups. We provide bounds for the rank of the intersection of subgroups within classes of groups such as virtually free…

In this note, we show that a complete $k$-partite graph is the only graph with clique number $k$ among all degree-equivalent simple graphs. This result gives a lower bound on the clique number, which is sharper than existing bounds on a…

A large class of positive finite presentations of the braid groups is found and studied. It is shown that no presentations but known exceptions in this class have the property that equivalent braid words are also equivalent under positive…

We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

We unite elements of category theory, K-theory, and geometric group theory, by defining a class of groups called $k$-cube groups, which act freely and transitively on the product of $k$ trees, for arbitrary $k$. The quotient of this action…

We prove that the \emph{permutation closure} of a multiple context-free language is multiple context-free, which extends work of Okhotin and Sorokin [LATA 2020] who showed closure under \emph{cyclic shift}, and complements work of…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

We consider some questions about formal languages that arise when inverses of letters, words and languages are defined. The reduced representation of a language over the free monoid is its unique equivalent representation in the free group.…

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…