Mathematics Commons^™

Unfolding Convex Polyhedra Via Quasigeodesic Star Unfoldings, Jin-Ichi Itoh, Joseph O'Rourke, Costin Vîlcu

Computer Science: Faculty Publications

We extend the notion of a star unfolding to be based on a simple quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron P to a simple, planar polygon: shortest paths from all vertices of P to Q are cut, and all but one segment of Q is cut.

Singularities Of Hinge Structures, Ciprian Borcea, Ileana Streinu

Computer Science: Faculty Publications

Motivated by the hinge structure present in protein chains and other molecular conformations, we study the singularities of certain maps associated to body-and-hinge and panel-and-hinge chains. These are sequentially articulated systems where two consecutive rigid pieces are connected by a hinge, that is, a codimension two axis. The singularities, or critical points, correspond to a dimensional drop in the linear span of the axes, regarded as points on a Grassmann variety in its Pl¨ucker embedding. These results are valid in arbitrary dimension. The three dimensional case is also relevant in robotics.

Permutation Representations On Schubert Varieties, Julianna S. Tymoczko

Mathematics Sciences: Faculty Publications

This paper defines and studies permutation representations on the equivariant cohomology of Schubert varieties, as representations both over ℂ and over ℂ[t1, t2, . . . , tn]. We show these group actions are the same as an action of simple transpositions studied geometrically by M. Brion, and give topological meaning to the divided difference operators of Berstein-Gelfand-Gelfand, Demazure, Kostant-Kumar, and others. We analyze these representations using the combinatorial approach to equivariant cohomology introduced by Goresky-Kottwitz-MacPherson. We find that each permutation representation on equivariant cohomology produces a representation on ordinary cohomology that is trivial, though the equivariant representation is not.

The Mixed Problem In L P For Some Two-Dimensional Lipschitz Domains, Loredana Lanzani, Luca Capogna, Russell M. Brown

Mathematics Sciences: Faculty Publications

We consider the mixed problem, {Δ u = 0 in Ω ∂u = f N on N u = fD on D in a class of Lipschitz graph domains in two dimensions with Lipschitz constant at most 1. We suppose the Dirichlet data, f D , has one derivative in L p (D) of the boundary and the Neumann data, f N , is in L p (N). We find a p 0 > 1 so that for p in an interval (1, p 0), we may find a unique solution to the mixed problem and the gradient of the solution …

Enumerating Constrained Non-Crossing Minimally Rigid Frameworks, David Avis, Naoki Katoh, Makoto Ohsaki, Ileana Streinu, Shin-Ichi Tanigawa

Computer Science: Faculty Publications

In this paper we present an algorithm for enumerating without repetitions all the non-crossing generically minimally rigid bar-and-joint frameworks under edge constraints, which we call constrained non-crossing Laman frameworks, on a given set of n points in the plane. Our algorithm is based on the reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n4) time and O(n) space, or, with a slightly different implementation, in O(n3) time and O(n2) space. In particular, we obtain that the set of all the constrained non-crossing Laman …

Unfolding Manhattan Towers, Mirela Damian, Robin Flatland, Joseph O'Rourke

Computer Science: Faculty Publications

We provide an algorithm for unfolding the surface of any orthogonal polyhedron that falls into a particular shape class we call Manhattan Towers, to a nonoverlapping planar orthogonal polygon. The algorithm cuts along edges of a 4×5×1 refinement of the vertex grid.

A Note On Ill-Posedness Of The Cauchy Problem For Heisenberg Wave Maps, Luca Capogna, Jalal Shatah

Mathematics Sciences: Faculty Publications

We introduce a notion of wave maps with a target in the sub- Riemannian Heisenberg group and study their relation with Riemannian wave maps with range in Lagrangian submanifolds. As an application we establish existence and eventually ill-posedness of the corresponding Cauchy problem.

Pebble Game Algorithms And Sparse Graphs, Audrey Lee, Ileana Streinu

Computer Science: Faculty Publications

A multi-graph G on n vertices is (k,ℓ)-sparse if every subset of n^′⩽n vertices spans at most kn^′-ℓ edges. G is tight if, in addition, it has exactly kn-ℓ edges. For integer valuesk and ℓ∈[0,2k), we characterize the (k,ℓ)-sparse graphs via a family of simple, elegant and efficient algorithms called the (k,ℓ)-pebble games. [A. Lee, I. Streinu, Pebble game algorithms and sparse graphs, Discrete Math. 308 (8) (2008) 1425–1437] from graphs to hypergraphs.

Cauchy’S Arm Lemma On A Growing Sphere, Zachary Abel, David Charlton, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Godfried Toussaint

Computer Science: Faculty Publications

We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between its endpoints increases. The main focus of this work is a comparison of three alternate proofs, to show the links between Toponogov's Comparison Theorem, Legendre's Theorem and Cauchy's Arm Lemma.

Grid Vertex-Unfolding Orthogonal Polyhedra, Mirela Damian

Computer Science: Faculty Publications

No abstract provided.

A Class Of Convex Polyhedra With Few Edge Unfoldings, Alex Benton, Joseph O'Rourke

Computer Science: Faculty Publications

We construct a sequence of convex polyhedra on n vertices with the property that, as n -> infinity, the fraction of its edge unfoldings that avoid overlap approaches 0, and so the fraction that overlap approaches 1. Nevertheless, each does have (several) nonoverlapping edge unfoldings.

Calculus In Context, James Callahan, David Cox, Kenneth Hoffman, Donal O'Shea, Harriet Pollatsek, Lester Senechal

Open Educational Resources: Textbooks

Designing the curriculum

We believe that calculus can be for students what it was for Euler and the Bernoullis: a language and a tool for exploring the whole fabric of science. We also believe that much of the mathematical depth and vitality of calculus lies in connections to other sciences. The mathematical questions that arise are compelling in part because the answers matter to other disciplines. We began our work with a "clean slate," not by asking what parts of the traditional course to include or discard. Our starting points are thus our summary of what calculus is really about. …