No label defined (Q4467110)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2070819
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 2070819 |
Statements
8 June 2004
0 references
Halphen-Castelnuovo problem
0 references
non-degenerate curve
0 references
genus
0 references
degree
0 references
0.7099434
0 references
0 references
0.70000315
0 references
0 references
0.6879666
0 references
0 references
The problem of determining for which pairs of integers \((d,g)\) there exists a {smooth irreducible non-degenerate curve} in \(\mathbb{P}^n\) of {degree} \(d\) and {genus} \(g\) (called {Halphen-Castelnuovo problem in} \(\mathbb{P}^n\), shortly \(HC(n)\)), has a long history and has been solved for \(n \leq 7\) since the classical contributions of George Halphen, Max Noether, Guido Castelnuovo until, in more recent years, Laurent Gruson, Christian Peskine, Jürgen Rathmann, Ciro Ciliberto, Edoardo Sernesi. In general (\(n \leq 7\)) two domains for \((d,g)\) are considered: a lower one, where there exist curves for any \((d,g)\) and a upper one where many gaps are present. The author studies a lower domain: \(D_1^n\) (for \(n \geq 4\)), defined as union of suitable subdomains and proves that it is non-lacunary, precisely Theorem T. In the domain \(D_1^n\) there is no gap for the problem \(HC(n)\) for any integer \(n \geq 4\). The proof uses three technical results (theorems A, B, C) about the subdomains defining \(D_1^n\), two of them (A and C) already proved by the author in previous papers; the third one (B) is completely proved in this paper, by means of a comparison between the lower bound of thm. C and the upper bound of a result of \textit{C. Ciliberto} and \textit{E. Sernesi} [Comment. Math. Helv. 64, No. 2, 300--328 (1989; Zbl 0694.14008)] and a filling of the distance between them when it exists.
0 references