Related papers: Strong amenability and the infinite conjugacy clas…

We prove for residually finite groups the following long standing conjecture: the number of twisted conjugacy classes of an automorphism of a finitely generated group is equal (if it is finite) to the number of finite dimensional…

A countable discrete group is said to be Frobenius stable if every function from the group to unitary matrices that is "almost multiplicative" in the Frobenius norm is "close" to a unitary representation in the Frobenius norm. The purpose…

Different notions of amenability on hypergroups and their relations are studied. Developing Leptin's theorem for discrete hypergroups, we characterize the existence of a bounded approximate identity for hypergroup Fourier algebras. We study…

We characterize the group property of being with infinite conjugacy classes (or icc, i.e. infinite and of which all conjugacy classes except {1} are infinite) for groups which are defined by an extension of groups. We give characterizations…

We study the connection between amenability, F{\o}lner conditions and the geometry of finitely generated semigroups. Using results of Klawe, we show that within an extremely broad class of semigroups (encompassing all groups, left…

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…

A word $w$ is said to be concise in a class of groups if, for every $G$ in that class such that the set of $w$-values $w\{G\}$ is finite, the verbal subgroup $w(G)$ is also finite. In the context of profinite groups, the notion of strong…

There are several graphs defined on groups. Among them we consider graphs whose vertex set consists conjugacy classes of a group $G$ and adjacency is defined by properties of the elements of conjugacy classes. In particular, we consider…

For a finite group $G$ and an element $x\in G$, the subset $$ nil_G(x)=\{y\in G \mid <x,y>~~ is ~~ nilpotent\}$$ is called nilpotentizer of $x$ in $G$. In this paper, we give two solvabilty criteria for a finite group by the structure and…

We show that if a countable group $G$ is the free product of infinite abelian groups, then for every free, probability-measure-preserving (p.m.p.) action of $G$, its orbit equivalence class is weakly dense in the space of p.m.p. actions of…

We generalize the notion of isoperimetric profiles of finitely generated groups to their actions by measuring the boundary of finite subgraphings of the orbit graphing. We prove that like the classical isoperimetric profiles for groups,…

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…

Let $G$ be a locally compact group. If $G$ is finite then the amenability constant of its Fourier algebra, denoted by ${\rm AM}({\rm A}(G))$, admits an explicit formula [Johnson, JLMS 1994]; if $G$ is infinite then no such formula for ${\rm…

We first show that every group-theoretical category is graded by a certain double coset ring. As a consequence, we obtain a necessary and sufficient condition for a group-theoretical category to be nilpotent. We then give an explicit…

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

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…

Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$.…

A p-group is called powerful if every commutator is a product of pth powers when p is odd and a product of fourth powers when p=2. In the group algebra of a group G of p-power order over a finite field of characteristic p, the group of…

A group is self-simulable if all its computable actions admit SFT covers, which means roughly that they can be implemented with finitely many tiling constraints. We prove that a graph product of infinite finitely-generated groups is…

In this paper we develop the theory of strongly singular subalgebras of von Neumann algebras, begun in earlier work. We mainly examine the situation of type $\tto$ factors arising from countable discrete groups. We give simple criteria for…