betaFeedback

WorksMathematics

Determinants of amphichiral knots of braid index at most three

Abstract

We show that an odd number n is the determinant of an amphichiral knot of braid index at most three if and only if both n and n + 4 are sums of two squares. The proof rests on the known description of amphichiral knots of braid index three as closures of alternating 3-braid words with a rotation or reflection symmetry (Birman–Menasco, Stoimenov, Jung). Determinant formulas for closed 3-braids are also known (e.g. through the reduced Burau representation at t = -1); what is added here is their evaluation on the two symmetric families, which gives the condition on n + 4, and an explicit construction for the converse. For amphichiral knots of braid index three this describes which determinants occur, which bears on the determinant part of a question of Jung. We did not find the statement in the literature we searched. As a consequence, for an odd n with n + 4 not a sum of two squares, every amphichiral knot with determinant n has braid index at least five; we test this on 4,999 amphichiral knots of Burton's census with up to 19 crossings whose determinant satisfies this hypothesis.

Statement

A knot KK is ++amphichiral if it is isotopic to its mirror image, −-amphichiral if it is isotopic to the reverse of its mirror image, and amphichiral if one of the two holds. The determinant of a knot is odd, and for every amphichiral knot it is a sum of two squares [8 Remark (7), via Goeritz].

Theorem 1. {det⁡K:K an amphichiral knot of braid index ≤3}={n odd:n and n+4 are sums of two squares}\{\det K : K\text{ an amphichiral knot of braid index }\le3\} = \{n\text{ odd} : n\text{ and }n+4\text{ are sums of two squares}\}.

Here 0 counts as a square (so 5, the determinant of the figure-eight knot, belongs to the right-hand side: 5=22+125 = 2^2 + 1^2, 9=02+329 = 0^2 + 3^2). Among the odd sums of two squares the first ones excluded by the condition on n+4n+4 are

This work was developed in collaboration with the AI system Claude Code (Anthropic): the choice of problem, the direction of the work and the computing hardware are due to the author (a sculptor); the formalisation, the algorithms and the proofs were developed by Claude Code (Anthropic) working with the author. The collaboration is stated as a fact, not a disclaimer; details are in the section on tool use at the end. 17, 29, 53, 65, 73. Braid index 1 and 2 contribute only the unknot (n=1n = 1), since the torus knots T(2,p)T(2,p), ∣p∣≥3|p| \ge3, are chiral.

Corollary 2. If nn is odd and n+4n + 4 is not a sum of two squares, every amphichiral knot with determinant nn has braid index at least 5.

Proof. By Theorem 1 the braid index is at least 4, and the braid index of an amphichiral knot is odd [9 Theorem A] (the proof is one line: by the theorem of Dynnikov and Prasolov [5 Theorem 9] (the Jones conjecture) all minimal braids of a knot have the same exponent sum, so a minimal braid of an amphichiral knot has exponent sum 0 [9 Lemma 3.3 and eq. (1)], and the parity of the permutation of a braid whose closure is a knot then makes the number of strands odd). □

Jung asks [9 Question 2] whether invariants such as the determinant can be “detected or computed from the braid word”. For amphichiral knots of braid index three, Lemmas 4 and 5 below compute the determinant from the word, and Theorem 1 describes the values that occur. (The author of [13, 14, 15, 16, 17] is the same person; we keep the spelling of each publication.)

Conventions and what is used from the literature

