Asymptotic plausibility conjecture for shapes with r=2

About 12 years old · traced to

A shape (n,κ,r,s)(n,\kappa,r,s) is called plausible when it satisfies the paper's plausibility criterion for detecting whether sufficiently general ideals of that shape are plausibly generic. Asymptotic plausibility conjecture. Given r=2r=2, s>2s>2, and κ≥2\kappa\geq 2, the shape (n,κ,2,s)(n,\kappa,2,s) is plausible for all sufficiently large nn. This conjecture concerns the asymptotic behavior of the plausibility criterion; the paper offers it based on an analysis of that criterion, while no general theorem establishing such genericity is known.

References

Primary source

Mark E. Huibregtse, “Some elementary components of the Hilbert scheme of points”, arXiv:1407.1440 (2016).

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

No solutions have been posted yet.