Gordon Williams

Dr. Gordon Williams

orcid

Research Focus & Metrics

Academic Career Length

25Years (2002-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 July 2015 in Discrete & Computational Geometry
Verified
Journal Article
Closed access
PDF file
Egon SchulteEgon Schulte
Egon Schulte
GWGordon Williams
Gordon Williams

12 July 2012 in The Electronic Journal of Combinatorics
Verified
Journal Article
Closed access
PDF file
DPDaniel Pellicer
Daniel Pellicer
GWGordon Williams
Gordon Williams
We discuss representations of non-finite polyhedra as quotients of regular polytopes. We provide some structural results about the minimal regular covers of non-finite polyhedra and about the stabilizer subgroups of their flags under the flag action of the automorphism group of the covering polytope. As motivating examples we discuss the minimal regular covers of the Archimedean tilings, and we construct explicit minimal regular covers for three of them.

1 October 2012 in Discrete Mathematics
Verified
Journal Article
Closed access
MHMichael I. Hartley
Michael I. Hartley
DPDaniel Pellicer
Daniel Pellicer
GWGordon Williams
Gordon Williams

1 October 2017 in Journal of Graph Algorithms and Applications
Verified
Journal Article
Open access
LBLeah Berman
Leah Berman
GCGlenn Chappell
Glenn Chappell
JFJill Faudree
Jill Faudree
JGJohn Gimbel
John Gimbel
CHChris Hartman
Chris Hartman
GWGordon Williams
Gordon Williams
An obstacle representation of a graph $G$ is a straight-line drawing of $G$ in the plane, together with a collection of connected subsets of the plane, called obstacles, that block all non-edges of $G$ while not blocking any edges of $G$. The obstacle number $\mathrm{obs}(G)$ is the least number of obstacles required to represent $G$. We study the structure of graphs with obstacle number greater than one. We show that the icosahedron has obstacle number $2$, thus answering a question of Alpert, Koch, & Laison asking whether all planar graphs have obstacle number at most $1$. We also show that the $1$-skeleta of two related polyhedra, the gyroelongated $4$-bipyramid and the gyroelongated $6$-bipyramid, have obstacle number $2$. The order of the former graph is $10$, which is also the order of the smallest known graph with obstacle number $2$, making this the smallest known planar graph with obstacle number $2$. Our methods involve instances of the Satisfiability problem; we make use of various "SAT solvers" in order to produce computer-assisted proofs.

8 June 2012 in Ars Mathematica Contemporanea
Verified
Journal Article
Closed access
BMBarry Monson
Barry Monson
DPDaniel Pellicer
Daniel Pellicer
GWGordon Williams
Gordon Williams
Every abstract 3-polytope M, in particular, every polyhedral map, has a unique minimal regular cover, and the automorphism group of this cover is isomorphic to the monodromy group of M. Here we demonstrate that the situation for polytopes of higher rank must be very different: the tomotope T is a small, highly involved, abstract uniform 4-polytope. It has infinitely many distinct minimal regular covers.