Related papers: F{\o}lner functions and the generic Word Problem f…
In the present paper our main objective is to extend the notion of $D$-sets in countable amenable groups and to discuss its connection with weak mixing for amenable group actions. Further we prove that *-notions are equivalent in the…
A new flavour of amenability for discrete semigroups is proposed that generalises group amenability and follows from a \Folner-type condition. Some examples are explored, to argue that this new notion better captures some essential ideas of…
In this paper, we show that there is a net for amenable transformation groups like F{\o}lner net for amenable groups and investigate amenability of a transformation group constructed by semidirect product of groups. We introduce inner…
Erling Folner proved that the amenability or nonamenability of a countable group depends on the complexity of its finite subsets. Complexity has three measures: maximum Folner ratio, optimal cooling function, and minimum cooling norm. Our…
This paper introduces iterated monodromy groups for transcendental functions and discusses them in the simplest setting, for post-singularly finite exponential functions. These groups are self-similar groups in a natural way, based on an…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
This is the first of a sequence of papers devoted to studying the link between the complexity of the Word Problem for a finitely generated recursively presented group $G$ and the isoperimetric functions of the finitely presented groups in…
Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…
We prove the following version of Milnor's theorem on solvable groups of exponential growth: A finitely generated solvable group which is not polycyclic contains an ascending HNN extension. Consequently, a finitely generated solvable group…
We prove a version of ergodic theorem for an action of an amenable group, where a F{\o} lner sequence needs not to be tempered. Instead, it is assumed that a function satisfies certain mixing condition.
We study amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and apply it to algebras associated with finitely generated groups. We show that a group G is amenable if and only if its group…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…
We introduce the subgroup identification problem, and show that there is a finitely presented group G for which it is unsolvable, and that it is uniformly solvable in the class of finitely presented locally Hopfian groups. This is done as…
Extensive amenability is a property of group actions which has recently been used as a tool to prove amenability of groups. We study this property and prove that it is preserved under a very general construction of semidirect products. As…
We prove that, if a discrete group $G$ is not inner amenable, then the unit group of the ring of operators affiliated with the group von Neumann algebra of $G$ is non-amenable with respect to the topology generated by its rank metric. This…
In this paper we study analogues of amenability for topological groups in the context of definable structures. We prove fixed point theorems for such groups. More importantly, we propose definitions for definable actions and continuous…
We formulate some problems and conjectures about semigroups of rational functions under composition. The considered problems arise in different contexts, but most of them are united by a certain relationship to the concept of amenability.
This paper continues math.GR/0608302's study of amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and applies it to graded algebras associated with finitely generated groups. Due to a…
The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…