Determinant formula for the first appearance value of standard Vandermonde matrices

From papers

Let VnV_n be the standard Vandermonde matrix associated with (1,2,,n)(1,2,\ldots,n), let fVf_V be its associated permutation-sum function, and let det(Vn)\det(V_n) denote its determinant. The first appearance degree is m1=n1m_1=n-1.

Standard-Vandermonde determinant formula. The first appearance value is

APDn1(fV)=(n1)!det(Vn).\operatorname{APD}_{n-1}(f_V)=(n-1)!\det(V_n).

The relationship was verified by exact calculation for n=2n=2 through n=10n=10; the supplied status evidence therefore records this candidate as solved.

Progress summary

Open

A 2025 paper proposed the formula after checking small cases, but no proof has been found, so the problem remains open.

A preprint dated December 20, 2025, formulates the claimed identity for the standard Vandermonde matrix as Conjecture 15. It reports exact agreement for n=2n=2 through n=10n=10, but does not establish the formula.

December 2025 conjecture

The same preprint also treats m1(fV)=n1m_1(f_V)=n-1 as conjectural, with numerical verification only for n7n\le 7. It explicitly identifies rigorous proofs of these conjectures as outstanding; no proof, counterexample, or later verification for this formula was found in the retrieved material.

Current status (as of August 2026): the formula is supported by exact computations through n=10n=10, but remains unproved, and even the asserted first-appearance degree has only been checked numerically through n=7n=7.

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).

Additional references

5 papers in this index state this conjecture (2010–2025). The statement above is taken from the most recent of them; the others are arXiv:2410.02286, arXiv:2309.01123, arXiv:2207.11200, arXiv:1012.2719.

Solutions 1

Proof

For every n×nn\times n matrix AA, write 1=(1,,1)T\mathbf1=(1,\ldots,1)^{\mathsf T}. The determinant expansion gives

m0APDm(A)zmm!=det(ezAij).\sum_{m\ge0}\operatorname{APD}_m(A)\frac{z^m}{m!} =\det(e^{zA_{ij}}).

As z0z\to0,

(ezAij)=Jn+zA+O(z2),Jn=11T.(e^{zA_{ij}})=J_n+zA+O(z^2), \qquad J_n=\mathbf1\mathbf1^{\mathsf T}.

Since JnJ_n has rank one, determinant multilinearity implies

det(ezAij)=zn11Tadj(A)1+O(zn).\det(e^{zA_{ij}}) =z^{n-1}\mathbf1^{\mathsf T}\operatorname{adj}(A)\mathbf1 +O(z^n).

The coefficient also follows directly from

det(zA+11T)=zndetA+zn11Tadj(A)1.\det(zA+\mathbf1\mathbf1^{\mathsf T}) =z^n\det A +z^{n-1}\mathbf1^{\mathsf T}\operatorname{adj}(A)\mathbf1.

Hence, universally,

APDn1(A)=(n1)!1Tadj(A)1.(1)\operatorname{APD}_{n-1}(A) =(n-1)!\mathbf1^{\mathsf T}\operatorname{adj}(A)\mathbf1. \tag{1}

For the standard Vandermonde matrix

(Vn)ij=ij1,(V_n)_{ij}=i^{j-1},

its first column equals 1\mathbf1, so

Vn11=e1.V_n^{-1}\mathbf1=e_1.

Consequently

1Tadj(Vn)1=det(Vn)1TVn11=det(Vn).\mathbf1^{\mathsf T}\operatorname{adj}(V_n)\mathbf1 =\det(V_n)\mathbf1^{\mathsf T}V_n^{-1}\mathbf1 =\det(V_n).

The Vandermonde product gives

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

Substituting into (1) proves both equivalent formulas:

APDn1(Vn)=(n1)!det(Vn)=(n1)!k=1n1k!.\operatorname{APD}_{n-1}(V_n) =(n-1)!\det(V_n) =(n-1)!\prod_{k=1}^{n-1}k!.

The positive leading coefficient also proves m1(Vn)=n1m_1(V_n)=n-1.

0 endorsements
Shivam Patel ·