Finite graphs and configurations of points
arXiv:2508.13472 · doi:10.1016/j.geomphys.2026.105993
Abstract
We generalize the Atiyah problem on configurations and the related Atiyah--Sutcliffe conjectures 1 and 2 using finite graphs, configurations of points and tensors. Our conjectures are intriguing geometric inequalities, defined using the pairwise directions of the configuration of points, just as in the original problem. The generalization of the Atiyah determinant to our setting is no longer a determinant. We call it the -amplitude function, where is a finite simple graph, in analogy with probability amplitudes in quantum physics. If is the complete graph with vertices, we recover the Atiyah--Sutcliffe conjectures 1 and 2.
arXiv comment19 pages, 5 figures
References in corpus (5)
- Tensor networks for complex quantum systems
- Hand-waving and Interpretive Dance: An Introductory Course on Tensor Networks
- The Geometry of Point Particles
- A proof of Atiyah's conjecture on configurations, of four points in Euclidean three-space
- A new proof of Atiyah's conjecture on configurations of four points