Problem 3. (Threshold regularity of the eikonal equation).
Statement
Problem 3. (Threshold regularity of the eikonal equation). A weak consequence of a proof of the Aviles Giga conjecture would be a proof of the following. d Conjecture 1. Let EN T := Φ : S1 \to R2 : dt Φ eit \cdot eit = 0 . Suppose m : Ω \to S1 satisfies div(m) = 0 in D′ (Ω) and (4) div (Φ (m)) \in Lploc (Ω) for every Φ \in EN T then m is rigid. It was shown in [7] that if p \in 1, 43 , then m : Ω \to S1 with div(m) = 0 in D′ (Ω) 1 satisfying (4) is equivalent to m \in B3p,loc,\infty 3 . The primary result of [2] is that for p the more general hypothesis of (4) with Lloc (Ω) replaced with Mloc (Ω), this is 1 equivalent to m \in B3,loc,\infty 3 . Since the latter case includes all finite limits of Aviles 1 Giga energy it is clear solutions of the eikonal equation m \in B3,loc,\infty 3 can have line singularities, whereas a proof of Conjecture 1 would show that for solutions of 1 the eikonal equation m \in Bq,loc,\infty 3 with q > 3 they can only have a discrete set of point singularities. Thus threshold regularity of the eikonal equation on the Besov 1 scale occurs exactly at m \in B3,loc,\infty 3 . Problem 2. (Rigidity of differential inclusions into non-elliptic sets). Let Π1 , Π2 \subset R2 be two convex sets and let \gamma1 , \gamma2 : S1 \to R2 be arclength parametrisations of \partialΠ1 , \partialΠ2 . Let n \in N, n \geq 3, suppose Π1 , Π2 are such that 2 2 (3) sup |\gamma1′′ (t)| < n2 inf |\gamma2′′ (t)| . t t For any n \in N the set Γn := \gamma1 (eit ) c + n−1 \gamma2 (eint ) a forms a non-elliptic set and a small neighborhood around every point does not contain Rank-1 connections. Is it the case that for every Γ3 there exists some R = R(Γ3 ) > 0 such that if w \in W 1,2 Ω : R2 with Dw(x) \in Γ3 \cap BR (M ) a.e. (for some M \in K) then Dw is rigid? More generally is it true for Γn where n \in N and n \geq 3? It is true for all 1d non-ellptic sets without Rank-1 connections?
Record
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.