VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Maximum independent sets of the 120-cell and other regular polytopes
    Debroni, Sean ...
    A ▫$d$▫-code in a graph is a set of vertices such that all pairwise distances are at least ▫$d$▫. As part of a study of ▫$d$▫-codes of three-and four-dimensional regular polytopes, the maximum ... independent set order of the 120-cell is calculated. A linear program based on counting arguments leads to an upper bound of 221. An independent set of order 110 in the antipodal collapse of the 120-cell (also known as the hemi-120-cell) gives a lower bound of 220 for the 120-cell itself. The gap is closed by the computation described here, withthe result that the maximum independent set order of the 120-cell is 220. All maximum ▫$d$▫-code orders of the icosahedron, dodecahedron, 24-cell, 600-cell and 120-cell are reported.
    Vir: Ars mathematica contemporanea. - ISSN 1855-3966 (Vol. 6, no. 2, 2013, str. 197-210)
    Vrsta gradiva - članek, sestavni del ; neleposlovje za odrasle
    Leto - 2013
    Jezik - angleški
    COBISS.SI-ID - 16472409

    Povezava(-e):

    http://amc.imfm.si/index.php/amc/article/view/170/203
    Digitalna knjižnica Slovenije - dLib.si

Vnos na polico