arXiv research

Origami edge-paths connect coherent curves on surfaces.

Constructs weight 1/2 multiplier systems for a specific group and relates to geometric edge paths.

For a positive integer $n\ge 3$, the collection of $n$-sided polygons embedded in $3$-space defines the space of geometric knots. We will consider the subspace of equilateral knots, consisting of embedded $n$-sided polygons with unit length edges. Paths in this space determine isotopies of polygons, so path-components …

The complex of curves $\mathcal{C}(S_g)$ of a closed orientable surface of genus $g \geq 2$ is the simplicial complex having its vertices, $\mathcal{C}^0(S_g)$, are isotopy classes of essential curves in $S_g$. Two vertices co-bound an edge of the $1$-skeleton, $\mathcal{C}^1(S_g)$, if there are disjoint representative…

We consider non-orientable closed surfaces of minimum crosscap number in the $(p,q)$-lens space $L(p,q) \cong V_1 \cup_{\partial} V_2$, where $V_1$ and $V_2$ are solid tori. Bredon and Wood gave a formula for calculating the minimum crosscap number. Rubinstein showed that $L(p,q)$ with $p$ even has only one isotopy cla…

New method discovers mean and variance causal graphs from heteroscedastic data.

In this thesis we describe how to estimate the distance spanned in the pants graph by a train track splitting sequence on a surface, up to multiplicative and additive constants. If some moderate assumptions on a splitting sequence are satisfied, each vertex set of a train track in it will represent a vertex of a graph …

Study efficient geodesics in curve complex using dot graphs.