EXEMPLE
Linking Structures - On the Combinatorial Structure of Linked Simplices in Straight Line Embeddings of Complete Graphs
- Livres de poche2008, ISBN: 9783639063264
[ED: Taschenbuch / Paperback], [PU: VDM Verlag Dr. Müller], As no rings of an iron chain can be separated withoutcutting, no two triangles in 3-space with one edge piercing throughthe int… Plus…
[ED: Taschenbuch / Paperback], [PU: VDM Verlag Dr. Müller], As no rings of an iron chain can be separated withoutcutting, no two triangles in 3-space with one edge piercing throughthe interior of the other can be separated by any continuoustransformation without intersecting their boundaries. Thosetriangles are called linked (germ: verschlungen). In graph theoryit is known, that any straight line embedding of the complete graphof 6 vertices in 3-space contains a pair of linked triangles. Usingthe technique of Gale diagrams, we can state this more precisely:either one pair or exactly three pairs of linked triangles exist.Clearing the more general case of pairs of simplices in (d+3)vertices in d-space (d odd) and a linking property of (d+4)vertices lead to the axiomatization of (abstract) linkingstructures including an orientation information, induced by thetopological linking number. These structures are geometricallymotivated but combinatorial objects and emerged from unpublishedconcepts of Prof. U. Brehm (TU-Dresden). Oriented matroids andcomputer-supported proofs allow us to completely classify allgeometrical and oriented-matroid realizable linking structures of6, 7 and 8 points in 3-space as well as 9 points in 5-space., [SC: 0.00], Neuware, gewerbliches Angebot, 22 cm, [GW: 346g]<
| | booklooker.deSyndikat Buchdienst Frais d'envoiVersandkostenfrei, Versand nach Deutschland (EUR 0.00) Details... |
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
EXEMPLE
Maik Gerth:Linking Structures
- nouveau livre ISBN: 9783639063264
As no rings of an iron chain can be separated withoutcutting, no two triangles in 3-space with one edge piercing throughthe interior of the other can be separated by any continuoustransfo… Plus…
As no rings of an iron chain can be separated withoutcutting, no two triangles in 3-space with one edge piercing throughthe interior of the other can be separated by any continuoustransformation without intersecting their boundaries. Thosetriangles are called linked (germ: verschlungen). In graph theoryit is known, that any straight line embedding of the complete graphof 6 vertices in 3-space contains a pair of linked triangles. Usingthe technique of Gale diagrams, we can state this more precisely:either one pair or exactly three pairs of linked triangles exist.Clearing the more general case of pairs of simplices in (d+3)vertices in d-space (d odd) and a linking property of (d+4)vertices lead to the axiomatization of (abstract) linkingstructures including an orientation information, induced by thetopological linking number. These structures are geometricallymotivated but combinatorial objects and emerged from unpublishedconcepts of Prof. U. Brehm (TU-Dresden). Oriented matroids andcomputer-supported proofs allow us to completely classify allgeometrical and oriented-matroid realizable linking structures of6, 7 and 8 points in 3-space as well as 9 points in 5-space. Bücher / Naturwissenschaften, Medizin, Informatik & Technik / Mathematik, [PU: VDM Verlag Dr. Müller, Saarbrücken]<
| | Dodax.deNr. 57b31b6477722508f711299c Frais d'envoiVersandkosten: 0.0 EUR, Lieferzeit: 3 Tage, DE. (EUR 0.00) Details... |
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
EXEMPLE
Linking Structures
- nouveau livreISBN: 9783639063264
As no rings of an iron chain can be separated withoutcutting, no two triangles in 3-space with one edge piercing throughthe interior of the other can be separated by any continuoustransfo… Plus…
As no rings of an iron chain can be separated withoutcutting, no two triangles in 3-space with one edge piercing throughthe interior of the other can be separated by any continuoustransformation without intersecting their boundaries. Thosetriangles are called linked (germ: verschlungen). In graph theoryit is known, that any straight line embedding of the complete graphof 6 vertices in 3-space contains a pair of linked triangles. Usingthe technique of Gale diagrams, we can state this more precisely:either one pair or exactly three pairs of linked triangles exist.Clearing the more general case of pairs of simplices in (d+3)vertices in d-space (d odd) and a linking property of (d+4)vertices lead to the axiomatization of (abstract) linkingstructures including an orientation information, induced by thetopological linking number. These structures are geometricallymotivated but combinatorial objects and emerged from unpublishedconcepts of Prof. U. Brehm (TU-Dresden). Oriented matroids andcomputer-supported proofs allow us to completely classify allgeometrical and oriented-matroid realizable linking structures of6, 7 and 8 points in 3-space as well as 9 points in 5-space. Bücher / Naturwissenschaften, Medizin, Informatik & Technik / Mathematik, [PU: VDM Verlag Dr. Müller, Saarbrücken]<
| | Dodax.deNr. TLTG30VV1OC. Frais d'envoiVersandkosten: 0 EUR, 11, zzgl. Versandkosten. (EUR 0.00) Details... |
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
EXEMPLE
Gerth, Maik:Linking Structures On the Combinatorial Structure of Linked Simplices in Straight Line Embeddings of Complete Graphs
- nouveau livre 2008, ISBN: 3639063260
Kartoniert / Broschiert, mit Schutzumschlag neu, [PU:VDM Verlag]
| | Achtung-Buecher.deREDIVIVUS Buchhandlung Hanausch Reinhard, 93053 Regensburg Frais d'envoiVersandkostenfrei innerhalb der BRD (EUR 0.00) Details... |
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.
EXEMPLE
Gerth, Maik:Linking Structures On the Combinatorial Structure of Linked Simplices in Straight Line Embeddings of Complete Graphs
- nouveau livre 2008, ISBN: 3639063260
Leinen, mit Schutzumschlag neu, [PU:VDM Verlag]
| | Achtung-Buecher.deREDIVIVUS Buchhandlung Hanausch Reinhard, 93053 Regensburg Frais d'envoiVersandkostenfrei innerhalb der BRD (EUR 0.00) Details... |
(*) Livre non disponible signifie que le livre est actuellement pas disponible à l'une des plates-formes associées nous recherche.