On the need of convexity in patchworking (Q1271890): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/aama.1997.0571 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2053099449 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Piles of cubes, monotone path polytopes, and hyperplane arrangements / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructions and complexity of secondary polytopes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4886009 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The polytope of all triangulations of a point configuration / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4293510 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3142950 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4838338 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4361546 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4886014 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Patchworking algebraic curves disproves the Ragsdale conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3974985 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3312362 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4204258 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4280753 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3877793 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4319814 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3697146 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3358871 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hilbert's sixteenth problem / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 17:27, 28 May 2024
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