Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2412.04960

Punctured surfaces, quiver mutations, and quotients of Coxeter groups

Anna Felikson·Michael Shapiro·Pavel Tumarkin
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 2011, Barot and Marsh provided an explicit construction of presentation of a finite Weyl group $W$ by any quiver mutation-equivalent to an orientation of a Dynkin diagram with Weyl group $W$. The construction was extended by the authors of the present paper to obtain presentations for all affine Coxeter groups, as well as to construct groups from triangulations of unpunctured surfaces and orbifolds, where the groups are invariant under change of triangulation and thus are presented as quotients of numerous distinct Coxeter groups. We extend the construction to include most punctured surfaces and orbifolds, providing a new invariant for almost all marked surfaces.

Explore related subjects

math.COmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anna Felikson, Michael Shapiro, Pavel Tumarkin. 2025-08-30. Punctured surfaces, quiver mutations, and quotients of Coxeter groups. https://arxiv.org/abs/2412.04960

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