Colombo's Determinant Problem
Qianli Ma
Abstract
We completely solve Colombo's 1928 determinant problem. For distinct real x1,…,xN, N≥ 2, and an integer D≥ 1, we prove that [(xj-xi)D]≠ 0 if and only if D≥ N-1 and either N is even or D 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.
Create a lesson
Related papers
Smooth Diffeomorphisms and Mahler's Problem on Liouville Numbers
Diego Marques
From Common-Slot Chains to Heisenberg Central Products over Global Fields
Marina Palaisti
The shortest harmonic sums with decreasing denominator
Wouter van Doorn
Reducing Every Set of 36 Consecutive Integers to Zero by Differences of Squares
Zhao Shen, Youran Wu
Bounded gaps between primes
Julia Stadlmann
Large zeta sums and zeros of the Riemann zeta function
Zikang Dong, Ruihua Wang, Weijia Wang et al.