arXiv (All)
open access
Finite graphs and configurations of points
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
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- The Köthe conjecture via point modules#1084968
- Connectivity keeping pendant extensions of paths in $k$-connected graphs and triangle-free graphs#1049373
- Optimization and complexity of inertia-type bounds on the independence and chromatic numbers of graph powers#1118536
- On the Visibility Polynomial of Graphs#128428
- Module Lattice Security (Part I): Unconditional Verification of Weber's Conjecture for $k \le 12$#31204
Record · ID 984065
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive