arXiv · 2604.00539
Computing Alexander polynomials for arborescent links
Abstract
Alexander polynomial was born one century ago, but explicit formulas have been found for only a few families of links. In this paper, we present an efficient method of computing Alexander polynomial for arborescent links. Applying this method, we express the Alexander polynomials of Montesinos links in terms of certain polynomials associated to rational tangles which can be computed recursively. Specifically, we deduce explicit closed formulas for all pretzel links.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Haimiao Chen. 2026-04-01. Computing Alexander polynomials for arborescent links. https://arxiv.org/abs/2604.00539
Cite the original work for its findings. Save a collection to share your selection of sources.