Geometry and Topology Commons^™

Partitioning Regular Polygons Into Circular Pieces Ii: Nonconvex Partitions, Mirela Damian, Joseph O'Rourke

Computer Science: Faculty Publications

We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal circular partition minimizes the maximum ratio over all pieces in the partition. We show that the equilateral triangle has an optimal 4-piece nonconvex partition, the square an optimal 13-piece nonconvex partition, and the pentagon has an optimal nonconvex partition with more than 20 thousand pieces. For hexagons and beyond, we provide a general algorithm that approaches optimality, but does not achieve it.

Unfolding Smooth Prismatoids, Nadia Benbernou, Patricia Cahn, Joseph O'Rourke

Computer Science: Faculty Publications

We define a notion for unfolding smooth, ruled surfaces, and prove that every smooth prismatoid (the convex hull of two smooth curves lying in parallel planes), has a nonoverlapping “volcano unfolding.” These unfoldings keep the base intact, unfold the sides outward, splayed around the base, and attach the top to the tip of some side rib. Our result answers a question for smooth prismatoids whose analog for polyhedral prismatoids remains unsolved.

Random Walks On The Torus With Several Generators, Timothy Prescott '02, Francis E. Su

All HMC Faculty Publications and Research

Given n vectors {_i} ∈ [0, 1)^d, consider a random walk on the d-dimensional torus ^d = ℝ^d/ℤ^d generated by these vectors by successive addition and subtraction. For certain sets of vectors, this walk converges to Haar (uniform) measure on the torus. We show that the discrepancy distance D(Q*^k) between the kth step distribution of the walk and Haar measure is bounded below by D(Q*^k) ≥ C₁k^−n/2, where C₁ = C(n, d) is …

Cultural Topology: An Introduction To Postmodern Mathematics, Brent M. Blackwell

Reconstruction: Studies in Contemporary Culture

