Gabe Cunningham

Mr. Gabe Cunningham


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 January 2015 in Annals of Combinatorics
Verified
Journal Article
Closed access
PDF file
GCGabe Cunningham
Gabe Cunningham
MRMaría Del Río-Francos
María Del Río-Francos
IHIsabel Hubard
Isabel Hubard
MTMicael Toledo
Micael Toledo

20 November 2015 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
GCGabe Cunningham
Gabe Cunningham
DPDaniel Pellicer
Daniel Pellicer

10 May 2013 in Ars Mathematica Contemporanea
Verified
Journal Article
Open access
PDF file
GCGabe Cunningham
Gabe Cunningham
Every equivelar abstract polytope of type {p1, …, pn − 1} has at least 2p1⋯pn − 1 flags. In this paper, we study polytopes that attain this lower bound, called tight polytopes. Using properties of flat polytopes, we are able to give a complete local characterization of when a polytope is tight. We then show a way to construct tight polyhedra of type {p, q} when p and q are not both odd, and a way to construct regular tight polytopes of type {2k1, …, 2kn − 1}.

7 December 2011 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
GCGabe Cunningham
Gabe Cunningham

10 January 2017 in Combinatorica
Verified
Journal Article
Closed access
PDF file
GCGabe Cunningham
Gabe Cunningham

14 July 2017 in The Electronic Journal of Combinatorics
Verified
Journal Article
Open access
PDF file
GCGabe Cunningham
Gabe Cunningham
An abstract polytope is flat if every facet is incident on every vertex. In this paper, we prove that no chiral polytope has flat finite regular facets and finite regular vertex-figures. We then determine the three smallest non-flat regular polytopes in each rank, and use this to show that for $n \geq 8$, a chiral $n$-polytope has at least $48(n-2)(n-2)!$ flags.