Configurations in the Euclidean space related to the 3D genome reconstruction problem from partially phased data
Abstract
A motivation for studying the following problems comes from applications to Biology; see cifuentes20233d. In the 3-dimensional Euclidean space E3, fix six pairwise distinct points equation* eqA arrayccc A=(a1,a2,a3), & B=(b1,b2,b3), & C=(c1,c2,c3), \\ D=(d1,d2,d3), & E=(e1,e2,e3), & F=(f1,f2,f3) array equation* together with two further points X*=(x1*,x2*,x3*) and Y*=(y1*,y2*,y3*) in E3. We aim to show that System (*) consisting of the following six equations in the unknowns X=(x1,x2,x3) and Y=(y1,y2,y3) equation egy 1\|X-T\|2 +1\|Y-T\|2=1\|X*-T\|2 +1\|Y*-T\|2, T∈\A,B,…,F\. equation has only finitely many solutions provided that both of the following two conditions are satisfied: (i) no four of the fixed points A,B,C,D,E,F are coplanar; (ii) no four of the six spheres of center T and radius 1/kT with equation kxy kT=1\|X*-T\|2 +1\|Y*-T\|2 equation share a common point in E3. Furthermore, we exhibit configurations ABCDEFX*Y*, showing that (i) is also necessary. This result is an improvement on [Theorem 1]cifuentes20233d where the finiteness of solutions of System (*) is only ensured for sufficiently generic choices of the points A,B,…,F,X*,Y*. We also show if System (*) has finitely many solutions and System (*) extended with T∈\A,B,…,F,G\ has some solutions other than (X*,Y*) and (Y*,X*) then G lies on an explicitly given affine variety W⊂neqq R3 only depending on \A,B,…,F\. This result proves the [Conjecture 1]cifuentes20233d.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.