Conjecture on the vanishing probability of a fixed linking number in large grid models
Conjecture on the vanishing probability of a fixed linking number in large grid models
Let be a fixed number, and consider links chosen randomly from links represented by grids whose size tends to infinity. Vanishing fixed-linking-number conjecture. The probability of randomly choosing a link with linking number converges to zero in the limit of infinitely large grids. In particular, almost all randomly chosen links in an infinitely large grid should be nontrivially linked. The conjecture concerns the concentration of random grid links away from every fixed linking number and would imply that nontrivial linking is typical in the large-grid limit. The supplied text gives no resolution of this conjecture.
Sources & referencesView supporting material
Primary source
Senja Barthel and Yuka Kotorii, “Linking number of grid models”, arXiv:2506.02369 (2025).
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.