Existential graph coding and empty-graph coordinate rigidity
Statement
Question 7 (Miller). Given a countable graph ( V, E ), find a field K (of characteristic 0), polynomials P ∈ Q[x, t ], Q, R ∈ Q[x, y, z ] and a bijection
α: V → { x ∈ K | (∃t ∈ K)( P (x, t ) = 0) } such that for all v, w ∈ V:1. ( v, w ) ∈ E ↔ (∃z)( R(α(v), α (w), z ) = 0). 2. ( v, w ) 6 ∈ E ↔ (∃z)( Q(α(v), α (w), z ) = 0). Poonen: let P define a curve without non-trivial automorphism. For the empty graph: Find a polynomial P ∈ Q[x, t ] such that K is a field generated by
x1, x 2,..., t 1, t 2,... such that all {x1, x 2,... } are algebraically independent and such that P (xi, t i) = 0 for all i and such that 1. For every permutation π of N there is a unique automorphism σπ of K
such that σπ(xi) = xπ(i).2. {xi | i ∈ N} = {y ∈ K | (∃t)( P (y, t ) = 0) }.
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.