Construction and Periodicity of Minimal Resolution Graphs of Suspension Singularities

Sümeyra Sakallı; Claudia Salles

Home/Archive/arXiv

arXiv · 2608.11633

Construction and Periodicity of Minimal Resolution Graphs of Suspension Singularities

Sümeyra Sakallı·Claudia Salles

View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop computational tools for constructing the minimal resolution graphs of suspension singularities. In particular, we provide a Magma program that implements Nemethi's algorithm that can be used to construct the minimal resolution graph of any suspension singularity. The program outputs the resulting resolution graph as structured graph data, encoding the vertices, edges, and decorations of the graph. We further develop a SageMath program that takes this data as input and produces graphical representations of the resolution graphs, facilitating their visualization and analysis. For three families of suspension singularities, we prove that the corresponding minimal resolution graphs are periodic, with periods equal to the orders of the corresponding monodromy factorizations. We also provide Magma programs for generating compactified resolution graphs of suspension singularities and checking graph isomorphisms over a specified range of parameters.

Explore related subjects

math.GT math.AG math.SG

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Sümeyra Sakallı, Claudia Salles. 2026-08-12. Construction and Periodicity of Minimal Resolution Graphs of Suspension Singularities. https://arxiv.org/abs/2608.11633

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

KEEP EXPLORING

Related papers

arXiv2026

Hyperbolic links associated to Hamiltonian subgraphs in simple $3$-polytopes

We build a large family of hyperbolic links with an explicit decomposition of the complement into right-angled hyperbolic polytopes of finite volume. Namely, in a series of papers A.D.Mednykn and A.Yu.Vesnin introduced a construction that for a given right-angled polytope $P$ in geometry $\mathbb L^3$, $\mathbb R^3$, $\mathbb S^3$, $\mathbb L^2\times \mathbb R$, $\mathbb S^2\times \mathbb R$ and a Hamiltonian cycle, theta-subgraph or $K_4$-subgraph $Γ$ in the $1$-skeleton of $P$ builds a geometric $3$-manifold $N(P,Γ)$ with an involution $τ$ such that $N(P,Γ)/\langleτ\rangle\simeq S^3$. The brach set of the corresponding $2$-sheeted branched covering $N(P,Γ)\to S^3$ is a link $C_Γ\subset S^3$ consisting of trivially embedded circles. This construction reformulated in the language of toric topology works for such a subgraph $Γ$ in any simple $3$-polytope $P$ and gives a topological $3$-manifold $N(P,Γ)$. We give a criterion when $S^3\setminus C_Γ$ has a complete hyperbolic structure of finite volume and generalize this criterion to similar links in $3$-manifolds different from $S^3$. We prove that hyperbolic links $C_Γ$ are parametrized by nonselfcrossing Eulerian cycles, Eulerian theta-subgraphs and Eulerian $K_4$-subgraphs in hyperbolic right-angled $3$-polytopes of finite volume in $\mathbb L^3$ with $0$, $2$ or $4$ finite vertices. The complement $S^3\setminus C_Γ$ is glued of $4$, $8$ or $16$ copies of the corresponding right-angled polytope. We give a criterion when the link $C_Γ$ consists of mutually unlinked circles and prove that if such a link is nontrivial, then it contains the Borromean rings. The latter problem is motivated by the Efimov effect in quantum mechanics.

math.GT↗

arXiv2026

Knots and the Sierpinski Tetrahedron

In this paper we prove that there are infinitely many knots that cannot be embedded in the 1-skeletons of the finite iterations of the Sierpinski tetrahedron fractal. We do this by proving that such an embedding induces a sphere decomposition of weight at most 6. There are infinitely many knots with spherewidth greater than this.