Related papers: Mapping classes associated to mixed-sign Coxeter g…
We show that finitely-generated, purely pseudo-Anosov subgroups of the genus-2 Goeritz group are convex cocompact in the genus-2 mapping class group.
For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.
We discuss a number of open problems about mapping class groups of surfaces. In particular, we discuss problems related to linearity, congruence subgroups, cohomology, pseudo-Anosov stretch factors, Torelli subgroups, and normal subgroups.
Alternating-sign Hopf plumbing along a tree yields fibered alternating links whose homological monodromy is, up to a sign, conjugate to some alternating-sign Coxeter transformation. Exploiting this tie, we obtain results about the location…
In this paper, we introduce a generalization of graphlets to heterogeneous networks called typed graphlets. Informally, typed graphlets are small typed induced subgraphs. Typed graphlets generalize graphlets to rich heterogeneous networks…
In this short note we discuss the interplay between finite Coxeter groups and construction of wavelet sets, generalized multiresolution analysis and sampling.
Graphs can be associated with a matrix according to some rule and we can find the spectrum of a graph with respect to that matrix. Two graphs are cospectral if they have the same spectrum. Constructions of cospectral graphs help us…
In this article we introduce the notion of a \textit{regular partition} of a Coxeter group. We develop the theory of these partitions, and show that the class of regular partitions is essentially equivalent to the class of automata (not…
We show the uniqueness and existence of the Euler form for a simply-laced generalized root system. This enables us to show that the Coxeter element for a simply-laced generalized root system is admissible in the sense of R.~W.~Carter. As an…
Let $\text{Mod}(S_g)$ be the mapping class group of the closed orientable surface $S_g$ of genus $g \geq 1$. In this paper, we develop various methods for factoring periodic mapping classes into Dehn twists, up to conjugacy. As…
We combinatorially characterize the number $\mathrm{cc}_2$ of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count…
We consider constant mean curvature surfaces of finite topology, properly embedded in three-space in the sense of Alexandrov. Such surfaces with three ends and genus zero were constructed and completely classified by the authors in…
Compound graphs are networks in which vertices can be grouped into larger subsets, with these subsets capable of further grouping, resulting in a nesting that can be many levels deep. In several applications, including biological workflows,…
When W is a finite Coxeter group of classical type (A, B, or D), noncrossing partitions associated to W and compatibility of almost positive roots in the associated root system are known to be modeled by certain planar diagrams. We show how…
We derive presentations of the interval groups related to all quasi-Coxeter elements in the Coxeter group of type $D_n$. Type $D_n$ is the only infinite family of finite Coxeter groups that admits proper quasi-Coxeter elements. The…
We investigate Voronoi-like tessellations of bipartite quadrangulations on surfaces of arbitrary genus, by using a natural generalization of a bijection of Marcus and Schaeffer allowing to encode such structures into labeled maps with a…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…
Consider the problem of estimating the minimum entropy of pseudo-Anosov maps on a surface of genus $g$ with $n$ punctures. We determine the behaviour of this minimum number for a certain large subset of the $(g,n)$ plane, up to a…
We introduce the polygonalisation complex of a surface, a cube complex whose vertices correspond to polygonalisations. This is a geometric model for the mapping class group and it is motivated by works of Harer, Mosher and Penner. Using…