arXiv subjects
Publications and source records attributed to Marissa Loving.
Given any weak Perron number $\lambda$, we construct an end-periodic homeomorphism $f:\Sigma\rightarrow \Sigma$ with Handel-Miller stretch factor equal to $\lambda$ where $\Sigma$ is a connected infinite-type surface with finitely many ends all accumulated by genus.
In this expository paper, we provide an intuition and illustration-driven overview of two recent results that tie the dynamics of certain homeomorphisms of infinite-type surfaces, called end-periodic homeomorphisms, to the geometry of their associated (compactified) mapping tori. These results are analogues of a theorem of Brock in the finite-type setting for mapping tori of pseudo-Anosov homeomorphisms.
We show that the arc complex $\mathcal{A}(S_{g,1})$ is not quasi-isometric to the sphere complex $\mathcal S_{2g}$ associated to the double of a genus $2g$ handlebody. Along the way, we present a simple proof that $\mathcal{A}(S_{g,1})$ is quasi-isometrically rigid.
Given an end-periodic homeomorphism $f: S \to S$ we give a lower bound on the Handel--Miller stretch factor of $f$ in terms of the core characteristic of $f$, which is a measure of topological complexity for an end-periodic homeomorphism. We also show that the growth rate of this bound is sharp.
In this work, we find a closed form formula for the braid index of an $n$-bridge braid, a class of positive braid knots which simultaneously generalizes torus knots, 1-bridge braids, and twisted torus knots. Our proof is elementary, effective, and self-contained, and partially recovers work of Birman--Kofman. Along the way, we show that the disparate definitions of twisted torus knots in the literature agree.
We prove that every closed orientable surface S of negative Euler characteristic admits a pair of finite-degree covers which are length isospectral over S but generically not simple length isospectral over S. To do this, we first characterize when two finite-degree covers of a connected, orientable surface of negative Euler characteristic are isomorphic in terms of which curves have simple elevations. We also construct hyperbolic surfaces X and Y with the same full unmarked length spectrum but so that for each k, the sets of lengths associated to curves with at most k self-intersections differ.
In this note we prove an effective characterization of when two finite-degree covers of a connected, orientable surface of negative Euler characteristic are isomorphic in terms of which curves have simple elevations, weakening the hypotheses to consider curves with explicitly bounded self-intersection number. As an application we show that for sufficiently large N, the set of unmarked traces associated to simple closed curves in a generically chosen representation to SL(N, R) distinguishes between pairs of non-isomorphic covers.
Given a natural number k and an orientable surface S of finite type, define the k-curve graph to be the graph with vertices corresponding to isotopy classes of essential simple closed curves on S and with edges corresponding to pairs of such curves admitting representatives that intersect at most k times. We prove that the automorphism group of the k-curve graph of a surface S is isomorphic to the extended mapping class group for all k sufficiently small with respect to the Euler characteristic of S. We prove the same result for the so-called systolic complex, a variant of the curve graph whose complete subgraphs encode the intersection patterns for any collection of systoles with respect to a hyperbolic metric. This resolves a conjecture of Schmutz Schaller.
We provide a lower bound on the volume of the compactified mapping torus of a strongly irreducible end-periodic homeomorphism f. This result, together with work of Field, Kim, Leininger, and Loving, shows that the volume of the compactified mapping torus of f is comparable to the translation length of f on a connected component of the pants graph, extending work of Brock in the finite-type setting on volumes of mapping tori of pseudo-Anosov homeomorphisms.
Given an irreducible, end-periodic homeomorphism f of a surface S with finitely many ends, all accumulated by genus, the mapping torus is the interior of a compact, irreducible, atoroidal 3-manifold with incompressible boundary. Our main result is an upper bound on the infimal hyperbolic volume of the compactified mapping torus in terms of the translation length of f on the pants graph of S. This builds on work of Brock and Agol in the finite-type setting. We also construct a broad class of examples of irreducible, end-periodic homeomorphisms and use them to show that our bound is asymptotically sharp.
In this note we make progress toward a conjecture of Durham--Fanoni--Vlamis, showing that every infinite-type surface with finite-invariance index 1 and no nondisplaceable compact subsurfaces fails to have a good curve graph, that is, a connected graph where vertices represent homotopy classes of essential simple closed curves and where the natural mapping class group action has infinite diameter orbits. Our arguments use tools developed by Mann--Rafi in their study of the coarse geometry of big mapping class groups.
We explicitly construct new subgroups of the mapping class groups of an uncountable collection of infinite-type surfaces, including, but not limited to, free groups, Baumslag-Solitar groups, mapping class groups of other surfaces, and a large collection of wreath products. For each such subgroup $H$ and surface $S$, we show that there are countably many non-conjugate embeddings of $H$ into $\textrm{Map}(S)$; in certain cases, there are uncountably many such embeddings. The images of each of these embeddings cannot lie in the isometry group of $S$ for any hyperbolic metric and are not contained in the closure of the compactly supported subgroup of $\textrm{Map}(S)$. In this sense, our construction is new and does not rely on previously known techniques for constructing subgroups of mapping class groups. Notably, our embeddings of $\textrm{Map}(S')$ into $\textrm{Map}(S)$ are not induced by embeddings of $S'$ into $S$. Our main tool for all of these constructions is the utilization of special homeomorphisms of $S$ called shift maps, and more generally, multipush maps.
Given two finite covers $p: X \to S$ and $q: Y \to S$ of a connected, oriented, closed surface $S$ of genus at least $2$, we attempt to characterize the equivalence of $p$ and $q$ in terms of which curves lift to simple curves. Using Teichmüller theory and the complex of curves, we show that two regular covers $p$ and $q$ are equivalent if for any closed curve $γ\subset S$, $γ$ lifts to a simple closed curve on $X$ if and only if it does to $Y$. When the covers are abelian, we also give a characterization of equivalence in terms of which powers of simple closed curves lift to closed curves.
Given a simple Lie algebra $\mathfrak{g}$, Kostant's weight $q$-multiplicity formula is an alternating sum over the Weyl group whose terms involve the $q$-analog of Kostant's partition function. For $ξ$ (a weight of $\mathfrak{g}$), the $q$-analog of Kostant's partition function is a polynomial-valued function defined by $\wp_q(ξ)=\sum c_i q^i$ where $c_i$ is the number of ways $ξ$ can be written as a sum of $i$ positive roots of $\mathfrak{g}$. In this way, the evaluation of Kostant's weight $q$-multiplicity formula at $q = 1$ recovers the multiplicity of a weight in a highest weight representation of $\mathfrak{g}$. In this paper, we give closed formulas for computing weight $q$-multiplicities in a highest weight representation of the exceptional Lie algebra $\mathfrak{g}_2$.
The $q$-analog of Kostant's weight multiplicity formula is an alternating sum over a finite group, known as the Weyl group, whose terms involve the $q$-analog of Kostant's partition function. This formula, when evaluated at $q=1$, gives the multiplicity of a weight in a highest weight representation of a simple Lie algebra. In this paper, we consider the Lie algebra $\mathfrak{sl}_4(\mathbb{C})$ and give closed formulas for the $q$-analog of Kostant's weight multiplicity. This formula depends on the following two sets of results. First, we present closed formulas for the $q$-analog of Kostant's partition function by counting restricted colored integer partitions. These formulas, when evaluated at $q=1$, recover results of De Loera and Sturmfels. Second, we describe and enumerate the Weyl alternation sets, which consist of the elements of the Weyl group that contribute nontrivially to Kostant's weight multiplicity formula. From this, we introduce Weyl alternation diagrams on the root lattice of $\mathfrak{sl}_4(\mathbb{C})$, which are associated to the Weyl alternation sets. This work answers a question posed in 2019 by Harris, Loving, Ramirez, Rennie, Rojas Kirby, Torres Davila, and Ulysse.
The multiplicity of a weight in a finite-dimensional irreducible representation of a simple Lie algebra g can be computed via Kostant's weight multiplicity formula. This formula consists of an alternating sum over the Weyl group (a finite group) and involves a partition function known as Kostant's partition function. Motivated by the observation that, in practice, most terms in the sum are zero, our main results describe the elements of the Weyl alternation sets. The Weyl alternation sets are subsets of the Weyl group which contributes nontrivially to the multiplicity of a weight in a highest weight representation of the Lie algebras so_4(C), so_5(C), sp_4(C), and the exceptional Lie algebra g_2. By taking a geometric approach, we extend the work of Harris, Lescinsky, and Mabie on sl_3(C), to provide visualizations of these Weyl alternation sets for all pairs of integral weights \lambda and \mu of the Lie algebras considered.
Classical parking functions are defined as the parking preferences for $n$ cars driving (from west to east) down a one-way street containing parking spaces labeled from $1$ to $n$ (from west to east). Cars drive down the street toward their preferred spot and park there if the spot is available. Otherwise, the car continues driving down the street and takes the first available parking space, if such a space exists. If all cars can park using this parking rule, we call the $n$-tuple containing the cars' parking preferences a parking function. In this paper, we introduce a generalization of the parking rule allowing cars whose preferred space is taken to first proceed up to $k$ spaces west of their preferred spot to park before proceeding east if all of those $k$ spaces are occupied. We call parking preferences which allow all cars to park under this new parking rule $k$-Naples parking functions of length $n$. This generalization gives a natural interpolation between classical parking functions, the case when $k=0$, and all $n$-tuples of positive integers $1$ to $n$, the case when $k\geq n-1$. Our main result provides a recursive formula for counting $k$-Naples parking functions of length $n$. We also give a characterization for the $k=1$ case by introducing a new function that maps $1$-Naples parking functions to classical parking functions, i.e. $0$-Naples parking functions. Lastly, we present a bijection between $k$-Naples parking functions of length $n$ whose entries are in weakly decreasing order and a family of signature Dyck paths.
Let $G=( V(G), E(G) )$ be a connected graph with vertex set $V(G)$ and edge set $E(G)$. We say a subset $D$ of $V(G)$ dominates $G$ if every vertex in $V \setminus D$ is adjacent to a vertex in $D$. A generalization of this concept is $(t,r)$ broadcast domination. We designate certain vertices to be towers of signal strength $t$, which send out signal to neighboring vertices with signal strength decaying linearly as the signal traverses the edges of the graph. We let $\mathbb{T}$ be the set of all towers, and we define the signal received by a vertex $v\in V(G)$ from a tower $w \in \mathbb T$ to be $f(v)=\sum_{w\in \mathbb{T}}max(0,t-d(v,w))$. Blessing, Insko, Johnson, Mauretour (2014) defined a $(t,r)$ broadcast dominating set, or a $(t,r) $ broadcast, on $G$ as a set $\mathbb{T} \subseteq V(G) $ such that $f(v)\geq r$ for all $v\in V(G)$. The minimal cardinality of a $(t, r)$ broadcast on $G$ is called the $(t, r)$ broadcast domination number of $G$. In this paper, we present our research on the $(t,r)$ broadcast domination number for certain graphs including paths, grid graphs, the slant lattice, and the king's lattice.