Related papers: Every finite non-solvable group admits an Oriented…

Let $G$ be a finite group. For $x \in G$, we define the solvabilizer of $x$ in $G$, denoted $sol_G(x)$, to be the set $\{g \in G \mid \langle g,x \rangle$ is solvable$\}$. A group $G$ is an S-group if $sol_G(x)$ is a subgroup of $G$ for…

Let $G$ be a group. The permutability graph of subgroups of $G$, denoted by $\Gamma(G)$, is a graph having all the proper subgroups of $G$ as its vertices, and two subgroups are adjacent in $\Gamma(G)$ if and only if they permute. In this…

Falbel, Koseleff and Rouillier computed a large number of boundary unipotent CR representations of fundamental groups of non compact three-manifolds. Those representations are not always discrete. By experimentally computing their limit…

Adyan and Rabin showed that most properties of groups cannot be algorithmically recognized from a finite presentation alone. We prove that, if one is also given a solution to the word problem, then the class of fundamental groups of closed,…

We show that a closed orientable 3--dimensional manifold admits a round fold map into the plane, i.e. a fold map whose critical value set consists of disjoint simple closed curves isotopic to concentric circles, if and only if it is a graph…

We show that a finite group which admits a faithful, smooth, orientation-preserving action on a homology 4-sphere, and in particular on the 4-sphere, is isomorphic to a subgroup of the orthogonal group SO(5), by explicitly determining the…

A finitely generated group admits a decomposition, called its Grushko decomposition, into a free product of freely indecomposable groups. There is an algorithm to construct the Grushko decomposition of a finite graph of finite rank free…

We refer to the set of the orders of elements of a finite group as its spectrum and say that finite groups are isospectral if their spectra coincide. In the paper we determine all finite groups isospectral to the simple groups $S_6(q)$,…

We construct an infinite finitely generated recursively presented residually finite algorithmically finite group $G$ answering thereby a question of Myasnikov and Osin. Moreover, $G$ is "very infinite" and "very algorithmically finite" in…

Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…

We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…

The spectra of a finite group is the set of its element orders. We obtain an arithmetic description of finite symplectic and orthogonal groups. In particular, a description of spectra of all finite simple simplectic and orthogonal groups is…

Let $d \geq 2$ be an integer. We conjecture that there is a finitely generated perfect group whose homomorphic images include all finite $d$-generated perfect groups. We prove a special case of this conjecture for the finite perfect groups…

We address the problem of finding necessary and sufficient conditions for an arbitrary group, not necessarily finite, to admit a faithful irreducible representation over an arbitrary field.

We give examples of closed orientable graph 3-manifolds with fundamental group which is not a subgroup of GL(4,k) for any field k. This answers a question in the Kirby problem list from 1977 which is credited to the late William Thurston.

Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…

Let $K_{m[n]}$ be the complete multipartite graph with $m$ parts, while each part contains $n$ vertices. The orientably-regular embeddings of complete graphs $K_{m[1]}$ have been determined by Biggs (1971) \cite{Big1}, James and Jones…

This is the third and last of three papers containing the complete proof that all finitely presented groups are QSF.

We show that a group admits a planar, finitely generated Cayley graph if and only if it admits a special kind of group presentation we introduce, called a planar presentation. Planar presentations can be recognised algorithmically. As a…

We present a description of non-solvable groups in which all real irreducible character degrees are prime-power numbers.