Positive braid knots on and below the line −σ = b1/2

Feller conjectured that the closure of every non-trivial positive braid β satisfies −σ(β) > b1(β)/2, and that the homogenized signature satisfies −σ̃(β) ≥ l(β)/2; both are known for braids on at most four strands. We give seven positive braid words on five and six strands whose closures are hyperbolic knots with −σ = b1/2 (two words) and −σ < b1/2 (five words), with exact signatures. Using the quasi-morphism bound |σ − σ̃| ≤ b − 1 and exact signatures of powers, the homogenized inequality also fails, for two of the words with exact signatures of powers and for all seven with SnapPy signatures of higher powers. For one word, K54, an integer certificate allows the bound −σ ≤ 24 for Sage's Seifert matrix, and for the form built from the word, to be checked with integer arithmetic alone. An exhaustive search on five strands (floating-point signatures; a computer search, not a proof) finds nothing below the line up to word length 22 and one non-trivial knot on the line at length 20. We are not aware of a published example of this kind. All words, our scripts and logs, and browser-Claude's two archives are in this deposit. The braid words were found by browser-Claude (Claude in a web browser, model Claude Fable 5.2, Anthropic) in an outside reading round of our project; the exhaustive, determinant-1, control and shortening searches and the text are ours; the verification is ours together with separate Claude Code agents and browser-Claude, and DeepSeek read the statements and the note and found that the rule for S was missing (credits in the note). STATUS: not refereed. The note was prepared with substantial use of AI systems (Claude Code, Anthropic; browser-Claude; outside reader DeepSeek), working together with the author; the tool-use declaration is in the note. The author takes full responsibility for all contents. FILES: note.pdf, note.tex; package.zip with the seven words (plain text and JSON), the scripts and logs of the three exact signature computations, the powers and the homogenized bounds, the search scripts with their result files and logs, and browser-Claude's two archives, of 12 November and of the fifth reading round of the note (unchanged); README.md; LICENSE-DOCS.txt; SHA256SUMS. LICENCES: note CC BY 4.0 (the licence field of this record); scripts GPL-3.0-or-later; data CC BY 4.0 — per part as stated in README.md.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-14
DOI
https://doi.org/10.5281/zenodo.24217565
Primary Topic
Geometric and Algebraic Topology
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Positive braid knots on and below the line −σ = b1/2

Werner Alois Stanggassinger
Zenodo (CERN European Organization for Nuclear Research)
Geometric and Algebraic Topology
preprint

Positive braid knots on and below the line −σ = b1/2

Werner Alois Stanggassinger
preprint en

Abstract

Feller conjectured that the closure of every non-trivial positive braid β satisfies −σ(β) > b1(β)/2, and that the homogenized signature satisfies −σ̃(β) ≥ l(β)/2; both are known for braids on at most four strands. We give seven positive braid words on five and six strands whose closures are hyperbolic knots with −σ = b1/2 (two words) and −σ < b1/2 (five words), with exact signatures. Using the quasi-morphism bound |σ − σ̃| ≤ b − 1 and exact signatures of powers, the homogenized inequality also fails, for two of the words with exact signatures of powers and for all seven with SnapPy signatures of higher powers. For one word, K54, an integer certificate allows the bound −σ ≤ 24 for Sage's Seifert matrix, and for the form built from the word, to be checked with integer arithmetic alone. An exhaustive search on five strands (floating-point signatures; a computer search, not a proof) finds nothing below the line up to word length 22 and one non-trivial knot on the line at length 20. We are not aware of a published example of this kind. All words, our scripts and logs, and browser-Claude's two archives are in this deposit. The braid words were found by browser-Claude (Claude in a web browser, model Claude Fable 5.2, Anthropic) in an outside reading round of our project; the exhaustive, determinant-1, control and shortening searches and the text are ours; the verification is ours together with separate Claude Code agents and browser-Claude, and DeepSeek read the statements and the note and found that the rule for S was missing (credits in the note). STATUS: not refereed. The note was prepared with substantial use of AI systems (Claude Code, Anthropic; browser-Claude; outside reader DeepSeek), working together with the author; the tool-use declaration is in the note. The author takes full responsibility for all contents. FILES: note.pdf, note.tex; package.zip with the seven words (plain text and JSON), the scripts and logs of the three exact signature computations, the powers and the homogenized bounds, the search scripts with their result files and logs, and browser-Claude's two archives, of 12 November and of the fifth reading round of the note (unchanged); README.md; LICENSE-DOCS.txt; SHA256SUMS. LICENCES: note CC BY 4.0 (the licence field of this record); scripts GPL-3.0-or-later; data CC BY 4.0 — per part as stated in README.md.

Zenodo (CERN European Organization for Nuclear Research)
Geometric and Algebraic Topology
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon