The graph-isomorphism conjecture for rational quadratic-form graphs
The graph-isomorphism conjecture for rational quadratic-form graphs
Let be quadratic forms on , and let denote the connected component containing in . Write when the forms are rationally equivalent. Graph-isomorphism conjecture. If , then . Moreover, every isomorphism between these graphs is a linear transformation such that
This conjecture generalises the rational Beckman--Quarles theorem: when , it asserts that every automorphism of is an isometry.
Sources & referencesView supporting material
Primary source
Artemy Sokolov, “On distance graphs in rational spaces”, arXiv:2301.06954 (2023).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.