Related papers: Definable rank, o-minimal groups, and Wiegold's pr…

Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…

We continue our earlier study of finite dimensional definable groups in models of the the model companion of an o-minimal L-theory T expanded by a generic derivation as in [F-K]. We generalize Buium's notion of an algebraic D-group to…

We study the Diophantine problem (decidability of finite systems of equations) in different classes of finitely generated solvable groups (nilpotent, polycyclic, metabelian, free solvable, etc), which satisfy some natural…

We show that an infinite group is definable in any non trivial geometric $C$-minimal structure which is definably maximal and does not have any definable bijection between a bounded interval and an unbounded one in its canonical tree. No…

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 prove that the cohomology groups of a definably compact set over an o-minimal expansion of a group are finitely generated and invariant under elementary extensions and expansions of the language. We also study the cohomology of the…

A result of D. Segal states that every complex irreducible representation of a finitely generated nilpotent group $G$ is monomial if and only if $G$ is abelian-by-finite. A conjecture of A. N. Parshin, recently proved affirmatively by I.V.…

Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…

We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…

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…

We show that inductive limits of virtually nilpotent groups have strongly quasidiagonal C*-algebras, extending results of the first author on solvable virtually nilpotent groups. We use this result to show that the decomposition rank of the…

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…

We show that the derived subgroup of a linear definable group in an o-minimal structure is also definable, extending the semialgebraic case proved by A. Pillay. We also show the definability of the derived subgroup in case that the group is…

We answer in the affirmative a conjecture of Berarducci, Peterzil and Pillay \cite{BPP10} for solvable groups, which is an o-minimal version of a particular case of Milnor's isomorphism conjecture \cite{jM83}. We prove that every abstract…

We show that real semi-simple Lie groups of higher rank contain (infinitely generated) discrete subgroups with full limit sets in the corresponding Furstenberg boundaries. Additionally, we provide criteria under which discrete subgroups of…

We study groups and rings definable in d-minimal expansions of ordered fields. We generalize to such objects some known results from o-minimality. In particular, we prove that we can endow a definable group with a definable topology making…

In "On o-minimal homotopy groups", o-minimal homotopy was developed for the definable category, proving o-minimal versions of the Hurewicz theorems and the Whitehead theorem. Here, we extend these results to the category of locally…

We carry out a study of groups $G$ in which the index of any infinite subgroup is finite. We call them restricted-finite groups and characterize finitely generated not torsion restricted-finite groups. We show that every infinite…

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…

A subset S of a group G invariably generates G if G = <s^(g(s)) | s in S> for each choice of g(s) in G, s in S. In this paper we study invariable generation of infinite groups, with emphasis on linear groups. Our main result shows that a…