B3=⟨σ1,σ2⟩B_3 = \langle\sigma_1,\sigma_2\rangle, Δ=σ1σ2σ1\Delta= \sigma_1\sigma_2\sigma_1, C=Δ2=(σ1σ2)3C = \Delta^2 = (\sigma_1\sigma_2)^3. For a sequence s=(e0,…,eL−1)s = (e_0,\ldots,e_{L-1}) of positive integers, LL even, the alternating word of ss is σ1e0σ2−e1σ1e2⋯σ2−eL−1\sigma_1^{e_0}\sigma_2^{-e_1}\sigma_1^{e_2}\cdots\sigma_2^{-e_{L-1}}. Let U(e)=(1e01)U(e) = \begin{pmatrix}1 & e \\ 0 & 1\end{pmatrix}, L(e)=(10e1)L(e) = \begin{pmatrix}1 & 0 \\ e & 1\end{pmatrix}, J=(0110)J = \begin{pmatrix}0 & 1 \\ 1 & 0\end{pmatrix} and M(s)=U(e0)L(e1)U(e2)⋯L(eL−1)M(s) = U(e_0)L(e_1)U(e_2)\cdots L(e_{L-1}). These are the matrices of the reduced Burau representation at t=−1t=-1 (σ1↦U(1)\sigma_1 \mapsto U(1), σ2↦L(−1)\sigma_2 \mapsto L(-1), so σ1e↦U(e)\sigma_1^{e} \mapsto U(e) and σ2−e↦L(e)\sigma_2^{-e} \mapsto L(e)). For a closed 3-braid knot with Burau matrix MM at t=−1t=-1 one has det⁡=∣2−tr⁡M∣\det= |2-\operatorname{tr} M|: Datta [4 §5] states ΔL(−1)=iw(θ−2)\Delta_L(-1) = i^w(\theta-2) for the closure of any 3-braid, ww its writhe and θ\theta the trace of its matrix (with our convention), and it also follows from (1+t+t2)Δ(t)≐det⁡(I−ψt(β))(1+t+t^2)\Delta(t) \doteq\det(I-\psi_t(\beta)); we checked it against SnapPy on random 3-braid knots. For M(s)=(abcd)M(s) = \begin{pmatrix}a & b \\ c & d\end{pmatrix} all entries are nonnegative and ad=1+bc≥1ad = 1+bc \ge1, so tr⁡M(s)=a+d≥2\operatorname{tr} M(s) = a+d \ge2 and det⁡=tr⁡M(s)−2\det= \operatorname{tr} M(s)-2. General determinant formulas for closed 3-braids are in [3 Theorem 3.1, from Qazaqzeh–Chbili]. rotr⁡(s)=(er,er+1,…)\operatorname{rotr}(s) = (e_r,e_{r+1},\ldots) (indices mod LL) and rev⁡(s)=(eL−1,…,e0)\operatorname{rev}(s) = (e_{L-1},\ldots,e_0).

Types. ss is of positive type if s=rotr⁡(s)s = \operatorname{rotr}(s) for some odd rr, and of negative type if ei=ek−ie_i = e_{k-i} for all ii for some odd kk (equivalently, ss is rev⁡(s)\operatorname{rev}(s) rotated by an even amount).

From the literature. (i) Birman and Menasco classified closed 3-braids [1]: every conjugacy class of B3B_3 contains a Schreier normal form, unique up to cyclic permutation of the syllables after CkC^k, either Ckσ1−p1σ2q1⋯σ1−prσ2qrC^k\sigma_1^{-p_1}\sigma_2^{q_1}\cdots\sigma_1^{-p_r}\sigma_2^{q_r} (r,pi,qi≥1r,p_i,q_i \ge1, “generic”) or one of Ckσ1p1σ2q1C^k\sigma_1^{p_1}\sigma_2^{q_1}, Ckσ1σ2C^k\sigma_1\sigma_2, Ckσ1σ2σ1C^k\sigma_1\sigma_2\sigma_1, Ckσ1σ2σ1σ2C^k\sigma_1\sigma_2\sigma_1\sigma_2 [1 pp. 104–105]; oriented links of braid index ≤3\le3 are determined by the conjugacy class of a 3-braid representative up to the unknot, the torus links of type (2,p)(2,p) and the flype case, in which a word and its reverse represent the same link [1 pp. 76–77, 106–107]. Their Corollary 7.1 B [1 p. 107] describes the ++amphichiral generic closures by the condition that rot⁡1(A)\operatorname{rot}_{1}(A) agrees with the array AA up to an even rotation, i.e. A=rot⁡odd(A)A=\operatorname{rot}_{\mathrm{odd}}(A) (positive type), and k=0k=0; it has no flype clause—636_3, the closure of σ1−1σ22σ1−2σ2\sigma_1^{-1}\sigma_2^2\sigma_1^{-2}\sigma_2, is ++amphichiral but only of negative type—and does not treat −-amphichirality. (ii) Amphichiral 3-braid links. Stoimenov [13 Theorem 1.1(a)] proves that an orientedly amphicheiral 3-braid link (positively or negatively [13 Definition 2.2]) is the closure of an alternating 3-braid whose Schreier vector S=(p1,−q1,…,ps,−qs)S=(p_1,-q_1,\ldots,p_s,-q_s) admits a “dihedral (anti)symmetry”, i.e. can be turned into −S-S by cyclic permutation and inversion [13 p. 448]; a rotation by rr changes all signs iff rr is odd, and a reflection i↦k−ii\mapsto k-i does iff kk is odd, so these are exactly our two types. His proof bypasses the method of [1] (his Remark 3.2; it goes back to [16 Theorem 6.2]), relying on [1] only for where flypes can occur (for the equality of writhes he cites [1] or, alternatively, his own earlier work). For prime knots, Jung [9 Theorems 4.13 and B, the symmetry type in Theorem C] gives the same description, with the flype case (k,1,1,k)(k,1,1,k); in his terms positive type is “odd period” and negative type “palindrome” [9 §4, eq. (2)]. The two families, with the proof that their closures are amphichiral (our Lemma 3), also appear (for words with at least two pairs of syllables) as family (3) in Lisca’s theorem on 3-braid knots of finite concordance order [11 Theorem 1.1]; he does not consider which determinants occur. That the alternating half follows from [1] is also noted in [15 Prop. 7.1(2)]. For completeness we give the short derivation from [1] in Proposition 7.

