Puzzles and polytope isomorphisms (Q1096888): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q29395940, #quickstatements; #temporary_batch_1705061695205
Property / Wikidata QID
 
Property / Wikidata QID: Q29395940 / rank
 
Normal rank

Revision as of 13:16, 12 January 2024

scientific article
Language Label Description Also known as
English
Puzzles and polytope isomorphisms
scientific article

    Statements

    Puzzles and polytope isomorphisms (English)
    0 references
    0 references
    0 references
    1987
    0 references
    The authors call the set \(\pi\) \({\mathfrak C}\) of d- and (d-1)-cells of a simplicial d-complex \({\mathfrak C}\) its puzzle, and a puzzle isomorphism between two such complexes \({\mathfrak A},{\mathfrak B}\) is a bijection between \(\pi\) \({\mathfrak A}\) and \(\pi\) \({\mathfrak B}\) which preserves dimension and incidence. They use homological arguments to show that puzzle isomorphisms between the boundary complexes of simplicial polytopes extend to combinatorial isomorphisms between the polytopes, thus confirming (in the dual form) a conjecture of Perles.
    0 references
    puzzle
    0 references
    simplicial polytopes
    0 references
    combinatorial isomorphisms
    0 references
    conjecture of Perles
    0 references

    Identifiers