Why men (and octopuses) cannot juggle a four ball cascade

The most common juggling pattern is the three ball cascade. A four ball cascade seems to be infeasible, but why? We formalize the notion of a cascade and the decomposition of juggling patterns in order to give an answer to this question

[1]  Reniers,et al.  Completeness in discrete-time process algebra , 1996 .

[2]  M Marc Voorhoeve,et al.  State-event net equivalance , 1998 .

[3]  Roland Carl Backhouse,et al.  Deriving a systolic regular language recognizer , 1997, Algorithmic Languages and Calculi.

[4]  Gjpm Geert-Jan Houben,et al.  Designing effective workflow management processes , 1996 .

[5]  Wil M. P. van der Aalst,et al.  Formalization and verification of event-driven process chains , 1999, Inf. Softw. Technol..

[6]  Jcm Jos Baeten,et al.  Discrete-time process algebra with empty process , 1997 .

[7]  M. Voorhoeve.  Structural Petri net equivalence , 1996 .

[8]  Mgj Franssen,et al.  Tools for the construction of correct programs : an overview , 1997 .

[9]  Wil M. P. van der Aalst,et al.  Exploring the process dimension of workflow management , 1997 .

[10]  Vaj Tijn Borghuis.  Priorean tense logics in modal pure type systems , 1996 .

[11]  Atm Ad Aerts,et al.  Multi-user publishing in the Web: DReSS, a Document Repository Service Station , 1996 .

[12]  Fairouz Kamareddine,et al.  A correspondence between Nuprl and the Ramified Theory of Types , 1996 .

[13]  Peter J. Beek,et al.  The Science of Juggling , 1995 .

[14]  Jan Friso Groote,et al.  Checking Verifications of Protocols and Distributed Systems by Computer , 1998, CONCUR.

[15]  Wil M. P. van der Aalst,et al.  Life-Cycle Inheritance: A Petri-Net-Based Approach , 1997, ICATPN.

[16]  R. Veltkamp,et al.  Efficient evaluation of triangular B-splines , 1999 .

[17]  Lmg Loe Feijs.  Algebraic specification and simulation of lazy functional programs in a concurrent environment , 1996 .

[18]  van Km Kees Hee,et al.  A framework for component based software architectures , 1999 .

[19]  van der Wmp Wil Aalst,et al.  Conservative adaption of workflow , 1996, PAKM.

[20]  Jozef Hooman,et al.  Process Algebra in PVS , 1999, TACAS.

[21]  Jjm Jozef Hooman,et al.  A programming-language extension for distributed real-time systems , 1997 .

[22]  Sjouke Mauw,et al.  PSF : a process specification formalism , 1991 .

[23]  van Km Kees Hee,et al.  An analytical method for assessing business processes , 1998 .

[24]  S. Andova.  Process algebra with interleaving probabilistic parallel composition , 1999 .

[25]  Suzana Andova,et al.  Process Algebra with Probabilistic Choice , 1999, ARTS.

[27]  Jan A. Bergstra,et al.  Deadlock Behaviour in Split and ST Bisimulation Semantics , 1998, EXPRESS.

[28]  W.M.P. van der Aalst,et al.  Parallel computation of reachable dead states in a free-choice Petri net , 1996 .

[29]  V Victor Bos,et al.  Structured operational semantics of chi , 1999 .

[30]  W.M.P. van der Aalst,et al.  Structural characterizations of sound workflow nets , 1996 .

[31]  P.D.V. van der Stok,et al.  Real-time distributed concurrency control algorithms with mixed time constraints , 1996 .

[32]  Michel A. Reniers,et al.  Static semantics of message sequence charts , 1996 .

[33]  Hans Weigand,et al.  A formal specification of deadlines using dynamic deontic logic , 1996 .

[34]  van den Gja Gino Bergen,et al.  Maintenance of the union of intervals on a line revisited , 1998 .

[35]  Roland Carl Backhouse,et al.  Final dialgebras: From categories to allegories , 1999, RAIRO Theor. Informatics Appl..

[36]  Roland Carl Backhouse,et al.  Calculating a Round-Robin Scheduler , 1998, MPC.