Lemmas

Lemma 3 (symmetry). Up to conjugation, the mirror image followed by conjugation with Δ\Delta sends the alternating word of ss to that of rot⁡1(s)\operatorname{rot}_{1}(s), and reading the word backwards sends it to that of rot⁡1(rev⁡s)\operatorname{rot}_{1}(\operatorname{rev}s). Rotation of ss by an even amount is conjugation. Hence a closure of an alternating word of positive type is ++amphichiral and one of negative type is −-amphichiral.

Proof. The mirror image of σ1e0σ2e1⋯\sigma_1^{e_0}\sigma_2^{e_1}\cdots is σ1−e0σ2−e1⋯\sigma_1^{-e_0}\sigma_2^{-e_1}\cdots; conjugation by Δ\Delta exchanges σ1\sigma_1 and σ2\sigma_2, giving σ2−e0σ1−e1σ2−e2⋯\sigma_2^{-e_0}\sigma_1^{-e_1}\sigma_2^{-e_2}\cdots, a cyclic permutation of the alternating word of rot⁡1(s)\operatorname{rot}_{1}(s). Reading backwards gives σ2−eL⋯σ1−e2σ2−e1σ1−e0\sigma_2^{-e_L}\cdots\sigma_1^{-e_2}\sigma_2^{-e_1}\sigma_1^{-e_0}, a cyclic permutation of the alternating word of rot⁡1(rev⁡s)\operatorname{rot}_{1}(\operatorname{rev}s); its closure is the knot with reversed orientation (rotate the closed braid by π\pi about a line that meets the braid axis at a right angle: the letters keep their signs and indices and their cyclic order is reversed). If s=rot⁡r(s)s=\operatorname{rot}_{r}(s) with rr odd, then rot⁡1(s)=rot⁡1−r(s)\operatorname{rot}_{1}(s)=\operatorname{rot}_{1-r}(s) with 1−r1-r even, so the mirror image is isotopic to the knot. If rev⁡s\operatorname{rev}s is ss rotated by an even amount, the mirror image and the reverse are closures of conjugate words. □\square

Lemma 4 (negative type). If ss is of negative type and the closure of its alternating word is a knot, it has det⁡=(a−d)2+(b+c)2\det=(a-d)^2+(b+c)^2 and det⁡+4=(a+d)2+(b−c)2\det+4=(a+d)^2+(b-c)^2 for a nonnegative integer matrix W=(abcd)W=\begin{pmatrix}a&b\\c&d\end{pmatrix} with ad−bc=1ad-bc=1.

Proof. Let ei=ek−ie_i=e_{k-i} with kk odd, k∈{1,…,L−1}k\in\{1,\ldots,L-1\}, and r=(k+1)/2r=(k+1)/2. Then f=rot⁡r(s)f=\operatorname{rot}_r(s) satisfies fi=fL−1−if_i=f_{L-1-i}, i.e. f=(h,rev⁡h)f=(h,\operatorname{rev}h) with h=(f0,…,fL/2−1)h=(f_0,\ldots,f_{L/2-1}). The cyclically rotated product of M(s)M(s) starting at index rr equals M(f)M(f) if rr is even and JM(f)JJM(f)J if rr is odd (since JU(e)J=L(e)JU(e)J=L(e)); in both cases tr⁡M(f)=tr⁡M(s)\operatorname{tr}M(f)=\operatorname{tr}M(s). Let W=∏i<L/2Fi(fi)W=\prod_{i<L/2}F_i(f_i) with Fi=UF_i=U for ii even and Fi=LF_i=L for ii odd. Since U(e)T=L(e)U(e)^{\mathsf T}=L(e) and the indices L/2−1−jL/2-1-j and L/2+jL/2+j have different parity, WTW^{\mathsf T} is the product of the remaining factors of M(f)M(f), so M(f)=WWTM(f)=WW^{\mathsf T}. WW is a product of nonnegative unimodular matrices, so det⁡W=1\det W=1 and tr⁡(WWT)=a2+b2+c2+d2\operatorname{tr}(WW^{\mathsf T})=a^2+b^2+c^2+d^2. Hence det⁡=tr⁡M−2=a2+b2+c2+d2−2(ad−bc)=(a−d)2+(b+c)2\det=\operatorname{tr}M-2=a^2+b^2+c^2+d^2-2(ad-bc)=(a-d)^2+(b+c)^2 and det⁡+4=(a+d)2+(b−c)2\det+4=(a+d)^2+(b-c)^2.

