Pith. sign in

REVIEW

Markov chains, CAT(0) cube complexes, and enumeration: monotone paths in a strip mix slowly

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

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 2409.09133 v1 pith:YPZKBOPO submitted 2024-09-13 math.CO math.PR

Federico Ardila-Mantilla , Naya Banerjee , Coleson Weir This is my paper · ORCID
classification math.COmath.PR
keywords monotonepathsstripchainscomplexesmarkovslowlyalong
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We prove that two natural Markov chains on the set of monotone paths in a strip mix slowly. To do so, we make novel use of the theory of non-positively curved (CAT(0)) cubical complexes to detect small bottlenecks in many graphs of combinatorial interest. Along the way, we give a formula for the number c_m(n) of monotone paths of length n in a strip of height m. In particular we compute the exponential growth constant of c_m(n) for arbitrary m, generalizing results of Williams for m=2, 3.

Discussion (0). Continue with ORCID to comment.

Pith tools