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 the profinite rigidity of triangle groups
We prove that certain Fuchsian triangle groups are profinitely rigid in the absolute sense, i.e. each is distinguished from all other finitely generated, residually finite groups by its set of finite quotients. We also develop a method based on character varieties that can be used to distinguish between the profinite completions of certain groups.  more » « less
Award ID(s):
1812153
PAR ID:
10188346
Author(s) / Creator(s):
Date Published:
Journal Name:
Preprint
ISSN:
1864-7839
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. For a prime ℓ \ell , the McKay conjecture suggests a bijection between the set of irreducible characters of a finite group with ℓ ′ \ell ’ -degree and the corresponding set for the normalizer of a Sylow ℓ \ell -subgroup. Navarro’s refinement suggests that the values of the characters on either side of this bijection should also be related, proposing that the bijection commutes with certain Galois automorphisms. Recently, Navarro–Späth–Vallejo have reduced the McKay–Navarro conjecture to certain “inductive” conditions on finite simple groups. We prove that these inductive McKay–Navarro (also called the inductive Galois–McKay) conditions hold for the prime ℓ = 2 \ell =2 for several groups of Lie type, namely the untwisted groups without non-trivial graph automorphisms. 
    more » « less
  2. We prove that for every prime p algebraically clean graphs of groups are vir- tually residually p-finite and cohomologically p-complete. We also prove that they are cohomologically good. We apply this to certain 2-dimensional Artin groups. 
    more » « less
  3. An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group. We show how to determine the critical group of an arithmetical structure on a star graph or complete graph in terms of the entries of the arithmetical structure. We use this to investigate which finite abelian groups can occur as critical groups of arithmetical structures on these graphs. 
    more » « less
  4. For and finite groups, does there exist a 3-manifold group with as a quotient but no as a quotient? We answer all such questions in terms of the group cohomology of finite groups. We prove non-existence with topological results generalizing the theory of semicharacteristics. To prove existence of 3-manifolds with certain finite quotients but not others, we use a probabilistic method, by first proving a formula for the distribution of the (profinite completion of) the fundamental group of a random 3-manifold in the Dunfield-Thurston model of random Heegaard splittings as the genus goes to infinity. We believe this is the first construction of a new distribution of random groups from its moments. 
    more » « less
  5. Abstract It is shown that any finite group 𝐴 is realizable as the automizer in a finite perfect group 𝐺 of an abelian subgroup whose conjugates generate 𝐺.The construction uses techniques from fusion systems on arbitrary finite groups, most notably certain realization results for fusion systems of the type studied originally by Park. 
    more » « less