Lemma 5 (positive type). If ss is of positive type and the closure of its alternating word is a knot, its determinant nn is a sum of two squares, and n+4n+4 is a sum of two squares.

Proof. Let s=rot⁡r(s)s=\operatorname{rot}_r(s) with rr odd. The self-rotations of ss form a subgroup of Z/L\mathbb{Z}/L, so g=gcd⁡(r,L)g=\gcd(r,L) is a self-rotation; gg is odd and L=gmL=gm with mm even. Let VV be the product of the first gg factors of M(s)M(s). The jj-th block of gg factors starts at index jgjg, which has the parity of jj, so the blocks are alternately VV and JVJJVJ, and M(s)=(V⋅JVJ)m/2=(VJ)mM(s)=(V\cdot JVJ)^{m/2}=(VJ)^m with det⁡(VJ)=−1\det(VJ)=-1. Write m=2νom=2^\nu o with oo odd, ν≥1\nu\geq1, N0=(VJ)oN_0=(VJ)^o (det⁡N0=−1\det N_0=-1), x=tr⁡N0x=\operatorname{tr}N_0, and τj=tr⁡N02j\tau_j=\operatorname{tr}N_0^{2^j}. From tr⁡(X2)=(tr⁡X)2−2det⁡X\operatorname{tr}(X^2)=(\operatorname{tr}X)^2-2\det X: τ1=x2+2\tau_1=x^2+2 and τj+1=τj2−2\tau_{j+1}=\tau_j^2-2 for j≥1j\geq1. Hence n=τν−2n=\tau_\nu-2 equals x2x^2 for ν=1\nu=1, equals (x2+2)2−4=x2(x2+4)(x^2+2)^2-4=x^2(x^2+4) for ν=2\nu=2, and for ν≥3\nu\geq3, by induction using τν−2=(τν−1−2)(τν−1+2)\tau_\nu-2=(\tau_{\nu-1}-2)(\tau_{\nu-1}+2) and τν−1+2=τν−22\tau_{\nu-1}+2=\tau_{\nu-2}^2,

n=S2(x2+4),S=x∏i=1ν−2τi(ν≥2).n=S^2(x^2+4),\qquad S=x\prod_{i=1}^{\nu-2}\tau_i\quad(\nu\geq2).

so n=(Sx)2+(2S)2n=(Sx)^2+(2S)^2. Finally n+4=x2+22n+4=x^2+2^2 for ν=1\nu=1 and n+4=τν+2=τν−12n+4=\tau_\nu+2=\tau_{\nu-1}^2 for ν≥2\nu\geq2.

Lemma 6 (converse). If nn is odd and nn and n+4n+4 are sums of two squares, there is a sequence of negative type whose alternating word closes to a knot with determinant nn.

Proof. Write n=u2+v2n=u^2+v^2, n+4=p2+q2n+4=p^2+q^2 with u,v,p,q≥0u,v,p,q\geq0. Each representation has one odd and one even component; let uo,pou_o,p_o be the odd ones. If po>uop_o>u_o, let u,pu,p be the odd components (then p≥u+2p\geq u+2 and q2<v2q^2<v^2); otherwise let u,pu,p be the even ones (then q=po≤v=uoq=p_o\leq v=u_o and p2−u2≥4p^2-u^2\geq4). Put

a=(p+u)/2a=(p+u)/2, d=(p−u)/2d=(p-u)/2, b=(v+q)/2b=(v+q)/2, c=(v−q)/2c=(v-q)/2. These are nonnegative integers with ad−bc=(p2+q2−u2−v2)/4=1ad-bc=(p^2+q^2-u^2-v^2)/4=1, b≥1b\ge1 (in both cases v≥1v\ge1: in the first v2>q2v^2>q^2, in the second vv is odd), so W=(abcd)≠IW=\begin{pmatrix}a&b\\c&d\end{pmatrix}\ne I, and a−c=(p+u+q−v)/2>0a-c=(p+u+q-v)/2>0 (as p+q≥n+4>vp+q\ge\sqrt{n+4}>v).

