On the need of convexity in patchworking (Q1271890)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the need of convexity in patchworking |
scientific article |
Statements
On the need of convexity in patchworking (English)
0 references
11 November 1998
0 references
A combinatorial version of Hilbert's lemma which bounds the depth of nests in a \(T\)-curve is proved. This has as consequence that all combinatorial schemes of \(T\)-curves arising from arbitrary triangulations of degree less than or equal to 5 are schemes of real algebraic smooth curves. Furthermore, a combinatorial algorithm is described to determine the type of a \(T\)-curve. Here a real algebraic scheme has complex orientation of type I (resp. type II) if any curve with this real scheme divides (does not divide) its complexification.
0 references
Hilbert's 16th problem
0 references
Viro's method
0 references
\(T\)-curve
0 references
depth of nests
0 references
real algebraic scheme
0 references