Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Physical Sciences and Mathematics
On The Quantum Moduli Space Of M-Theory Compactifications, Tamar Friedmann
On The Quantum Moduli Space Of M-Theory Compactifications, Tamar Friedmann
Mathematics Sciences: Faculty Publications
We study the moduli space of M-theories compactified on G2 manifolds which are asymptotic to a cone over quotients of S3 × S3. We show that the moduli space is composed of several components, each of which interpolates smoothly among various classical limits corresponding to low energy gauge theories with a given number of massless U (1) factors. Each component smoothly interpolates among supersymmetric gauge theories with different gauge groups.
Computational Geometry Column 43, Joseph O'Rourke
Computational Geometry Column 43, Joseph O'Rourke
Computer Science: Faculty Publications
The concept of pointed pseudo-triangulations is defined and a few of its applications described.
Nonorthogonal Polyhedra Built From Rectangles, Melody Donoso, Joseph O'Rourke
Nonorthogonal Polyhedra Built From Rectangles, Melody Donoso, Joseph O'Rourke
Computer Science: Faculty Publications
We prove that any polyhedron of genus zero or genus one built out of rectangular faces must be an orthogonal polyhedron, but that there are nonorthogonal polyhedra of genus seven all of whose faces are rectangles. This leads to a resolution of a question posed by Biedl, Lubiw, and Sun [BLS99].
Enumerating Foldings And Unfoldings Between Polygons And Polytopes, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
Enumerating Foldings And Unfoldings Between Polygons And Polytopes, Erik D. Demaine, Martin L. Demaine, Anna Lubiw, Joseph O'Rourke
Computer Science: Faculty Publications
We pose and answer several questions concerning the number of ways to fold a polygon to a polytope, and how many polytopes can be obtained from one polygon; and the analogous questions for unfolding polytopes to polygons. Our answers are, roughly: exponentially many, or nondenumerably infinite.
Vertex-Unfoldings Of Simplicial Manifolds, Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
Vertex-Unfoldings Of Simplicial Manifolds, Erik D. Demaine, David Eppstein, Jeff Erickson, George W. Hart, Joseph O'Rourke
Computer Science: Faculty Publications
We present an algorithm to unfold any triangulated 2-manifold (in particular, any simplicial polyhedron) into a non-overlapping, connected planar layout in linear time. The manifold is cut only along its edges. The resulting layout is connected, but it may have a disconnected interior; the triangles are connected at vertices, but not necessarily joined along edges. We extend our algorithm to establish a similar result for simplicial manifolds of arbitrary dimension.