Row dominance. A nonnegative integer matrix W≠IW\ne I with det⁡W=1\det W=1 has one row entrywise ≥\ge the other: otherwise either a>ca>c, b<db<d and ad−bc≥(c+1)(b+1)−bc=b+c+1ad-bc\ge(c+1)(b+1)-bc=b+c+1, which equals 1 only for W=IW=I; or a<ca<c, b>db>d and ad−bc≤(c−1)(b−1)−bc≤0ad-bc\le(c-1)(b-1)-bc\le0; and both rows dominating each other gives det⁡W=0\det W=0. If the top row dominates, W=U(1)W′W=U(1)W', otherwise W=L(1)W′W=L(1)W', with W′W' nonnegative, det⁡W′=1\det W'=1 and entry sum smaller by c+dc+d resp. a+ba+b, which is ≥1\ge1; so the process terminates at W′=IW'=I, and WW is a product of factors U(1)U(1) and L(1)L(1). Collecting equal neighbours, W=U(h0)L(h1)⋯W=U(h_0)L(h_1)\cdots with all hi≥1h_i\ge1; it starts with UU because a>ca>c. Then s=(h,rev⁡h)s=(h,\operatorname{rev}h) is of negative type with M(s)=WWTM(s)=WW^{\mathsf T} as in Lemma 4, so its determinant is (a−d)2+(b+c)2=u2+v2=n(a-d)^2+(b+c)^2=u^2+v^2=n.

Knot. tr⁡M(s)=n+2\operatorname{tr}M(s)=n+2 is odd, so M(s) mod 2M(s)\bmod2 has order 3 in SL(2,F2)≅S3SL(2,\mathbb F_2)\cong S_3; since σ1↦U(1)\sigma_1\mapsto U(1) and σ2−1↦L(1)\sigma_2^{-1}\mapsto L(1) modulo 2 send the generators to two distinct transpositions, this is the permutation of the braid up to an automorphism of S3S_3, and it is a 3-cycle. □

Proof of Theorem 1

Proposition 7 ([13 Thm. 1.1(a)]; for prime knots [9 Theorems 4.13 and B]). An amphichiral knot KK of braid index 3 is the closure of an alternating word of positive or negative type.

