Search arXiv⌕ Search

arXiv · 2609.36772

Quantitative finiteness of monic characters of knots

Abstract

Dunfield, Friedl, and Jackson showed that if the $SL(2, \mathbb{C})$-character variety of a knot has an irreducible curve component that contains the character of an irreducible representation and a character with nonmonic twisted Alexander polynomial, then this component has only finitely many characters with monic twisted Alexander polynomials. In this paper, we give explicit upper bounds on the number of such characters in terms of a presentation of the knot group. In particular, we give upper bounds in terms of the crossing number of the knot.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Taehee Kim, Takayuki Morifuji. 2026-09-29. Quantitative finiteness of monic characters of knots. https://arxiv.org/abs/2609.36772

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

KEEP EXPLORING

Related papers

Cubical structures and the large-scale geometry of graph braid groups

We study the large-scale geometry of graph braid groups through the cubical structure of their unordered discrete configuration spaces, focusing on quasi-isometry to right-angled Artin groups (RAAGs). We first give a complete classification of graph braid groups quasi-isometric to free groups. For the $2$-braid group on a graph $Γ$, we study the union $UP_2(Γ)$ of maximal product subcomplexes of the associated unordered discrete configuration space. We introduce a hierarchy recording geometric and algebraic properties of this inclusion and identify conditions under which the quasi-isometry type of its fundamental group is determined by that of the ambient braid group. For normal bunches of grapes, a class of graphs obtained by attaching cycles to trees, this fundamental group is a one-ended free factor, and the quasi-isometry classification of the braid groups reduces to that of these factors. Using the combinatorics of the underlying trees and the associated intersection complexes, we obtain a graph-theoretic sufficient condition and new obstructions for quasi-isometry to RAAGs, yielding infinite families of non-hyperbolic examples and nonexamples. We also construct infinitely many graph $2$-braid groups hyperbolic relative to a thick proper subgroup not isomorphic to any braid group with at most two particles on a subgraph of the underlying graph.

math.GT↗

Khovanov Homology in Connected Sums, Properties and Applications

We extend the definition of Khovanov-Lee homology to links in connected sums of interval bundles over surfaces and $S^1\times S^2$'s, and construct a Rasmussen-type invariant for links in these manifolds. As an application, we prove an inequality relating the Rasmussen-type invariant to the genus of surfaces with boundary in four-manifolds that are boundary connect sums of $D^2\times S^2$, $\mathbb{C} P^2\setminus B^4$, and $DTS^2$.

math.GT↗

Surfaces and their Profile Curves

This paper examines the relationship between the knotting of an embedded surface in $\R^3$ and the knotting of its fold curves, formed by the singular set of projection to a plane. The first result shows that every surface, no matter how knotted, can be isotoped so that its fold curves form an unlink. A second result defines a new invariant which gives a complete obstruction to turning a fixed curve on a surface into a fold curve.

math.GT↗