Related papers: Groups of type $FP$ via graphical small cancellati…
We arrange classical small cancellation constructions to produce left-orderable groups: we show that every finitely generated group is the quotient of a left-ordered small cancellation group by a finitely generated kernel (Rips…
For any finite group Q not of prime power order, we construct a group G that is virtually of type F, contains infinitely many conjugacy classes of subgroups isomorphic to Q, and contains only finitely many conjugacy classes of other finite…
We construct a CAT(0) group containing a finitely presented subgroup with infinitely many conjugacy classes of finite-order elements. Unlike previous examples (which were based on right-angled Artin groups) our ambient CAT(0) group does not…
We define a class of finite groups based on the properties of the closed twins of their power graphs and study the structure of those groups. As a byproduct, we obtain results about finite groups admitting a partition by cyclic subgroups.
Graphical small cancellation extends the classical small cancellation theory and provides a powerful method for constructing groups with interesting features. In the classical setting, C(3)-T(6) small cancellation complexes are known to…
Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…
The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…
We study the structure of the category of representations of $\mathbf{FA}$, the category of finite sets and all maps, mostly working over a field of characteristic zero. This category is not semi-simple and exhibits interesting features. We…
We study actions of (infinitely presented) graphical small cancellation groups on the Gromov boundaries of their coned-off Cayley graphs. We show that a class of graphical small cancellation groups, including (infinitely presented)…
The theory of small cancellation groups is well known. In this paper we introduce the notion of Group-like Small Cancellation Ring. This is the main result of the paper. We define this ring axiomatically, by generators and defining…
We use differential forms on loop spaces to prove that the fundamental group of certain geometric transformation groups is infinite. Examples include both finite and infinite dimensional Lie groups. The finite dimensional examples are the…
A finitely generated solvable group with unbounded iterated identity is constructed.
We describe a new approach towards the systematic construction of finite groups up to isomorphism. This approach yields a practical algorithm for the construction of finite solvable groups up to isomorphism. We report on a GAP…
We construct a hyperbolic group with a finitely presented subgroup, which has infinitely many conjugacy classes of finite-order elements. We also use a version of Morse theory with high dimensional horizontal cells and use handle…
We construct torsion-free hyperbolic groups without unique product whose subgroups up to some given finite index are themselves non-unique product groups. This is achieved by generalising a construction of Comerford to graphical small…
We introduce the factorization graph of a finite group and study its connectedness and forbidden structures. We characterize all finite groups with connected factorization graphs and classify those with connected bipartite factorization…
We propose a new cubical type theory, termed (self-deprecatingly) the naive cubical type theory, and study its semantics using the universe category framework, which is similar to Uemura's categories with representable morphisms. In…
We generalize type $A$ quivers to continuous type $A$ quivers and prove initial results about pointwise finite-dimensional (pwf) representations. We classify the indecomosable pwf representations and provide a decomposition theorem,…
We present a detailed description of a fundamental group algorithm based on Forman's combinatorial version of Morse theory. We use this algorithm in a classification problem of prime knots up to 14 crossings.
A pseudomodular group is a discrete subgroup $\Gamma \leq PGL(2,\mathbb{Q})$ which is not commensurable with $PSL(2,\mathbb{Z})$ and has cusp set precisely $\mathbb{Q}\cup\{\infty\}$. The existence of such groups was proved by Long and…