Pith. sign in

REVIEW 1 cited by

Random walks on Ramanujan complexes and digraphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1702.05452 v2 pith:L5DFL6VU submitted 2017-02-17 math.CO math.PRmath.RT

classification math.COmath.PRmath.RT
keywords ramanujanrandomassociatedcutoffoperatorscomplexcomplexesdigraphs
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

The cutoff phenomenon was recently confirmed for random walks on Ramanujan graphs by the first author and Peres. In this work, we obtain analogs in higher dimensions, for random walk operators on any Ramanujan complex associated with a simple group $G$ over a local field $F$. We show that if $T$ is any $k$-regular $G$-equivariant operator on the Bruhat-Tits building with a simple combinatorial property (collision-free), the associated random walk on the $n$-vertex Ramanujan complex has cutoff at time $\log_k n$. The high dimensional case, unlike that of graphs, requires tools from non-commutative harmonic analysis and the infinite-dimensional representation theory of $G$. Via these, we show that operators $T$ as above on Ramanujan complexes give rise to Ramanujan digraphs with a special property ($r$-normal), implying cutoff. Applications include geodesic flow operators, geometric implications, and a confirmation of the Riemann Hypothesis for the associated zeta functions over every group $G$, previously known for groups of type $\widetilde A_n$ and $\widetilde C_2$.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-Qubit Golden Gates

    math.NT 2025-09 conditional novelty 7.0 of 10

    Multi-qubit golden and super-golden gate sets, including 2-qubit Clifford+CS, are constructed with provably optimal covering rates up to polylog factors, giving 4.8x to 10x asymptotic reductions in expensive gate count.

Pith tools