On the question ``Can one hear the shape of a group? and a Hulanicki type theorem for graphs
DOI10.1007/s11856-020-1994-zzbMath1484.20075arXiv1809.04008OpenAlexW3014612888MaRDI QIDQ2190042
Artem Dudko, Rostislav I. Grigorchuk
Publication date: 18 June 2020
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1809.04008
Subgroup theorems; subgroup growth (20E07) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Measures on groups and semigroups, etc. (43A05) Unitary representations of locally compact groups (22D10) Asymptotic properties of groups (20F69) Means on groups, semigroups, etc.; amenable groups (43A07)
Related Items (3)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A large family of cospectral Cayley graphs over dihedral groups
- Isospectral Cayley graphs of some finite simple groups
- Isospectral plane domains and surfaces via Riemannian orbifolds
- Spectra of Cayley graphs
- On the spectrum of the sum of generators for a finitely generated group
- On spectra of Koopman, groupoid and quasi-regular representations
- Can One Hear the Shape of a Group?
- Full Banach Mean Values on Countable groups.
- Symmetric Random Walks on Groups
- Anisotropic random walks on free products of cyclic groups, irreducible representations and idempotents of C*reg(G)
- Operator 𝐾-theory for groups which act properly and isometrically on Hilbert space
- Amenability and paradoxical decompositions for pseudogroups and for discrete metric spaces
- Can one hear the shape of a group?
- Amenable groups without finitely presented amenable covers
- Can One Hear the Shape of a Drum?
- Varieties of groups
- Means and Følner condition on locally compact groups
- Finiteness Conditions for Soluble Groups
This page was built for publication: On the question ``Can one hear the shape of a group? and a Hulanicki type theorem for graphs