Siteswap
A siteswap is a sequence encountered in Juggling in which each term is a Positive integer, encoded inBinary. The transition rule from one term to the next consists of changing some 0 to 1, subtracting 1, and thendividing by 2, with the constraint that the Division by two must be exact. Therefore, if a term is Even, thebit to be changed must be the units bit. In siteswaps, the number of 1-bits is a constant.
Each transition is characterized by the bit position of the toggled bit (denoted here by the numeral on top ofthe arrow). For example,
 | |
 |
References
Juggling Information Service. ``Siteswaps.'' http://www.juggling.org/help/siteswap/.
- Commutative Algebra
- Commutator
- Compact Group
- Compact Manifold
- Compactness Theorem
- Compact Set
- Compact Space
- Compact Surface
- Companion Knot
- Comparability Graph
- Comparison Test
- Compass
- Compatible
- Complementary Angle
- Complement Graph
- Complement Knot
- Complement Set
- Complete
- Complete Axiomatic Theory
- Complete Bigraph
- Complete Bipartite Graph
- Complete Functions
- Complete Graph
- Complete k-Partite Graph
- Completely Regular Graph