skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: On asymptotic stability of connective groups
In their study of almost group representations, Manuilov and Mishchenko introduced and investigated the notion of asymptotic stability of a finitely presented discrete group. In this paper we establish connections between connectivity of amenable groups and asymptotic stability and exhibit new classes of asymptotically stable groups. In particular, we show that if G is an amenable and connective discrete group whose classifying space BG is homotopic to a finite simplicial complex, then G is asymptotically stable.  more » « less
Award ID(s):
1700086
PAR ID:
10178913
Author(s) / Creator(s):
Date Published:
Journal Name:
Operator algebras and mathematical physics
Volume:
80
Page Range / eLocation ID:
53 - 69
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    Abstract Adaptive time stepping methods for metastable dynamics of the Allen–Cahn and Cahn–Hilliard equations are investigated in the spatially continuous, semi-discrete setting. We analyse the performance of a number of first and second order methods, formally predicting step sizes required to satisfy specified local truncation error $$\sigma $$ σ in the limit of small length scale parameter $$\epsilon \rightarrow 0$$ ϵ → 0 during meta-stable dynamics. The formal predictions are made under stability assumptions that include the preservation of the asymptotic structure of the diffuse interface, a concept we call profile fidelity. In this setting, definite statements about the relative behaviour of time stepping methods can be made. Some methods, including all so-called energy stable methods but also some fully implicit methods, require asymptotically more time steps than others. The formal analysis is confirmed in computational studies. We observe that some provably energy stable methods popular in the literature perform worse than some more standard schemes. We show further that when Backward Euler is applied to meta-stable Allen–Cahn dynamics, the energy decay and profile fidelity properties for these discretizations are preserved for much larger time steps than previous analysis would suggest. The results are established asymptotically for general interfaces, with a rigorous proof for radial interfaces. It is shown analytically and computationally that for most reaction terms, Eyre type time stepping performs asymptotically worse due to loss of profile fidelity. 
    more » « less
  2. The center $$Z_n(q)$$ of the integral group algebra of the general linear group $$GL_n(q)$$ over a finite field admits a filtration with respect to the reflection length. We show that the structure constants of the associated graded algebras $$\mathscr{G}_n(q)$$ are independent of $$n$$, and this stability leads to a universal stable center with positive integer structure constants which governs the algebras $$\mathscr{G}_n(q)$$ for all $$n$$. Various structure constants of the stable center are computed and several conjectures are formulated. Analogous stability properties for symmetric groups and wreath products were established earlier by Farahat-Higman and the second author. 
    more » « less
  3. We first give simplified and corrected accounts of some results in work by Pillay (2017) on compactifications of pseudofinite groups. For instance, we use a classical theorem of Turing (1938) to give a simplified proof that any definable compactification of a pseudofinite group has an abelian connected component. We then discuss the relationship between Turing’s work, the Jordan–Schur theorem, and a (relatively) more recent result of Kazhdan (1982) on approximate homomorphisms, and we use this to widen our scope from finite groups to amenable groups. In particular, we develop a suitable continuous logic framework for dealing with definable homomorphisms from pseudoamenable groups to compact Lie groups. Together with the stabilizer theorems of Hrushovski (2012) and Montenegro et al. (2020), we obtain a uniform (but non-quantitative) analogue of Bogolyubov’s lemma for sets of positive measure in discrete amenable groups. We conclude with brief remarks on the case of amenable topological groups. 
    more » « less
  4. 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 prove that this question always has a positive answer when the acting group is polycyclic, and we obtain a positive answer for all free actions of a large class of solvable groups including the Baumslag–Solitar group BS(1, 2) and the lamplighter group Z2 ≀ Z. This marks the first time that a group of exponential volume-growth has been verified to have this property. In obtaining this result we introduce a new tool for studying Borel equivalence relations by extending Gromov’s notion of asymptotic dimension to the Borel setting. We show that countable Borel equivalence relations of finite Borel asymptotic dimension are hyperfinite, and more generally we prove under a mild compatibility assumption that increasing unions of such equivalence relations are hyperfinite. As part of our main theorem, we prove for a large class of solvable groups that all of their free Borel actions have finite Borel asymptotic dimension (and finite dynamic asymptotic dimension in the case of a continuous action on a zero dimensional space). We also provide applications to Borel chromatic numbers, Borel and continuous Følner tilings, topological dynamics, and C∗-algebras. 
    more » « less
  5. Abstract A probability measure-preserving action of a discrete amenable groupGis said to bedominantif it is isomorphic to a generic extension of itself. Recently, it was shown that for$$G = \mathbb {Z}$$, an action is dominant if and only if it has positive entropy and that for anyG, positive entropy implies dominance. In this paper, we show that the converse also holds for anyG, that is, that zero entropy implies non-dominance. 
    more » « less