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.


Search for: All records

Award ID contains: 2336000

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract In 2021, Chen proved that the size of any connected component of the Markoff mod$$p$$ p graph is divisible by$$p$$ p . In combination with the work of Bourgain, Gamburd, and Sarnak, Chen’s result resolves a conjecture of Baragar for all but finitely many primes: the Markoff mod$$p$$ p graph is connected. In particular, strong approximation for Markoff triples holds for all but finitely many primes. We provide an alternative proof of Chen’s theorem. 
    more » « less
    Free, publicly-accessible full text available August 1, 2026
  2. Abstract For 𝓞 an imaginary quadratic ring, we compute a fundamental polyhedron in hyperbolic 3-space for the action of PE2(𝓞), the projective elementary subgroup of PSL2(𝓞). This allows for new, simplified proofs of theorems of Cohn, Nica, Fine, and Frohman. Namely, we obtain a presentation for PE2(𝓞), show that it has infinite index and is its own normalizer in PSL2(𝓞), and split PSL2(𝓞) into a free product with amalgamation that has PE2(𝓞) as one of its factors. 
    more » « less
    Free, publicly-accessible full text available January 1, 2026
  3. Abstract Markoff mod‐ graphs are conjectured to be connected for all primes . In this paper, we use results of Chen and Bourgain, Gamburd, and Sarnak to confirm the conjecture for all . We also provide a method that quickly verifies connectivity for many primes below this bound. In our study of Markoff mod‐ graphs, we introduce the notion ofmaximal divisorsof a number. We prove sharp asymptotic and explicit upper bounds on the number of maximal divisors, which ultimately improves the Markoff graph ‐bound by roughly 140 orders of magnitude as compared with an approach using all divisors. 
    more » « less