VSE knjižnice (vzajemna bibliografsko-kataložna baza podatkov COBIB.SI)
  • Mixing and monodromy of abstract polytopes
    Monson, Barry ; Pellicer, Daniel ; Williams, Gordon Ian
    The monodromy group ▫$\mathrm{Mon}(\mathcal{P})$▫ of an ▫$n$▫-polytope ▫$\mathcal{P}$▫ encodes the combinatorial information needed to construct ▫$\mathcal{P}$▫. By applying tools such as mixing, a ... natural group-theoretic operation, we develop various criteria for ▫$\mathrm{Mon}(\mathcal{P})$▫ itself to be the automorphism group of a regular ▫$n$▫-polytope ▫$\mathcal{R}$▫. We examine what this can say about regular covers of ▫$\mathcal{P}$▫, study a peculiar example of a 4-polytope with infinitely many distinct, minimal regular covers, and then conclude with a brief application of our methods to chiral polytopes.
    Vir: Transactions of the American Mathematical Society. - ISSN 0002-9947 (Vol. 366, no. 5, 2014, str. 2651-2681)
    Vrsta gradiva - članek, sestavni del
    Leto - 2014
    Jezik - angleški
    COBISS.SI-ID - 17589849

    Povezava(-e):

    http://dx.doi.org/10.1090/S0002-9947-2013-05954-5

Vnos na polico