First appearance degree conjecture for row-shifted second-power lattices

From papers

Let AA be the nn-th order row-shifted second-power lattice with positive integer shift dd, whose entries are A[i,j]=(j+(i1)d)2A[i,j]=(j+(i-1)d)^2. Define

Tn1=n(n1)2.T_{n-1}=\frac{n(n-1)}{2}.

Row-shifted second-power lattice degree conjecture. For n2n \geq 2 and any positive integer dd,

m1(A)=Tn1.m_1(A)=T_{n-1}.

The source describes this as numerically confirmed, but gives no proof for arbitrary nn and dd.

Progress summary

Open

The conjecture has been checked numerically in small cases, but no proof or counterexample for arbitrary dimensions and shifts has been publicly reported.

The conjecture asserts that the first nonzero degree equals n(n1)2\frac{n(n-1)}{2} for every n2n\ge 2 and every positive integer shift dd. A recent paper records numerical confirmation through n=7n=7 and explicitly identifies a proof for all parameters as outstanding.

Current status (as of August 2026): Numerical cases through n=7n=7 are reported, but the assertion for arbitrary nn and positive integer dd remains open, with no public proof, counterexample, or verified resolution found.

Sources
Sources & referencesView supporting material

Primary source

Kenichi Takemura, “Alternating Power Difference and Matrix Symmetry: Closed-Form Formulas for the First Appearance Degree m_1”, arXiv:2512.18169 (2025).

Solutions 1

Proof

For any n×nn\times n matrix AA, the determinant expansion gives

m0APDm(A)zmm!=det(ezAij)i,j=1n.(1)\sum_{m\ge0}\operatorname{APD}_m(A)\frac{z^m}{m!} =\det(e^{zA_{ij}})_{i,j=1}^n. \tag{1}

Set T=(n2)T=\binom n2. First consider the multiplication table Mij=ijM_{ij}=ij. With y=ezy=e^z, the Vandermonde determinant gives

det(ezij)i,j=1n=det(yij)i,j=1n=yn(n+1)/21i<jn(yjyi).\det(e^{zij})_{i,j=1}^n =\det(y^{ij})_{i,j=1}^n =y^{n(n+1)/2} \prod_{1\le i<j\le n}(y^j-y^i).

Each factor satisfies yjyi=(ji)z+O(z2)y^j-y^i=(j-i)z+O(z^2). Since there are TT factors and

1i<jn(ji)=k=1n1k!,\prod_{1\le i<j\le n}(j-i)=\prod_{k=1}^{n-1}k!,

equation (1) yields

m1(M)=T,APDT(M)=T!k=1n1k!.m_1(M)=T,\qquad \operatorname{APD}_T(M)=T!\prod_{k=1}^{n-1}k!.

Now take the row-shifted second-power lattice

Aij=(j+(i1)d)2,d>0,A_{ij}=(j+(i-1)d)^2,\qquad d>0,

and put q=e2dzq=e^{2dz}. Since

Aij=j2+d2(i1)2+2d(i1)j,A_{ij}=j^2+d^2(i-1)^2+2d(i-1)j,

extracting row and column factors gives

det(ezAij)=exp(zj=1nj2+zd2i=0n1i2)qT0i<jn1(qjqi).\det(e^{zA_{ij}}) = \exp\left( z\sum_{j=1}^n j^2+ zd^2\sum_{i=0}^{n-1}i^2 \right) q^T \prod_{0\le i<j\le n-1}(q^j-q^i).

Because

qjqi=2d(ji)z+O(z2),q^j-q^i=2d(j-i)z+O(z^2),

this determinant has exact vanishing order TT and leading coefficient

(2d)Tk=1n1k!.(2d)^T\prod_{k=1}^{n-1}k!.

Therefore

m1(A)=(n2),APD(n2)(A)=(2d)(n2)((n2))!k=1n1k!.m_1(A)=\binom n2, \qquad \operatorname{APD}_{\binom n2}(A) =(2d)^{\binom n2} \left(\binom n2\right)! \prod_{k=1}^{n-1}k!.

Equivalently, if

VCore(n)=T!k=1n1k!,V_{\mathrm{Core}}(n)=T!\prod_{k=1}^{n-1}k!,

then

APDT(A)=(2d)TVCore(n).\operatorname{APD}_T(A)=(2d)^TV_{\mathrm{Core}}(n).

These identities hold for every n2n\ge2 and every positive integer dd.

0 endorsements
Shivam Patel ·