A nine-line counterexample to a conjecture on the minimal degree of Jacobian relations

Abstract

We construct two arrangements of nine lines in the complex projective plane with isomorphic intersection lattices but with different minimal degrees of Jacobian relations. The common weak combinatorics is \[ (n2,n3,n4)=(9,7,1), \] so the example is not the classical Ziegler-Yuzvinsky pair, whose weak combinatorics is (n2,n3) = (18,6). For the two defining equations f and g we prove \[ mdr(f)=4, mdr(g)=5. \] Since the degree is d=9, the first equality gives mdr(f)<d/2. Hence the pair gives a counterexample to the Generalized Terao Conjecture.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…