About: Kalai's 3^d conjecture

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

About: Kalai's 3^d conjecture 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%2FKalai%27s_3%255Ed_conjecture&invfp=IFP_OFF&sas=SAME_AS_OFF

In geometry, Kalai's 3d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989. It states that every d-dimensional centrally symmetric polytope has at least 3d nonempty faces (including the polytope itself as a face but not including the empty set).

Attributes	Values
rdfs:label	Conjecture 3d de Kalai (fr) Kalai's 3^d conjecture (en) 3d-гипотеза Калая (ru) 3d-гіпотеза Калаї (uk)
rdfs:comment	En géométrie combinatoire , la conjecture 3d de Kalai est une minoration du nombre de faces des polytopes à symétrie centrale, conjecturée par Gil Kalai en 1989. (fr) In geometry, Kalai's 3d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989. It states that every d-dimensional centrally symmetric polytope has at least 3d nonempty faces (including the polytope itself as a face but not including the empty set). (en) 3d-гипотеза Калая — гипотеза о минимальном числе граней у центрально-симметричных многогранников. Сформулирована в 1989 году. Гипотеза доказана для и остается открытой для произвольных многогранников в высших измерениях. (ru) 3d-гіпотеза Калаї — гіпотеза про мінімальне число граней у центрально-симетричних багатогранників. Сформулював 1989 року. Гіпотеза доведена для і залишається відкритою для довільних багатогранників у вищих вимірах. (uk)
foaf:depiction
dcterms:subject	Conjectures Polyhedral combinatorics Unsolved problems in geometry
Wikipage page ID	39408412 (xsd:integer)
Wikipage revision ID	1038274097 (xsd:integer)
Link from a Wikipage to another Wikipage	Face lattice Cube Conjectures Geometry Gil Kalai Conjecture Convex polygon Convex polytope Regular octahedron Empty set Polygon Polyhedral combinatorics Hanner polytope Interval (mathematics) Hypercube Unsolved problems in geometry Polyhedral combinatorics Split graph Convex polyhedron Parallelogram Polytope Simplicial polytope Point symmetry dbr:Hansen_polytope
sameAs	Kalai's 3^d conjecture Kalai's 3^d conjecture Kalai's 3^d conjecture Kalai's 3^d conjecture Kalai's 3^d conjecture Kalai's 3^d conjecture Kalai's 3^d conjecture
dbp:wikiPageUsesTemplate	dbt:= dbt:Reflist dbt:Harvs dbt:Unsolved
thumbnail	wiki-commons:Special:FilePath/Dual_Cube-Octahedron.svg?width=300
authorlink	Richard P. Stanley (en)
first	Richard (en) Matthias (en) László (en) Günter (en) Moritz (en) Imre (en) Ragnar (en)
last	Stanley (en) Schmitt (en) Ziegler (en) Bárány (en) Lovász (en) Henze (en) Freij (en)
year	1982 (xsd:integer) 1987 (xsd:integer) 2013 (xsd:integer)
has abstract	En géométrie combinatoire , la conjecture 3d de Kalai est une minoration du nombre de faces des polytopes à symétrie centrale, conjecturée par Gil Kalai en 1989. (fr) In geometry, Kalai's 3d conjecture is a conjecture on the polyhedral combinatorics of centrally symmetric polytopes, made by Gil Kalai in 1989. It states that every d-dimensional centrally symmetric polytope has at least 3d nonempty faces (including the polytope itself as a face but not including the empty set). (en) 3d-гипотеза Калая — гипотеза о минимальном числе граней у центрально-симметричных многогранников. Сформулирована в 1989 году. Гипотеза доказана для и остается открытой для произвольных многогранников в высших измерениях. (ru) 3d-гіпотеза Калаї — гіпотеза про мінімальне число граней у центрально-симетричних багатогранників. Сформулював 1989 року. Гіпотеза доведена для і залишається відкритою для довільних багатогранників у вищих вимірах. (uk)
author1-link	Imre Bárány (en)
author2-link	László Lovász (en)
author4-link	Günter M. Ziegler (en)
prov:wasDerivedFrom	wikipedia-en:Kalai's_3%5Ed_conjecture?oldid=1038274097&ns=0
page length (characters) of wiki page	6024 (xsd:nonNegativeInteger)
foaf:isPrimaryTopicOf	wikipedia-en:Kalai's_3%5Ed_conjecture
is Link from a Wikipage to another Wikipage of	Power of three Olof Hanner Gil Kalai Convex Polytopes Hanner polytope List of unsolved problems in mathematics Kalai's 3d conjecture
is Wikipage redirect of	Kalai's 3d conjecture
is foaf:primaryTopic of	wikipedia-en:Kalai's_3%5Ed_conjecture

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