Casandra D. Monroe | Searcharxiv

arXiv2026

Branched Bending in Finite-Volume Hyperbolic Manifolds

We define branched bending deformations as deformations supported on a piecewise totally geodesic complex of $(n-1)$-dimensional faces meeting along $(n-2)$-dimensional branching loci. These are a generalization of bending deformations, as introduced by Johnson and Millson. We give a lower bound on the dimension of the (infinitesimal) deformation space supported on a branched bending complex, and in doing so generalize a result of Bart and Scannell. We give equations describing these deformations in the setting of deforming to higher hyperbolic geometry and real projective geometry. As a special example of branched bending, we construct infinitesimal deformations supported on the link complement of the Borromean Rings (also known as the link $6^3_2$), recovering a special case of a theorem due to Menasco and Reid.

math.GT↗

arXiv2024

Interval and $\ell$-interval Rational Parking Functions

Interval parking functions are a generalization of parking functions in which cars have an interval preference for their parking. We generalize this definition to parking functions with $n$ cars and $m\geq n$ parking spots, which we call interval rational parking functions and provide a formula for their enumeration. By specifying an integer parameter $\ell\geq 0$, we then consider the subset of interval rational parking functions in which each car parks at most $\ell$ spots away from their initial preference. We call these $\ell$-interval rational parking functions and provide recursive formulas to enumerate this set for all positive integers $m\geq n$ and $\ell$. We also establish formulas for the number of nondecreasing $\ell$-interval rational parking functions via the outcome map on rational parking functions. We also consider the intersection between $\ell$-interval parking functions and Fubini rankings and show the enumeration of these sets is given by generalized Fibonacci numbers. We conclude by specializing $\ell=1$, and establish that the set of $1$-interval rational parking functions with $n$ cars and $m$ spots are in bijection with the set of barred preferential arrangements of $[n]$ with $m-n$ bars. This readily implies enumerative formulas. Further, in the case where $\ell=1$, we recover the results of Hadaway and Harris that unit interval parking functions are in bijection with the set of Fubini rankings, which are enumerated by the Fubini numbers.

math.CO↗

arXiv2022

On Parking Functions and The Tower of Hanoi

The displacement of a parking function measures the total difference between where cars want to park and where they ultimately park. In this article, we prove that the set of parking functions of length $n$ with displacement one is in bijection with the set of ideal states in the famous Tower of Hanoi game with $n+1$ disks and $n+1$ pegs, both sets being enumerated by the Lah numbers.

math.CO↗