About: Gale diagram

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Gale diagram Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : dbpedia.demo.openlinksw.com associated with source document(s)
QRcode icon

http://dbpedia.demo.openlinksw.com/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FGale_diagram&invfp=IFP_OFF&sas=SAME_AS_OFF

In the mathematical discipline of polyhedral combinatorics, the Gale transform turns the vertices of any convex polytope into a set of vectors or points in a space of a different dimension, the Gale diagram of the polytope. It can be used to describe high-dimensional polytopes with few vertices, by transforming them into sets of points in a space of a much lower dimension. The process can also be reversed, to construct polytopes with desired properties from their Gale diagrams. The Gale transform and Gale diagram are named after David Gale, who introduced these methods in a 1956 paper on neighborly polytopes.

Attributes	Values
rdfs:label	Diagram Gale (in) Gale diagram (en)
rdfs:comment	In the mathematical discipline of polyhedral combinatorics, the Gale transform turns the vertices of any convex polytope into a set of vectors or points in a space of a different dimension, the Gale diagram of the polytope. It can be used to describe high-dimensional polytopes with few vertices, by transforming them into sets of points in a space of a much lower dimension. The process can also be reversed, to construct polytopes with desired properties from their Gale diagrams. The Gale transform and Gale diagram are named after David Gale, who introduced these methods in a 1956 paper on neighborly polytopes. (en) Dalam , transformasi Gale mengubah sudut dari setiap politop cembung menjadi sebuah himpunan dari vektor-vektor atau titik-titik dalam sebuah ruang dari sebuah dimensi yang berbeda, diagram Gale dari politop. Ini bisa digunakan untuk menggambarkan politop-politop dimensi tinggi dengan beberapa sudut, dengan mengubah mereka menjadi himpunan-himpunan dari titik-titik dalam sebuah ruang dari banyaknya dimensi rendah. Proses bisa juga dibalikkan, untuk membangun politop-politop dengan sifat-sifat yang diinginkan dari diagram Gale mereka. Transform Glae dan diagram Gale dinamakan oleh , yang memperkenalkan metode-metode ini dalam sebuah makalah pada tahun 1956 pada (in)
dcterms:subject	Polyhedral combinatorics
Wikipage page ID	64979699 (xsd:integer)
Wikipage revision ID	1115967523 (xsd:integer)
Link from a Wikipage to another Wikipage	Quadrilateral Enumerative combinatorics Bernd Sturmfels David Gale Unit circle Column vector Matrix (mathematics) Origin (mathematics) Convex hull Convex polytope Regular octahedron Simplex Micha Perles Perles configuration Triangular bipyramid Dual matroid Oriented matroid Polyhedral combinatorics Vertex figure Kernel (linear algebra) Relative interior Polyhedral combinatorics Square pyramid Neighborly polytope Unit vector Triangular prism Universal vertex Central projection Cartesian coordinate Cross polytope dbr:Kleinschmidt_polytope dbr:Perles_polytope
sameAs	Gale diagram Gale diagram Gale diagram
dbp:wikiPageUsesTemplate	dbt:Citation dbt:Reflist dbt:Sfnp dbt:Technical
has abstract	In the mathematical discipline of polyhedral combinatorics, the Gale transform turns the vertices of any convex polytope into a set of vectors or points in a space of a different dimension, the Gale diagram of the polytope. It can be used to describe high-dimensional polytopes with few vertices, by transforming them into sets of points in a space of a much lower dimension. The process can also be reversed, to construct polytopes with desired properties from their Gale diagrams. The Gale transform and Gale diagram are named after David Gale, who introduced these methods in a 1956 paper on neighborly polytopes. (en) Dalam , transformasi Gale mengubah sudut dari setiap politop cembung menjadi sebuah himpunan dari vektor-vektor atau titik-titik dalam sebuah ruang dari sebuah dimensi yang berbeda, diagram Gale dari politop. Ini bisa digunakan untuk menggambarkan politop-politop dimensi tinggi dengan beberapa sudut, dengan mengubah mereka menjadi himpunan-himpunan dari titik-titik dalam sebuah ruang dari banyaknya dimensi rendah. Proses bisa juga dibalikkan, untuk membangun politop-politop dengan sifat-sifat yang diinginkan dari diagram Gale mereka. Transform Glae dan diagram Gale dinamakan oleh , yang memperkenalkan metode-metode ini dalam sebuah makalah pada tahun 1956 pada (in)
prov:wasDerivedFrom	wikipedia-en:Gale_diagram?oldid=1115967523&ns=0
page length (characters) of wiki page	12355 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Gale_diagram
is Link from a Wikipage to another Wikipage of	David Gale Convex Polytopes Perles configuration Lectures in Geometric Combinatorics Gale transform
is Wikipage redirect of	Gale transform
is foaf:primaryTopic of	wikipedia-en:Gale_diagram

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (378 GB total memory, 50 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software