English
Related papers

Related papers: The Dixmier problem, lamplighters and Burnside gro…

200 papers

We study uniform perturbations of crossed product C$^*$-algebras by amenable groups. Given a unital inclusion of C$^*$-algebras $C\subseteq D$ and sufficiently close separable intermediate C$^*$-subalgebras $A$, $B$ for this inclusion with…

Operator Algebras · Mathematics 2016-04-13 Shoji Ino

By studying the so-called traveling salesman groups, we obtain a new metric criterion for non-amenability. As an application, we give a new and very short proof of non-amenability of free Burnside groups with sufficiently big odd exponent.

Group Theory · Mathematics 2009-03-02 Azer Akhmedov

We consider a problem whether a given Lie group can be realized as the group of all biholomorphic automorphisms of a bounded domain in ${\mathbb C}^n$. In an earlier paper of 1990, we proved the result for connected linear Lie groups. In…

Complex Variables · Mathematics 2025-01-14 George Shabat , Alexander Tumanov

We prove that the lamplighter group admits an injective Lipschitz map to any finitely generated metabelian group which is not virtually nilpotent. This implies that finitely generated metabelian groups satisfy the ``analytically…

Group Theory · Mathematics 2024-01-17 Antoine Gournay , Corentin Le Coz

This paper describes problems concerning the range of cardinalities of sumsets and restricted sumsets of finite subsets of the integers and finite subsets of ordered abelian groups.

Number Theory · Mathematics 2025-10-28 Melvyn B. Nathanson

We explore the properties of non-piecewise syndetic sets with positive upper density, which we call "discordant", in countably infinite amenable (semi)groups. Sets of this kind are involved in many questions of Ramsey theory and manifest…

Combinatorics · Mathematics 2022-04-12 Vitaly Bergelson , Jake Huryn , Rushil Raghavan

We consider the domino problem on Schreier graphs of self-similar groups, and more generally their monadic second-order logic. On the one hand, we prove that if the group is bounded then the graph's monadic second-order logic is decidable.…

Group Theory · Mathematics 2020-11-06 Laurent Bartholdi

We prove that there exists a finitely generated group that satisfies a group law with probability 1 but does not satisfy any group law. More precisely, we construct a finitely generated group G in which the probability that a random element…

Group Theory · Mathematics 2023-08-11 Gil Goffer , Be'eri Greenfeld

We prove that amenability of a unitary co-representation $U$ of a locally compact quantum group passes to unitary co-representations that weakly contain $U$. This generalizes a result of Bekka, and answers affirmatively a question of…

Operator Algebras · Mathematics 2017-05-30 Chi-Keung Ng , Ami Viselter

In the case of p-adic general linear groups, each irreducible representation is parabolically induced by a tensor product of irreducible representations supported by cuspidal lines. One gets in this way a parameterization of the irreducible…

Representation Theory · Mathematics 2020-10-30 Marko Tadic

In various occasions the conjugacy problem in finitely generated amalgamated products and HNN extensions can be decided efficiently for elements which cannot be conjugated into the base groups. This observation asks for a bound on how many…

Group Theory · Mathematics 2016-05-09 Volker Diekert , Alexei G. Myasnikov , Armin Weiß

We exhibit abelian topological groups admitting no nontrivial strongly continuous irreducible representations in Banach spaces. Among them are some abelian Banach-Lie groups and some monothetic subgroups of the unitary group of a separable…

funct-an · Mathematics 2008-02-03 Vladimir Pestov

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…

Functional Analysis · Mathematics 2016-02-29 Mahmood Alaghmandan

In this paper, we study a family of finitely generated elementary amenable iet-groups. These groups are generated by finitely many rationals iets and rotations. For them, we state criteria for not virtual nilpotency or solvability, and we…

Group Theory · Mathematics 2026-02-02 Nancy Guelman , Isabelle Liousse

We construct an embedding of a free Burnside group $B(m,n)$ of odd $n > 2^{48}$ and rank $m >1$ in a finitely presented group with some special properties. The main application of this embedding is an easy construction of finitely presented…

Group Theory · Mathematics 2007-05-23 S. V. Ivanov

For numerous applications of quantum theory it is desirable to be able to apply arbitrary unitary operations on a given quantum system. However, in particular situations only a subset of unitary operations is easily accessible. This raises…

Quantum Physics · Physics 2017-12-06 Michał Oszmaniec , Zoltán Zimborás

We prove a characterization of the amenability of countable Borel equivalence relations in terms of the uniform Liouville property for group actions on their classes. Furthermore, inspired by a well-known amenability criterion for locally…

Group Theory · Mathematics 2026-03-10 Maksym Chaudkhari , Kate Juschenko , Friedrich Martin Schneider

The goal of this article is to study results and examples concerning finitely presented covers of finitely generated amenable groups. We collect examples of groups $G$ with the following properties: (i) $G$ is finitely generated, (ii) $G$…

Group Theory · Mathematics 2013-05-06 Mustafa Gokhan Benli , Rostislav Grigorchuk , Pierre De La Harpe

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…

Group Theory · Mathematics 2016-10-20 Maurice Chiodo

Let $G$ be a unitriangular matrix group of nilpotency class at most ten. We show that the Identity Problem (does a semigroup contain the identity matrix?) and the Group Problem (is a semigroup a group?) are decidable in polynomial time for…

Discrete Mathematics · Computer Science 2023-09-12 Ruiwen Dong