[Editors' Introduction]

This essay develops a new way of thinking about the cultural relationships among and within the sciences and the arts through a new understanding of the term postmodernism that at once derives from literary theory and the mathematical discipline of topology. While topology forms the main vertebra of this connective approach in its capacity as the mathematics of connectivity, quantum mechanics and non-Euclidean geometry -- the atlas and axis of this spinal column -- form the context through which this “postmodern” approach will develop. However, in order to position topology as a “postmodern” branch of mathematics, some brief …

Of Parts And Wholes: Self-Similarity And Synecdoche In Science, Culture And Literature, Dirk Vanderbeke

Reconstruction: Studies in Contemporary Culture

[Editors' Introduction]

The discussion here centers on how self-similarity, or parts resembling a whole, has been a recurring aspect in the most diverse fields of human thinking from antiquity to the present. Primary examples are drawn from physics, biology, cybernetics, alchemy, philosophy, myth and, of course, language and literature. The author argues that self-similar patterns are one of the persistent ways in which the human mind structures its experience and knowledge of the world, and then examines some of the questions that arise when an almost ubiquitous concept, structure or linguistic and literary phenomenon resurfaces in a new guise in …

The Birational Isomorphism Types Of Smooth Real Elliptic Curves, Sean A. Broughton

Mathematical Sciences Technical Reports (MSTR)

In this note we determine all birational isomorphism types of real elliptic curves and show that it is the same as the orbit space of smooth cubic real curves in real projective space under linear projective equivalence. There are two families, each depending polynomially on a real parameter in a open subinterval of R. We further show that the complexification of a real elliptic curve has exactly two real forms. Thus the real elliptic curves come in pairs which are isomorphic over C. Finally, the map taking a real elliptic curve to its j-invariant maps the two families …

The Effects Of The Use Of Dynamic Geometry Software On Student Achievement And Interest, Heidi B. Hansen

Mathematics Graduate Theses

This study examines the current research that exists on the effects that the use of dynamic geometry software has on student achievement and interest level in mathematics. Additional questions examined are whether using dynamic geometry software has a greater impact on high or low achievers, and what current methods of implementation are suggested by the research. A review of the relevant literature indicates that the use of dynamic geometry software does have a positive effect on student achievement, particularly achievement in areas of high-level thinking. Insufficient research has been done on the effect that the use of dynamic geometry software …

On The Behavior Of The Algebraic Transfer, Robert R. Bruner, Lê M. Hà, Nguyễn H. V Hưng

Mathematics Faculty Research Publications

Let Tr_k : ��_2 (⊗ over GL_k) PH_i(B��_k) → Ext^(k,k+i)_A(��_2,��_2) be the algebraic transfer, which is defined by W. Singer as an algebraic version of the geometrical transfer tr_k : π_∗^S((B��_k)_+) → π_∗^S(S^0). It has been shown that the algebraic transfer is highly nontrivial and, more precisely, that Tr_k is an isomorphism for k = 1,2,3. However, Singer showed that Tr_5 is not an epimorphism. In this paper, we prove that Tr_4 does not detect the non zero element g_s ∈ Ext^(4,12·2^s)_A(��_2,��_2) for every s ≥ 1. As a consequence, the localized (Sq^0)^(−1)Tr_4 given by inverting the squaring operation Sq^0 …

On The Number Of Embeddings Of Minimally Rigid Graphs, Ciprian Borcea, Ileana Streinu

Computer Science: Faculty Publications

Rigid frameworks in some Euclidean space are embedded graphs having a unique local realization (up to Euclidean motions) for the given edge lengths, although globally they may have several. We study the number of distinct planar embeddings of minimally rigid graphs with $n$ vertices. We show that, modulo planar rigid motions, this number is at most ${{2n-4}\choose {n-2}} \approx 4^n$. We also exhibit several families which realize lower bounds of the order of $2^n$, $2.21^n$ and $2.28^n$. For the upper bound we use techniques from complex algebraic geometry, based on the (projective) Cayley--Menger variety ${\it CM}^{2,n}(C)\subset P_{{{n}\choose {2}}-1}(C)$ over the …

Examples Of Cayley 4-Manifolds, Weiqing Gu, Christopher Pries '03

All HMC Faculty Publications and Research

We determine several families of so-called Cayley 4-dimensional manifolds in the real Euclidean 8-space. Such manifolds are of interest because Cayley 4-manifolds are supersymmetric cycles that are candidates for representations of fundamental particles in String Theory. Moreover, some of the examples of Cayley manifolds discovered in this paper may be modified to construct explicit examples in our current search for new holomorphic invariants for Calabi-Yau 4-folds and for the further development of mirror symmetry.

We apply the classic results of Harvey and Lawson to find Cayley manifolds which are graphs of functions from the set of quaternions to itself. We …

A 2-Chain Can Interlock With A K-Chain, Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong

Computer Science: Faculty Publications

One of the open problems posed in [3] is: what is the minimal number k such that an open, flexible k-chain can interlock with a flexible 2-chain? In this paper, we establish the assumption behind this problem, that there is indeed some k that achieves interlocking. We prove that a flexible 2-chain can interlock with a flexible, open 16-chain.

Computational Geometry Column 45, Joseph O'Rourke

Computer Science: Faculty Publications

The algorithm of Edelsbrunner for surface reconstruction by "wrapping" a set of points in R³ is described.

Homology Of Holomorphs Of Free Groups, Craig A. Jensen

Mathematics Faculty Publications

Let Fn be the free group on n letters and let Aut(Fn), Out(Fn) denote the automorphism group and the outer automorphism group of Fn. In this paper the purpose is to obtain some new results on stability and to calculate the mod-p homology of the holomorph of Fn for odd primes in dimensions 1 and 2, and the rational homology in dimensions from 1 through 5.

Automorphisms Of Free Groups With Boundaries, Craig A. Jensen, Nathalie Wahl

Mathematics Faculty Publications

The automorphisms of free groups with boundaries form a family of groups An,k closely related to mapping class groups, with the standard automorphisms of free groups as An,0 and (essentially) the symmetric automorphisms of free groups as A0,k. We construct a contractible space Ln,k on which An,k acts with finite stabilizers and finite quotient space and deduce a range for the virtual cohomological dimension of An,k. We also give a presentation of the groups and calculate their first homology group.

Tree Diagrams For String Links Ii: Determining Chord Diagrams, Blake Mellor

Mathematics, Statistics and Data Science Faculty Works

In previous work, we defined the intersection graph of a chord diagram associated with a string link (as in the theory of finite type invariants). In this paper, we look at the case when this graph is a tree, and we show that in many cases these trees determine the chord diagram (modulo the usual 1-term and 4-term relations).

Quantization With Knowledge Base Applied To Geometrical Nesting Problem, Grzegorz Chmaj, Leszek Koszalka

Electrical & Computer Engineering Faculty Research

Nesting algorithms deal with placing two-dimensional shapes on the given canvas. In this paper a binary way of solving the nesting problem is proposed. Geometric shapes are quantized into binary form, which is used to operate on them. After finishing nesting they are converted back into original geometrical form. Investigations showed, that there is a big influence of quantization accuracy for the nesting effect. However, greater accuracy results with longer time of computation. The proposed knowledge base system is able to strongly reduce the computational time.