Javascript must be enabled to continue!
On a conjecture of Harris
View through CrossRef
For [Formula: see text], the Noether–Lefschetz locus [Formula: see text] parametrizes smooth, degree [Formula: see text] surfaces in [Formula: see text] with Picard number at least 2. A conjecture of Harris states that there are only finitely many irreducible components of the Noether–Lefschetz locus of non-maximal codimension. Voisin showed that the conjecture is false for sufficiently large [Formula: see text], but is true for [Formula: see text]. She also showed that for [Formula: see text], there are finitely many reduced, irreducible components of [Formula: see text] of non-maximal codimension. In this paper, we prove that for any [Formula: see text], there are infinitely many non-reduced irreducible components of [Formula: see text] of non-maximal codimension.
Title: On a conjecture of Harris
Description:
For [Formula: see text], the Noether–Lefschetz locus [Formula: see text] parametrizes smooth, degree [Formula: see text] surfaces in [Formula: see text] with Picard number at least 2.
A conjecture of Harris states that there are only finitely many irreducible components of the Noether–Lefschetz locus of non-maximal codimension.
Voisin showed that the conjecture is false for sufficiently large [Formula: see text], but is true for [Formula: see text].
She also showed that for [Formula: see text], there are finitely many reduced, irreducible components of [Formula: see text] of non-maximal codimension.
In this paper, we prove that for any [Formula: see text], there are infinitely many non-reduced irreducible components of [Formula: see text] of non-maximal codimension.
Related Results
Étude de la conjecture de Seymour sur le second voisinage
Étude de la conjecture de Seymour sur le second voisinage
Soit D un digraphe simple (sans cycle orienté de longueur 2 ). En 1990, P. Seymour a conjecturé que D a un sommet v avec un second voisinage extérieur au moins aussi grand que son ...
Borel Conjecture, dual Borel Conjecture, and other variants of the Borel Conjecture
Borel Conjecture, dual Borel Conjecture, and other variants of the Borel Conjecture
This survey article is about the Borel Conjecture and several variants (which are inspired by the Galvin-Mycielski-Solovay characterization of strong measure zero) such as the dual...
Rosenfeld’s conjecture
Rosenfeld’s conjecture
Conjecture de rosenfeld
Ma thèse de Doctorat est basée sur un sujet très intéressant en Théorie de Graphe : Le tournoi.En 1934, Rédei a prouvé que tout tournoi cont...
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
The Galois Brumer–Stark conjecture for SL2(????3)-extensions
In a previous work, we stated a conjecture, called the Galois Brumer–Stark conjecture, that generalizes the (abelian) Brumer–Stark conjecture to Galois extensions. We also proved t...
A Note on Alon–Tarsi Shortest Cycle Cover Conjecture
A Note on Alon–Tarsi Shortest Cycle Cover Conjecture
ABSTRACT
The shortest cycle cover conjecture (SCC conjecture), proposed by Alon and Tarsi, asserts that every bridgeless cubic graph has a cycle cover with a tot...
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Chemins orientés dans les graphes orientés et coloration S-packing des graphes subcubiques
Cette thèse de doctorat est divisée en deux parties principales: La parti...
The Complexity of Mathematics
The Complexity of Mathematics
The strong Goldbach's conjecture states that every even integer greater than 2 can be written as the sum of two primes. The conjecture that all odd numbers greater than 7 are the s...
Critical Exponents, Colines, and Projective Geometries
Critical Exponents, Colines, and Projective Geometries
In [9, p. 469], Oxley made the following conjecture, which is a geometric analogue of a
conjecture of Lovász (see [1, p. 290]) about complete graphs.Conjecture 1.1.Let G be a rank...

