Related papers: The isomorphism problem for finitely generated bi-…
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 investigate finite right-distributive binary algebraic structures called shelves. We first use symbolic computations with Python to classify (up to isomorphism) all connected shelves with order less than six. We explore the group…
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…
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…
We firstly show that due to their resplendency ordered henselian valued fields admit relative field quantifier elimination in the Denef--Pas language expanded by linear orders in the field and residue field sort. Secondly, we deduce from a…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We characterize the fundamental group of a locally finite graph G with ends combinatorially, as a group of infinite words. Our characterization gives rise to a canonical embedding of this group in the inverse limit of the (free) fundamental…
We investigate one question regarding bicrossed products of finite groups which we believe has the potential of being approachable for other classes of algebraic objects (algebras, Hopf algebras). The problem is to classify the groups that…
To each finitely generated group $G$, we associate a quasi-isometric invariant called the \emph{Dehn spectrum} of $G$. If $G$ is finitely presented, our invariant is closely related to the Dehn function of $G$, but provides more information…
In Finite Group Modular Representation Theory, the basic objects are the indecomposable and simple modules. This paper offers a new classification of these objects that refines the Green Theory Classification of indecomposable and simple…
We study the minor relation for algebra homomorphims in finitely generated quasivarieties that admit a logarithmic natural duality. We characterize the minor homomorphism posets of finite algebras in terms of disjoint unions of dual…
We construct discrete and faithful representations into the isometry group of a hyperbolic space of the fundamental groups of acute negatively curved even-sided polygons of finite groups.
Finite topological spaces are in bijective correspondence with preorders on finite sets. We undertake their study using combinatorial tools that have been developed to investigate general discrete structures. A particular emphasis will be…
Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…
We prove that the Borel space of torsion-free Abelian groups with domain $\omega$ is Borel complete, i.e., the isomorphism relation on this Borel space is as complicated as possible, as an isomorphism relation. This solves a long-standing…
We consider the conjugacy problem for the automorphism groups of a number of countable homogeneous structures. In each case we find the precise complexity of the conjugacy relation in the sense of Borel reducibility.
We study model geometries of finitely generated groups. If a finitely generated group does not contain a non-trivial finite rank free abelian commensurated subgroup, we show any model geometry is dominated by either a symmetric space of…
Bumagin-Wise posed the question of whether every countable group can be realised as the outer automorphism group of a finitely generated, residually finite group. We give a partial answer to this problem for recursively presentable groups.
We introduce a monoidal category whose morphisms are finite partial orders, with chosen minimal and maximal elements as source and target respectively. After recalling the notion of presentation of a monoidal category by the means of…
We give a uniform construction that, on input of a recursive presentation $P$ of a group, outputs a recursive presentation of a torsion-free group, isomorphic to $P$ whenever $P$ is itself torsion-free. We use this to re-obtain a known…