Combinatorial types of bicyclic polytopes

被引:0
|
作者
Bisztriczky, T. [2 ]
Lawrence, Jim [1 ]
机构
[1] George Mason Univ, Dept Math Sci, Fairfax, VA 22030 USA
[2] Univ Calgary, Calgary, AB T2N 1N4, Canada
关键词
Bicyclic polytope; Combinatorial type; Cyclic symmetry; Equifacetted polytope; 4-POLYTOPES;
D O I
10.1016/j.disc.2012.02.014
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We classify the bicyclic polytopes and their vertex figures, up to combinatorial equivalence. These four-dimensional polytopes, which were previously studied by Smilansky, admit abelian groups of orientation-preserving symmetries that act transitively on their vertices. The bicyclic polytopes come in both simplicial and nonsimplicial varieties. It is noteworthy that their facial structures admit an explicit and complete presentation. Their vertex figures are also of interest, and they play a prominent role in the classification; their combinatorial structures are studied in detail here. The f-vectors of the polytopes and of their vertex figures are given. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码:1863 / 1876
页数:14
相关论文
共 50 条
  • [31] COMBINATORIAL INSCRIBABILITY OBSTRUCTIONS FOR HIGHER DIMENSIONAL POLYTOPES
    Doolittle, Joseph
    Labbe, Jean-Philippe
    Lange, Carsten E. M. C.
    Sinn, Rainer
    Spreer, Jonathan
    Ziegler, Guenter M.
    MATHEMATIKA, 2020, 66 (04) : 927 - 953
  • [32] A COMBINATORIAL MODEL FOR COMPUTING VOLUMES OF FLOW POLYTOPES
    Benedetti, Carolina
    Gonzalez D'Leon, Rafael S.
    Hanusa, Christopher R. H.
    Harris, Pamela E.
    Khare, Apoorva
    Morales, Alejandro H.
    Yip, Martha
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2019, 372 (05) : 3369 - 3404
  • [33] On facet-inducing inequalities for combinatorial polytopes
    Simanchev R.Y.
    Journal of Applied and Industrial Mathematics, 2017, 11 (4) : 564 - 571
  • [34] Hirsch polytopes with exponentially long combinatorial segments
    Labbe, Jean-Philippe
    Manneville, Thibault
    Santos, Francisco
    MATHEMATICAL PROGRAMMING, 2017, 165 (02) : 663 - 688
  • [35] Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
    Arya, Rahul
    Arya, Sunil
    da Fonseca, Guilherme D.
    Mount, David
    ACM TRANSACTIONS ON ALGORITHMS, 2022, 18 (04)
  • [36] Optimal Bound on the Combinatorial Complexity of Approximating Polytopes
    Ary, Rahul
    Arya, Sunil
    da Fonseca, Guilherme D.
    Mount, David M.
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 786 - 805
  • [37] Recent progress on the combinatorial diameter of polytopes and simplicial complexes
    Santos, Francisco
    TOP, 2013, 21 (03) : 426 - 460
  • [38] Combinatorial Bernoulli Factories: Matchings, Flows, and Other Polytopes
    Niazadeh, Rad
    Leme, Renato Paes
    Schneider, Jon
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 833 - 846
  • [39] On Vertices and Facets of Combinatorial 2-Level Polytopes
    Aprile, Manuel
    Cevallos, Alfonso
    Faenza, Yuri
    COMBINATORIAL OPTIMIZATION, ISCO 2016, 2016, 9849 : 177 - 188
  • [40] Combinatorial Rigidity of 3-dimensional Simplicial Polytopes
    Choi, Suyoung
    Kim, Jang Soo
    INTERNATIONAL MATHEMATICS RESEARCH NOTICES, 2011, 2011 (08) : 1935 - 1951