Juggling Braids and Links

Devadoss, Satyan L.; Mugno, John
June 2007
Mathematical Intelligencer;Summer2007, Vol. 29 Issue 3, p15
Academic Journal
The article offers information on how to construct and study a map from juggling sequences to topological braids. The author presented a sequence of nonnegative integers and problem involving interactions between two even throws. Furthermore, it is noted braids have a rich history in mathematics, appearing in numerous areas.


Related Articles

  • Quantum entanglement properties of geometrical and topological quantum gates. Sezer, Hasan Cavit; Duy, Hoang Ngoc; Heydari, Hoshang // AIP Conference Proceedings;3/28/2011, Vol. 1327 Issue 1, p472 

    In this paper we will investigate the action of holonomic and topological quantum gates on different classes of four qubit states. In particular, we review the construction of holonomic quantum gate based on geometric phase and topological quantum gate based on braid group. Then, we investigate...

  • Morse theory on spaces of braids and Lagrangian dynamics. Ghrist, R.W.; Van den Berg, J.B.; Vandervorst, R.C. // Inventiones Mathematicae;May2003, Vol. 152 Issue 2, p369 

    In the first half of the paper we construct a Morse-type theory on certain spaces of braid diagrams. We define a topological invariant of closed positive braids which is correlated with the existence of invariant sets of parabolic flows defined on discretized braid spaces. Parabolic flows, a...

  • Necessary and Sufficient Constraint Qualification for Surrogate Duality. Suzuki, Satoshi; Kuroiwa, Daishi // Journal of Optimization Theory & Applications;Feb2012, Vol. 152 Issue 2, p366 

    In mathematical programming, constraint qualifications are essential elements for duality theory. Recently, necessary and sufficient constraint qualifications for Lagrange duality results have been investigated. Also, surrogate duality enables one to replace the problem by a simpler one in which...

  • On the Roman Edge Domination Number of a Graph.  // International Journal of Mathematical Combinatorics;Dec2010, Vol. 4, p38 

    No abstract available.

  • On the independence of expansions of algebraic numbers in an integer base. Boris Adamczewski; Yann Bugeaud // Bulletin of the London Mathematical Society;May2007, Vol. 39 Issue 2, p283 

    Let b = 2 be an integer. According to a conjecture of �mile Borel, the b-adic expansion of any irrational algebraic number behaves in some respects �like a random sequence�. We give a contribution to the following related problem: let a and a' be irrational algebraic numbers, then...

  • Improved sorting-based procedure for integer programming. Dantchev, Stefan // Mathematical Programming;2002, Vol. 92 Issue 2, p297 

    Recently, Cornuéjols and Dawande have considered a special class of 0-1 programs that turns out to be hard for existing IP solvers. One of them is a sorting-based algorithm, based on an idea of Wolsey. In this paper, we show how to improve both the running time and the space requirements of...

  • DIVERSIONS. Scott, Paul // Australian Mathematics Teacher;Mar2002, Vol. 58 Issue 1, p36 

    Presents an article on several difficult classes of problems in mathematics and their solutions. Clock problems; Problems with integer multiples; Details of Pythagorean puzzle solving.

  • Seifert surfaces in open books, and a new coding algorithm for links. Rei Furihata; Mikami Hirasawa; Tsuyoshi Kobayashi // Bulletin of the London Mathematical Society;Jun2008, Vol. 40 Issue 3, p405 

    We show that for any link L, there exists a Seifert surface for L that is obtained by successively plumbing flat annuli to a disk D, where the gluing regions are all in D. This furnishes a new way of coding links. We also present an algorithm to read the code directly from a braid presentation.

  • Broadening the integer programming audience, the LINDO perspective. Schrage, Linus; Cunningham, Kevin // Annals of Operations Research;Feb2007, Vol. 149 Issue 1, p177 

    The article deals with LINDO's integer programming. It also mentions that nonlinear programming gives rise to the application of integer programming even when linearization does not apply. Much of the technology of linear integer programming carries over to nonlinear optimization in order to...


Read the Article


Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics