Skip to content
#edge computing Open access

The leading coefficient of the Alexander polynomial of twisted torus knots

Sep 2026 · arXiv (Cornell University)
Geometric and Algebraic Topology

Abstract

For a twisted torus knot K(p,q;r,s) with gcd(p,q) = 1 and 2 ≤ r < p we determine the leading coefficient of the Alexander polynomial Δ exactly. Writing Δ up to a unit as Δ̃(u) = Σ_{m=0}^{r−1} γ_m(t) u^m with u = t^{rs}, we prove a multiset law expressing each γ_m as a sum of p monomials with all coefficients +1, a closed formula for the degree sequence d_m = deg γ_m in terms of return times of a rotation, and the resulting leading-coefficient law |lc(Δ)| = #{m : d_m + mrs maximal}. Consequently Δ is monic if and only if that maximum is attained once, and Δ fails to be monic exactly when −rs is an edge slope of the upper convex hull of {(m, d_m)}; in particular at most r−1 values of s are non-monic for fixed (p,q,r), however large |s|. We then classify the extremal case |lc(Δ)| = r completely, by three explicit arithmetic conditions on (p,q,r), for every admissible parameter. This supplies the algebraic half of a conjecture of Adnan and Park; we do not address its geometric direction. Prior work. Two papers by Sangyop Lee (J. Knot Theory Ramifications 2024 and 2026) concern the same family at r = 2: the first determines which of these knots are cable or torus knots, the second determines their knot types outright. We have not been able to consult either paper directly and rely on their abstracts. Since a knot type determines its Alexander polynomial, the case r = 2 of the leading-coefficient law may well be deducible from Lee (2026), and we claim no priority there. For r ≥ 3 we are not aware of a classification from which our statements would follow. The case q | r (Δ always monic) is attributed to Lee (2012). This work was developed in collaboration with the AI system Claude Code (Anthropic): the geometric family, the guiding questions, and the computing hardware are due to the author (a sculptor); the formalisation, the algorithms and the proofs were developed jointly with Claude Code (Anthropic). The collaboration is stated as a fact, not a disclaimer. The author takes full responsibility for all contents. Website: https://knot-structures.stainlesssteel4u.de/

Read PDF

Similar papers

#computer vision Review Sep 2017

Agile Software Development Methods: Review and Analysis

This publication proposes a definition and a classification of agile software development approaches and analyses ten software development methods that can be characterized as being "agile" against the defined criterion.

P. Abrahamsson, O. Salo, Jussi Ronkainen et al. · 727 citations · ⚡54
#computer vision Jun 2008

The impact of agile practices on communication in software development

The study shows that agile practices improve both informal and formal communication, but indicates that, in larger development situations involving multiple external stakeholders, a mismatch of adequate communication mechanisms can sometimes even hinder the communication.

M. Pikkarainen, Jukka Haikara, O. Salo et al. · 401 citations · ⚡48
#machine learning Review Open access Oct 2014

Software development in startup companies: A systematic mapping study

The results indicate that software engineering work practices are chosen opportunistically, adapted and configured to provide value under the constrains imposed by the startup context.

Nicolò Paternoster, Carmine Giardino, M. Unterkalmsteiner et al. · 394 citations · ⚡54

Related blog posts

Microsoft Research Blog Oct 29, 2026

Microsoft Research Focus – Edition #97

Host Sowbhagya Suresh shares some of the latest news and cutting-edge research from across Microsoft—from understanding the challenges facing coding agents to uncovering how people use AI at work and improving extended-range weather forecasting. The post Microsoft Research Focus – Edition #97 appeared first on Microsoft Research.

MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.