The Strong Connectedness conjecture for regular rings
The Strong Connectedness conjecture for regular rings
Let be a regular ring. For points having a common specialization, the Strong Connectedness Property requires that, for elements satisfying the valuation inequalities and sign condition in the source, and lie in the same connected component of
More precisely, each satisfies and , and no changes sign between and .
Strong Connectedness conjecture. A regular ring has the Strong Connectedness Property at every pair of points having a common specialization.
This strengthens the ordinary connectedness framework by weakening the hypotheses on the elements to be avoided. The paper proves the strong conjecture in dimension two and uses it to obtain further cases of the Connectedness and Pierce–Birkhoff conjectures; the general statement remains open.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Equivalent formulations 1
Other statements of this same problem, merged from separate entries. Each is equivalent to the statement above — proving any one settles them all.
Strong connectedness conjecture for regular rings
Let be a ring. The strong connectedness property is required at pairs having a common specialization, with the defining connectedness condition imposed for such pairs. Let be the class of all regular rings, and let denote the assertion that every ring in has the strong connectedness property. Strong connectedness conjecture.
This is a strengthening of the connectedness conjecture. The paper’s main result proves it under a good-position hypothesis in the polynomial setting, while the general assertion for regular rings remains open.
source: F Lucas, D. Schaub and M. Spivakovsky, “On the strong separation conjecture”, arXiv:1802.09389 (2018).
Sources & referencesView supporting material
Primary source
François Lucas, Daniel Schaub and Mark Spivakovsky, “On the Pierce-Birkhoff Conjecture”, arXiv:1207.6463 (2012).
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.