Related papers: Solubility of groups can be characterized by confi…
In this paper we define countable-configuration of groups and prove that two Hopfian groups with the same set of countable-configurations are isomorphic and vice versa. We also study the countable paradoxical decomposition of groups. It is…
We introduce the notion of uniform exactness, or uniform amenability at infinity, for discrete groups and prove it for a wide class of groups containing free groups and their limit groups. This shows a novel strong convergence phenomenon…
The ordinary Structure Identity Principle states that any property of set-level structures (e.g., posets, groups, rings, fields) definable in Univalent Foundations is invariant under isomorphism: more specifically, identifications of…
We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…
We introduce the concepts of a pair of valuations and a good generating set and show how they can be used to prove geometric properties of soluble groups.
Let $G$ be a finitely presented group. A new complexity called \textit{Karoubi-Weibel complexity} or \textit{covering type}, is defined for $G$. The construction is inspired by recent work of Karoubi and Weibel \cite{KW}, initially applied…
Different group structures which underline the integrable systems are considered. In some cases, the quantization of the integrable system can be provided with substituting groups by their quantum counterparts. However, some other group…
This is the third in a series math.AG/0312190, math.AG/0503029, math.AG/0410268 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration (\sigma,\iota,\pi) is a finite collection of…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
We give a characterization of connected solvable groups in terms of the existence of representations with certain geometric properties. The existence of such representations for the group of upper triangular matrices played an important…
It has been known since \cite{Pgroupchunk} that any group definable in an $o$-minimal expansion of the real field can be equipped with a Lie group structure. It is therefore natural to ask when is a Lie group Lie isomorphic to a group…
Brandenburger, Friedenberg, and Keisler provide an epistemic characterization of iterated admissibility (i.e., iterated deletion of weakly dominated strategies) where uncertainty is represented using LPSs (lexicographic probability…
We define a relative property A for a countable group with respect to a finite family of subgroups. Many characterizations for relative property A are given. In particular a relative bounded cohomological characterization shows that if a…
This is the fourth in a series of papers math.AG/0312190, math.AG/0503029, math.AG/0410267 on configurations in an abelian category A. Given a finite partially ordered set (I,<), an (I,<)-configuration is a finite collection of objects and…
Classification is an important goal in many branches of mathematics. The idea is to describe the members of some class of mathematical objects, up to isomorphism or other important equivalence in terms of relatively simple invariants. Where…
This exploratory paper considers the notion of a covering of a configuration and $G$-coverings which are coverings that are quotients under a semi-regular group action. We consider prime configurations, those which cannot $G$-cover other…
We consider interpretable topological spaces and topological groups in a $p$-adically closed field $K$. We identify a special class of "admissible topologies" with topological tameness properties like generic continuity, similar to the…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
Combinatorial design theory studies set systems with certain balance and symmetry properties and has applications to computer science and elsewhere. This paper presents a modular approach to formalising designs for the first time using…
In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.