Indexed metadata

Colombo's Determinant Problem

Qianli Ma

Source record

Source: arXiv

Published: Aug 31, 2026

arXiv: 2609.00101

Open original source ↗

Source abstract

We completely solve Colombo's 1928 determinant problem. For distinct real x1,,xNx_1,\ldots,x_N, N2N\geq 2, and an integer D1D\geq 1, we prove that det[(xjxi)D]0\det[(x_j-x_i)^D]\neq 0 if and only if DN1D\geq N-1 and either NN is even or DD is even. The even-exponent case follows from Dyn--Goodman--Micchelli (1986); the remaining odd case is proved by a strict Pfaffian sign theorem. The new odd-exponent theorem and its complete proof chain have also been formalized in Lean 4.

Evidence graph

No public relationships recorded yet.

Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.