Magic & Math with Cards

Lecture 22 · Mathematics

Universal cycles

Patterns beyond binary words

Video in production

This lecture is still face down. Its script is written; filming and animation are under way.

Meanwhile, read the outline

What you will learn

Define universal cycles through explicit encoding rules and distinguish verified relative-order examples from unsupported generalizations.

Before this lecture

Ideas you will use

  • Permutations of 3 or 4 roles

In this lecture

An outline of the lecture, scene by scene, with the statements that appear on screen. It follows the draft script, so details may change in production.

  1. Ask what a window is allowed to encode

    • Specify the pattern family
    • Specify the encoding rule
    • Universal means complete for that family

  2. Compare exact-word and relative-order equivalence

    • Label roles in place; do not sort cards
    • 146 and 259 both LMH
    • Ties require a different pattern family

  3. Verify 6 cycle and show sorted counterexample

    • 146253 covers 6 patterns
    • 123456 repeats LMH4 times
    • Equal counts are not enough

  4. Explore 4-role cycle with repeated values but not within window

    • 4!=24 patterns
    • Repeated values allowed across the cycle
    • No ties within each 4-window

  5. Explain why binary Euler theorem cannot be copied blindly

    • Literal overlap=equality of symbols
    • Relative overlap forgets actual values
    • Analogy is not automatic proof

  6. Introduce equality partitions with concrete patterns and constraint

    • CDDHC→{1,5}|{2,3}|{4}
    • Equality pattern forgets suit names
    • 5 singleton groups need 5 categories

  7. Companion pattern family lab with no invented existence claim

    • Choose encoding before checking
    • Report ties explicitly
    • Universal for which family?

  8. Close with design checklist and bridge 2D

    • Family +encoding +compatible cycle
    • Count is the start, not the finish
    • Next: local addresses in two dimensions

Companion interactive

Planned

State and test universality for a declared pattern family.

The interactive for this lecture is being built and will appear here.

Notes

Written notes for this lecture will appear here.

Sources

How these sources were used
  • Persi Diaconis and Ron Graham, Magical Mathematics: Universal cycles, relative patterns, products and partitions.
  • Colm Mulcahy, Mathematical Card Magic: Six-rank and 24-position relative-order examples.