A Gray code for the shelling types of the boundary of a hypercube (Q1928446): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q354453
Importer (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Gábor Hetyei / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050430433 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1111.4710 / rank
 
Normal rank

Latest revision as of 22:51, 18 April 2024

scientific article
Language Label Description Also known as
English
A Gray code for the shelling types of the boundary of a hypercube
scientific article

    Statements

    A Gray code for the shelling types of the boundary of a hypercube (English)
    0 references
    0 references
    0 references
    3 January 2013
    0 references
    Recently, \textit{A. King} [ibid. 306, No. 5, 508--518 (2006; Zbl 1086.05004)] provided a transposition Gray code for the set of all indecomposable permutations of length \(n\). In this article, the authors construct an adjacent transposition Gray code for a signed variant of the indecomposable permutations, called sign-connected permutations of the set \(\{\pm1,\pm 2,\dots,\pm n\}\). These permutations encode the shelling types of the boundary of the hypercube. The author proves that this Gray code can be generated in constant amortized time.
    0 references
    Gray code
    0 references
    connected permutations
    0 references
    indecomposable permutations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references