Derivation from [1]. Let WW be the Schreier normal form of a 3-braid representing KK. The closures of Ckσ1C^k\sigma_1 and Ckσ1σ2σ1C^k\sigma_1\sigma_2\sigma_1 are not knots (the permutation is not a 3-cycle), and Ckσ1σ2C^k\sigma_1\sigma_2, Ckσ1σ2σ1σ2C^k\sigma_1\sigma_2\sigma_1\sigma_2 close to torus knots T(3,m)T(3,m), 3∤m3\nmid m, which have braid index ≤2\le2 for ∣m∣≤2|m|\le2; for ∣m∣≥4|m|\ge4 they cannot be amphichiral of braid index 3: WW would be a minimal braid with exponent sum 6k+26k+2 resp. 6k+4≠06k+4\ne0, while a minimal braid of an amphichiral knot has exponent sum 0 (by Dynnikov–Prasolov [5 Theorem 9], as in [J, Lemma 3.3 and eq. (1)]). (They are chiral in any case; their signatures were computed by Hirzebruch, Murasugi and Shinohara, as cited in [6 §2].) So $W=C^k\sigma_1^{-p_1}\sigma_2^{q_1}\cdots\sigma_1^{-p_r}\sigma_2^{q_r}$ with array $A=(p_1,q_1,\ldots,p_r,q_r)$. Let $W^*$ be the mirror word and $W^\leftarrow$ the word read backwards. If $K$ is $+$amphichiral, $W^*$ and $W$ represent the same oriented knot; if $-$amphichiral, $W^*$ and $W^\leftarrow$ do. By the classification {citep}[1 pp. 76–77, 106–107] (braid index 3; in the flype case a word and its reverse represent the same knot) this gives $W^*\sim W$ or $W^*\sim W^\leftarrow$ in both cases. The normal form of $W^*$ is $C^{-k}$ with array $\operatorname{rot}_1(A)$ {citep}[1 p. 107]`, that of W←W^\leftarrow is CkC^k with array rot⁡1(rev⁡A)\operatorname{rot}_1(\operatorname{rev} A) (reading backwards gives Ckσ2qrσ1−pr⋯σ2q1σ1−p1C^k\sigma_2^{q_r}\sigma_1^{-p_r}\cdots\sigma_2^{q_1}\sigma_1^{-p_1}, cyclically Ckσ1−p1σ2q1C^k\sigma_1^{-p_1}\sigma_2^{q_1}), and two generic normal forms are conjugate iff the powers of CC agree and the arrays agree up to an even rotation. Hence k=0k=0, and A=rot⁡odd(A)A=\operatorname{rot}_{\mathrm{odd}}(A) or AA is rev AA rotated by an even amount. With k=0k=0, WW is the mirror of the alternating word of AA, i.e. Lemma 3 conjugate to the alternating word of rot⁡1(A)\operatorname{rot}_1(A), and both conditions are invariant under rotation. □\square

Proof of Theorem 1. “⊆\subseteq”: braid index 1 gives n=1=12+02n=1=1^2+0^2, n+4=5=12+22n+4=5=1^2+2^2; braid index 2 gives no amphichiral knot; braid index 3 is covered by Proposition 7 with Lemmas 4 and 5. “⊇\supseteq”: Lemma 6 gives a word of negative type closing to a knot with determinant nn; the knot is −-amphichiral by Lemma 3 and has braid index ≤3\leq3. □\square

Remarks

Remark 8 (composite knots and small determinants). The closure of σ1pσ2−p\sigma_1^p\sigma_2^{-p} (s=(p,p)s=(p,p), pp odd) is the connected sum of T(2,p)T(2,p) with its mirror image, with determinant p2p^2. For n=1,9,49n=1,9,49 — the three values excluded in Stoimenow’s conjecture on prime alternating achiral knots [14] — the only sequences of positive or negative type, up to rotation, are (1,1)(1,1), (3,3)(3,3), (7,7)(7,7): the unknot, and the connected sums of 313_1 resp. 717_1 with their mirror images. The search is finite because det⁡≥(∑i evenei)(∑i oddei)\det\geq\left(\sum_{i\ \mathrm{even}}e_i\right)\left(\sum_{i\ \mathrm{odd}}e_i\right): the trace is a polynomial in the exponents with nonnegative coefficients and constant term 2 (all exponents 0 give the identity), in which every product of one UU- and one LL-exponent occurs with coefficient 1.

Remark 9 (Stoimenow’s conjecture). Stoimenow conjectured [14 Conjecture 4.20, Conjecture 4.2 in arXiv v3]: an odd nn is the determinant of a prime alternating achiral knot iff nn is a sum of two squares and n∉{1,9,49}n\notin\{1,9,49\}; he settled the nn with a representation by coprime components and the squares, and reports the conjecture true for n≤2000n\leq2000. Up to 10,693 (the largest determinant among the verified amphichiral prime alternating knots of Burton’s census, which go up to 18 crossings — alternating amphichiral knots have even crossing number) there remain 169 odd n>2000n>2000 not settled by him (sums of two squares that are not squares and have no representation by coprime components); for 74 of them n+4n+4 is not a sum of two squares, so by Corollary 2 any witness has braid index at least 5. Ferudun [7] realizes every n≤106n\leq10^6 left open by Stoimenow (unrefereed). Of the 74, 26 have no witness in the census: 6309, 6413, 7281, 7301, 7857, 8361, 8433, 8477, 8793, 8973, 8993, 9065, 9081, 9117, 9225, 9245, 9297, 9477, 9621, 9873, 10125, 10161, 10377, 10413, 10469, 10629. Forty-one further alternating census knots with 14 to 18 crossings, amphichiral according to SnapPy’s numerical symmetry group, stayed undecided in our verified computation; none of their determinants is among these 26. For 25 of the 26 we found witnesses that are closures of 5-braid words Uρ(U)U\rho(U), where UU is a word in σ1,σ2−1,σ3,σ4−1\sigma_1,\sigma_2^{-1},\sigma_3,\sigma_4^{-1} and ρ(U)\rho(U) is UU read backwards with each σi±1\sigma_i^{\pm1} replaced by σ5−i∓1\sigma_{5-i}^{\mp1}; they are prime (verified hyperbolic), alternating (reduced alternating diagrams of 20 to 26 crossings), verified −-amphichiral, with Morton–Franks–Williams bound 5, so of braid index exactly 5; details in the deposit [Z]. The remaining value, n=6413n=6413, is covered only by [7]. No knot that is the closure of a word Uρ(U)U\rho(U) with UU of at most 20 letters (all 4m4^m words UU for each 1≤m≤201 \le m \le20; their closures are braid diagrams of 2m≤402m \le40 crossings) has determinant 6413.

Remark 10 (the alternating half without the classification). That an amphichiral knot of braid index 3 is alternating also follows without the classification theorem of [1]. The non-generic normal forms are excluded as in the first lines of the proof of Proposition 7. For a generic form W=Ckσ1−p1σ2q1⋯σ1−prσ2qrW=C^k\sigma_1^{-p_1}\sigma_2^{q_1}\cdots\sigma_1^{-p_r}\sigma_2^{q_r} write P=∑piP=\sum p_i, Q=∑qiQ=\sum q_i; Erle’s Theorem 2.6(iv) [6] states σ=P−Q−4k\sigma=P-Q-4k, which equals 2k−e(W)2k-e(W), ee the exponent sum; his printed proof treats Q≥3Q \ge3 with k≥1k \ge1 and with k≤−1k \le-1 (the remaining cases are left as an exercise); we use only the case k≤−1k \le-1, Q≥3Q \ge3, and only that σ≠0\sigma\ne0 there, which does not depend on the sign convention for σ\sigma. For a minimal braid of an amphichiral knot e(W)=0e(W)=0 (by Dynnikov–Prasolov [5 Theorem 9], as in [9 Theorem 3.2, Lemma 3.3, eq. (1)]) and σ=0\sigma=0. Suppose k≠0k \ne0; then P=Q+6kP=Q+6k. If k≤−1k \le-1, Q=P−6k≥7Q=P-6k \ge7; if k≥1k \ge1, the mirror of WW, conjugated by Δ\Delta and cyclically rotated, is the generic form with C−kC^{-k} and the roles of the pip_i and qiq_i exchanged, whose QQ is P≥7P \ge7, and σ\sigma changes sign under mirroring. Either way σ=±2k≠0\sigma=\pm2k \ne0, a contradiction; so k=0k=0 and WW is alternating. The same argument with the extreme degrees of the Jones polynomial in place of Dynnikov–Prasolov is Chbili’s [3 Proposition 5.1]. Stoimenov’s proof of [13 Theorem 1.1] also bypasses the classification, as described in §2.

Remark 11 (context). Datta [4] relates links of braid index ≤3\le3 to binary quadratic forms of discriminant θ2−4\theta^2-4, θ\theta the trace of the Burau matrix at t=−1t=-1; for the knots here θ=n+2\theta=n+2 and the discriminant is n(n+4)n(n+4). He does not consider amphichirality. For ν=1\nu=1 in Lemma 5 the alternating word is of the form γγˉ\gamma\bar{\gamma}, with γˉ\bar{\gamma} obtained from γ\gamma by σi+1↦σ3∓1\sigma_i^{+1}\mapsto\sigma_3^{\mp1} (as in [17 p. 10]), and the square determinant can be explained as Stoimenow does for the Turk’s head braids (σ1σ2−1)k(\sigma_1\sigma_2^{-1})^k with kk odd (this is the case ν=1\nu=1; the closure is a knot iff 3∤k3\nmid k), through strong achirality and Hartley–Kawauchi [17 Theorems 3.1, 3.2].

Checks

Braid index test of “⊆\subseteq”. Contrapositive: an amphichiral knot whose determinant nn has n+4n+4 not a sum of two squares must have braid index ≥5\ge5. (a) KnotInfo [10], ≤12\le12 crossings, tabulated braid index: of the 78 amphichiral knots, the 22 of braid index ≤3\le3 all satisfy the condition, and the 22 that violate it (a different set of knots) all have braid index ≥5\ge5; without amphichirality the implication fails (107 chiral knots of braid index 3 have n+4n+4 not a sum of two squares, the first being 5₂). (b) Burton’s census [2], ≤19\le19 crossings, amphichirality verified with SnapPy [12] (knots left undecided by the verified computation are not counted): 3,049 alternating and 1,950 non-alternating knots violate the condition. The Morton–Franks–Williams lower bound is ≥4\ge4 for all alternating ones and for 1,892 of the others; the remaining 58 have Jones span smaller than the crossing number, so they are not alternating (the census crossing numbers are exact), and by the argument of Remark 10, which does not use the classification of [1], they do not have braid index 3. None of the 4,999 has braid index 3; with the odd braid index [9 Theorem A], all have braid index ≥5\ge5. These checks are consistent with Theorem 1; by their nature they cannot prove it.

Other checks. Lemmas 4, 5, 6 and the type conditions were checked by exhaustive enumeration on small boxes, and the relation det⁡=∣2−tr⁡M∣\det= \lvert2 - \operatorname{tr} M \rvert against SnapPy for random 3-braid knots; scripts and logs are in the deposit [Z].

Tool use

This work was prepared with substantial use of Claude Code (Anthropic), an agentic AI system based on large language models, working together with the author.

  • Mathematics. The proofs were worked out by Claude Code under the author’s direction.

  • Writing and typesetting. The text and the LaTeX source were written by Claude Code, in English.

  • Code. The checks were written and run by Claude Code in Python, with SnapPy [12], Sage and the KnotInfo database [10]; the 5-braid search of Remark 9 ran as a CUDA kernel through CuPy on a GPU.

  • Checking. The argument and drafts of this note were read by separate Claude Code agents in independent cold reads and by outside AI readers (Claude in a web browser, DeepSeek and ChatGPT). Their findings were checked and incorporated where they held.

  • Literature. The search was done by a Claude Code agent (web and bibliographic databases), with the author by hand (Google Scholar, Math-Overflow) and, by Claude Code, through the arXiv API; an outside AI reader (Claude in a web browser) suggested further sources. [17] was found in the author’s search and [13] was pointed out by an outside AI reader (Claude in a web browser), both only after the argument was written.

The author takes full responsibility for all contents.

Data and code

Scripts and their outputs are in the deposit [Z] on Zenodo; its README describes which files support the computational checks.

Wasserburg am Inn, Bavaria, Germany

Email address: [email protected]

References

  1. [1][BM] J. S. Birman, W. W. Menasco, Studying links via closed braids III: Classifying links which are closed 3-braids, Pacific J. Math. 161 (1993) 25–113.DOI
  2. [2][Bu] B. A. Burton, census of prime knots up to 19 crossings, data files https://people.smp.uq.edu.au/BenjaminBurton/knots/, linked from https://regina-normal.github.io/data.html (downloaded 2026).
  3. [3][Ch] N. Chbili, A note on the Jones polynomials of 3-braid links, Siberian Math. J. 63 (2022) 983–994.DOI
  4. [4][D] A. Datta, A novel connection between integral binary quadratic forms and knot polynomials, arXiv:2204.13660v1 (2022).arxiv.org/abs/2204.13660
  5. [5]I. Dynnikov, M. Prasolov, Bypasses for rectangular diagrams. Proof of Jones’ conjecture and related questions, arXiv:1206.0898v2 (2013); journal reference given there: Proc. of Moscow Math. Soc. 74 (2013), no. 1, 115–173; English translation: Trans. Moscow Math. Soc. 74 (2013) 97–144.arxiv.org/abs/1206.0898
  6. [6]D. Erle, Calculation of the signature of a 3-braid link, Kobe J. Math. 16 (1999) 161–175.DOI
  7. [7]A. Ferudun, Determinants of prime alternating achiral knots: a partial answer to a problem of Stoimenow, Zenodo, 10.5281/zenodo.23482759 (2026).DOI
  8. [8]R. Hartley, A. Kawauchi, Polynomials of amphicheiral knots, Math. Ann. 243 (1979) 63–70.DOI
  9. [9]Hyungseok Jung, Amphichiral knots: odd braid index and symmetry classification in the three-braid case, arXiv:2609.12295v1 (2026).arxiv.org/abs/2609.12295
  10. [10]C. Livingston, A. H. Moore, KnotInfo: Table of Knot Invariants, knotinfo.org (accessed 2026).
  11. [11]P. Lisca, On 3-braid knots of finite concordance order, Trans. Amer. Math. Soc. 369 (2017), no. 7, 5087–5112; arXiv:1504.03129v3.arxiv.org/abs/1504.03129
  12. [12]M. Culler, N. M. Dunfield, M. Goerner, J. R. Weeks, SnapPy, version 3.3.2.
  13. [13]A. Stoimenov, The classification of partially symmetric 3-braid links, Open Math. 13 (2015) 444–470, 10.1515/math-2015-0043.DOI
  14. [14]A. Stoimenow, Square numbers, spanning trees and invariants of achiral knots, Comm. Anal. Geom. 13 (2005) 591–631; Conjecture 4.20 there; also arXiv:math/0003172v3, Conjecture 4.2 there.
  15. [15]A. Stoimenow, Square numbers and polynomial invariants of achiral knots, Math. Z. 255 (2007) 703–719.DOI
  16. [16]A. Stoimenow, Non-triviality of the Jones polynomial and the crossing numbers of amphicheiral knots, arXiv:math/0606255v2 (2007).arxiv.org/abs/math/0606255
  17. [17]A. Stoimenow, Wheel graphs, Lucas numbers and the determinant of a knot, preprint, Max-Planck-Institut für Mathematik (2000).

Paper details

vlnc:W_n48ehgve
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents