Barry Monson

Dr. Barry Monson

orcid

Research Focus & Metrics

Academic Career Length

28Years (1999-Present)

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

Representative Publications

View All Publications
4 November 2013 in Transactions of the American Mathematical Society
Verified
Journal Article
Closed access
PDF file
BMBarry Monson
Barry Monson
DPDaniel Pellicer
Daniel Pellicer
GWGordon Williams
Gordon Williams
The monodromy group M o n ( P ) \mathrm {Mon}(\mathcal {P}) of an n n -polytope P \mathcal {P} encodes the combinatorial information needed to construct P \mathcal {P} . By applying tools such as mixing, a natural group-theoretic operation, we develop various criteria for M o n ( P ) \mathrm {Mon}(\mathcal {P}) itself to be the automorphism group of a regular n n -polytope R \mathcal {R} . We examine what this can say about regular covers of P \mathcal {P} , study a peculiar example of a 4 4 -polytope with infinitely many distinct, minimal regular covers, and then conclude with a brief application of our methods to chiral polytopes.

1 December 1999 in Canadian Journal of Mathematics
Verified
Journal Article
Closed access
BMBarry Monson
Barry Monson
AWA. Ivić Weiss
A. Ivić Weiss
We determine and completely describe all pure realizations of the finite regular toroidal polyhedra of types {3, 6} and {6, 3}.

1 September 2000 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
BMBarry Monson
Barry Monson
AWA. I. Weiss
A. I. Weiss

16 May 2015 in Journal of Algebraic Combinatorics
Verified
Journal Article
Closed access
PDF file
LBLeah Berman
Leah Berman
BMBarry Monson
Barry Monson
DODeborah Oliveros
Deborah Oliveros
GWGordon Williams
Gordon Williams

14 August 2019 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
BMBarry Monson
Barry Monson
Egon SchulteEgon Schulte
Egon Schulte

24 January 2018 in Advances in Geometry
Verified
Journal Article
Closed access
PDF file
LBLeah Berman
Leah Berman
BMBarry Monson
Barry Monson
DODéborah Oliveros
Déborah Oliveros
GWGordon Williams
Gordon Williams
We describe a simple way to manufacture faithful representations of the monodromy group of an n-polytope. This is used to determine the monodromy group for 𝓣 n , the fully truncated n-simplex. As by-products, we get the minimal regular cover for 𝓣 n , along with the analogous objects for a prism over a simplex.