Related papers: The isomorphism problem for finitely generated bi-…
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…
Every left-invariant ordering of a group is either discrete, meaning there is a least element greater than the identity, or dense. Corresponding to this dichotomy, the spaces of left, Conradian, and bi-orderings of a group are naturally…
The paper describes the algebraic structure of the graded algebra of differentially homogeneous polynomials of fixed finite order. We show that it is a finitely generated algebra, and we exhibit a minimal set of generators. Along the way,…
We consider spatial discretizations by the finite section method of the restricted group algebra of a finitely generated discrete group, which is represented as a concrete operator algebra via its left-regular representation. Special…
We develop a new method to compute the homology groups of finite topological spaces (or equivalently of finite partially ordered sets) by means of spectral sequences giving a complete and simple description of the corresponding…
We construct a finitely presented group with infinitely many non-homeomorphic asymptotic cones. We also show that the existence of cut points in asymptotic cones of finitely presented groups does, in general, depend on the choice of scaling…
We prove that the finitely generated simple left orderable groups constructed by the second author with Hyde have vanishing second bounded cohomology, both with trivial real and trivial integral coefficients. As a consequence, these are the…
A survey article that presents some recent algebraic and model-theoretic results on the automorphism groups of relatively free groups of infinite rank. The topics include topological aspects, generating sets, descripition of automorpisms…
Theories of classification distinguish classes with some good structure theorem from those for which none is possible. Some classes (dense linear orders, for instance) are non-classifiable in general, but are classifiable when we consider…
In this note we characterise all finitely generated groups elementarily equivalent to a solvable Baumslag-Solitar group BS$(1,n)$. It turns out that a finitely generated group $G$ is elementarily equivalent to BS$(1,n)$ if and only if $G$…
In this note, we analyze the classification problem for compact metrizable $G$-ambits for a countable discrete group $G$ from the point of view of descriptive set theory. More precisely, we prove that the topological conjugacy relation on…
We start with observing that the only connected finite dimensional algebras with finitely many isomorphism classes of indecomposable bimodules are the quotients of the path algebras of uniformly oriented $A_n$-quivers modulo the radical…
We study the complexity with respect to Borel reducibility of the relations of isometry and isometric embeddability between ultrametric Polish spaces for which a set $D$ of possible distances is fixed in advance. These are, respectively, an…
A long standing open problem in the theory of hyperfinite equivalence relations asks if the orbit equivalence relation generated by a Borel action of a countable amenable group is hyperfinite. In this paper we show that this question has a…
We study certain countable locally finite groups attached to minimal homeomorphisms, and prove that the isomorphism relation on simple, countable, locally finite groups is a universal relation arising from a Borel $S_\infty$-action. This…
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 construct examples of finitely generated infinite simple groups of homeomorphisms of the real line. Equivalently, these are examples of finitely generated simple left (or right) orderable groups. This answers a well known open question…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
An l-group G is an abelian group equipped with a translation invariant lattice order. Baker and Beynon proved that G is finitely generated projective iff it is finitely presented. A unital l-group is an l-group G with a distinguished order…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…