7,871 research outputs found
How efficiently can one untangle a double-twist? Waving is believing!
It has long been known to mathematicians and physicists that while a full
rotation in three-dimensional Euclidean space causes tangling, two rotations
can be untangled. Formally, an untangling is a based nullhomotopy of the
double-twist loop in the special orthogonal group of rotations. We study a
particularly simple, geometrically defined untangling procedure, leading to new
conclusions regarding the minimum possible complexity of untanglings. We
animate and analyze how our untangling operates on frames in 3-space, and teach
readers in a video how to wave the nullhomotopy with their hands.Comment: To appear in The Mathematical Intelligencer. For supplemental videos,
see http://www.math.iupui.edu/~dramras/double-tip.html , or
https://www.youtube.com/playlist?list=PLAfnEXvHU52ldJaOye-8kZV_C1CjxGx2C .
For a supplemental virtual reality experience, see
http://meglab.wikidot.com/visualizatio
A Robust Solution Procedure for Hyperelastic Solids with Large Boundary Deformation
Compressible Mooney-Rivlin theory has been used to model hyperelastic solids,
such as rubber and porous polymers, and more recently for the modeling of soft
tissues for biomedical tissues, undergoing large elastic deformations. We
propose a solution procedure for Lagrangian finite element discretization of a
static nonlinear compressible Mooney-Rivlin hyperelastic solid. We consider the
case in which the boundary condition is a large prescribed deformation, so that
mesh tangling becomes an obstacle for straightforward algorithms. Our solution
procedure involves a largely geometric procedure to untangle the mesh: solution
of a sequence of linear systems to obtain initial guesses for interior nodal
positions for which no element is inverted. After the mesh is untangled, we
take Newton iterations to converge to a mechanical equilibrium. The Newton
iterations are safeguarded by a line search similar to one used in
optimization. Our computational results indicate that the algorithm is up to 70
times faster than a straightforward Newton continuation procedure and is also
more robust (i.e., able to tolerate much larger deformations). For a few
extremely large deformations, the deformed mesh could only be computed through
the use of an expensive Newton continuation method while using a tight
convergence tolerance and taking very small steps.Comment: Revision of earlier version of paper. Submitted for publication in
Engineering with Computers on 9 September 2010. Accepted for publication on
20 May 2011. Published online 11 June 2011. The final publication is
available at http://www.springerlink.co
Twenty-Five Comparators is Optimal when Sorting Nine Inputs (and Twenty-Nine for Ten)
This paper describes a computer-assisted non-existence proof of nine-input
sorting networks consisting of 24 comparators, hence showing that the
25-comparator sorting network found by Floyd in 1964 is optimal. As a
corollary, we obtain that the 29-comparator network found by Waksman in 1969 is
optimal when sorting ten inputs.
This closes the two smallest open instances of the optimal size sorting
network problem, which have been open since the results of Floyd and Knuth from
1966 proving optimality for sorting networks of up to eight inputs.
The proof involves a combination of two methodologies: one based on
exploiting the abundance of symmetries in sorting networks, and the other,
based on an encoding of the problem to that of satisfiability of propositional
logic. We illustrate that, while each of these can single handed solve smaller
instances of the problem, it is their combination which leads to an efficient
solution for nine inputs.Comment: 18 page
Using tabu search and genetic algorithms in mathematics research
This paper discusses an ongoing project which uses computational heuristic search techniques such as tabu search and genetic algorithms as a tool for mathematics research. We discuss three ways in which such search techniques can be useful for mathematicians: in nding counterexamples to conjectures, in enumerating examples, and in nding sequences of transformations between two objects which are conjectured to be related. These problem-types are discussed using examples from topology
- …