Papers
Topics
Authors
Recent
Search
2000 character limit reached

Eichler orders, quotient graphs and random walks

Published 15 Mar 2025 in math.NT | (2503.12237v1)

Abstract: We study the extent to which the quotient of the Bruhat-Tits tree at one place $Q$, associated to a genus of orders of maximal rank, can be computed from the analogous quotient at a different place $P$. We show that this computation can be carried out, except for a small set of vertices depending on $P$, but not on $Q$. We give some geometrical conditions on the quotient at $P$ that ensure that this exceptional set is empty. This generalizes the formulas from a previous work that allow the computation of the quotient graph at all places, for the genus of maximal orders over the projective line. The methods presented here yield similar results for other genera or other curves.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.