ResearchAI Research

Colombo's Difference-Power Determinant Conjecture Fully Proven

Kun Li, Li Tie, Peng Wang, Zihan Liu· August 31, 2026 View original

Key takeaways

  • Colombo's 1928 conjecture on difference-power matrix determinants is now fully proven.
  • The proof addresses the remaining open cases of supercritical odd exponents.
  • It confirms that the rank of $A_d(\lambda)$ is $\min\{n, d+1\}$ for all $d$.
  • This is a significant advancement in fundamental matrix theory.

Who benefits

ResearchAcademiaAdvanced Computing

Summary

Researchers have provided an algebraic proof completing Colombo's 1928 conjecture regarding the nonsingularity of difference-power matrices for all supercritical odd exponents. This proof establishes that the rank of these matrices is always the minimum of $n$ and $d+1$.

In 1928, mathematician Colombo made significant contributions to the understanding of difference-power matrices, proving that for an even $n \ge 2$ and distinct coordinates $\lambda$, the determinant of $A_{n-1}(\lambda)$ is non-zero and positive, and that the rank of $A_d(\lambda)$ is $d+1$ for $0 \le d < n-1$. He then conjectured that the determinant of $A_d(\lambda)$ would be non-zero for all $d \ge n-1$. For even values of $d$, the nonsingularity aspect of this conjecture had already been established through prior work on distance-power matrices. This left the cases of supercritical odd exponents, specifically $d \ge n+1$, as the remaining open problem. The current research presents an algebraic proof that successfully demonstrates the nonsingularity for all these remaining odd exponents, thereby fully completing Colombo's conjecture. A key outcome of this proof is the definitive establishment that the rank of $A_d(\lambda)$ is $\min\{n, d+1\}$ for all natural numbers $d$. The proof method involves converting a hypothetical kernel vector into a real binary form with more projective real linear factors than its real Waring length allows.

Why it matters

While highly theoretical, this fundamental mathematical proof could have long-term implications for fields relying on matrix theory, such as advanced signal processing, numerical analysis, and certain areas of theoretical computer science, by solidifying properties of specific matrix types.

Original post by Kun Li, Li Tie, Peng Wang, Zihan Liu

"arXiv:2608.28274v1 Announce Type: new Abstract: Let $n\ge2$ be even, let $\lambda=(\lambda_1,\ldots,\lambda_n)\in\mathbb{R}^n$ have pairwise distinct coordinates, and define the difference-power matrix \[ A_d(\lambda) := \bigl[(\lambda_r-\lambda_s)^d\bigr]_{r,s=1}^n, \qquad d\in\…"

View on X

Originally posted by Kun Li, Li Tie, Peng Wang, Zihan Liu on X · view source

Want to go deeper?

Turn these trends into skills with Learnijoy's hands-on AI & tech courses.

Explore courses

More in AI Research

AI ResearchAI Engineering & DevTools

New Optimizer Accelerates LLM Pretraining with Curvature-Conditioned Momentum

This research proposes a curvature-conditioned multiscale momentum method with sphere constraints to accelerate large language model pretraining. It addresses challenges from noise-dominant gradients and ill-conditioned loss landscapes by enhancing progress along flat directions, significantly improving upon existing adaptive optimizers like AdamW and Muon.

Shuchen Zhu, Yuxin Fang, Mingze Wang, Kun YuanAug 31, 2026
AI ResearchAI Engineering & DevTools

Euclidean Fourier Neural Operators Enhance Domain Transferability

This paper introduces Euclidean Fourier Neural Operators (EFNOs) as a domain-independent alternative to traditional FNOs, addressing their limitation in transferring across different periodic domains. EFNOs achieve this by parameterizing the spectral kernel as a continuous function of the physical wavevector, enabling consistent operator learning across varying domain shapes and sizes.

Nathanael Bosch, Niklas Frederik Schmitz, Michael F. HerbstAug 31, 2026
AI Engineering & DevToolsAI Research

SymboLLM-FE Boosts Feature Engineering with LLMs and Symbolic Regression

This paper introduces SymboLLM-FE, a novel approach combining symbolic regression and large language models for automated feature engineering on tabular data. It aims to generate highly interpretable and performant features while overcoming the limitations of traditional AutoFE and LLM-based methods.

Zi-Jian Cheng, Zi-Yi Jia, Zhi Zhou, Yu-Feng Li, Lan-Zhe GuoAug 31, 2026