Acharya–Douglas minimal-distance conjecture for the string Landscape
Acharya–Douglas minimal-distance conjecture for the string Landscape
Let be the configuration space of string vacua, and let physically distinct vacua be points of this space. Acharya–Douglas minimal-distance conjecture. There exists a minimal distance in between physically distinct vacua.
This conjecture supports the proposal that the string Landscape is a discretum rather than an infinite continuous space of vacua, with finiteness results in geometry providing part of the motivation. Its resolution is not established in the supplied source.
Sources & referencesView supporting material
Primary source
Abhijnan Rej, “Turing's Landscape: decidability, computability and complexity in string theory”, arXiv:0909.1869 (2009).
Progress summary
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.