pith. sign in

arxiv: 1712.08806 · v1 · pith:HOEP5D5Unew · submitted 2017-12-23 · 🧮 math.DG

On the linearizability of 3-webs: end of controversy

classification 🧮 math.DG
keywords linearizabilitywebsarticlelinearizablefirsttheyanalanalysis
0
0 comments X
read the original abstract

There are two theories describing the linearizability of 3-webs: one is developed in the article "On the linearizability of 3-webs" (Nonlinear analysis 47, (2001) pp.2643-2654) and another in the article "On the Blaschke conjecture for 3-webs" (J. Geom. Anal. 16, 1 (2006), 69-115). Unfortunately, they cannot be both correct because on an explicit 3-web W they contradict: the first predicts that W is linearizable while the second states that W is not linearizable. The essential question beyond this particular 3-web is: which theory describes correctly the linearizability condition? In this paper we present a very short proof, due to J.-P.~Dufour, that W is linearizable, confirming the result of the first article.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.