11 citations · 24 across the 14 of their papers we have counts for
7 papers · 1 filter
A Non-Terminating Game of Beggar-My-Neighbor
Brayden Casella, Philip M. Anderson, Michael Kleber +5
We demonstrate the existence of a non-terminating game of Beggar-My-Neighbor, discovered by lead author Brayden Casella. We detail the method for constructing this game and identif…
A Gray path on binary partitions
Thomas Colthurst, Michael Kleber
A binary partition of a positive integer is a partition of in which each part has size a power of two. In this note we first construct a Gray sequence on the set of binary…
Goldbug Variations
Michael Kleber
This "Mathematical Entertainments" column from the Intelligencer is an exposition of current investigations, rooted in recent work of Jim Propp, into "quasirandom" analogues of ran…
Linearly Independent Products of Rectangularly Complementary Schur Functions
Michael Kleber
Fix a rectangular Young diagram R, and consider all the products of Schur functions s(mu) s(mu^c), where mu and mu^c run over all (unordered) pairs of partitions which are compleme…
Embeddings of Schur functions into types B/C/D
Michael Kleber
We consider the problem of embedding the semi-ring of Schur-positive symmetric polynomials into its analogue for the classical types . If we preserve highest weights and add…
Bijective proofs for Schur function identities which imply Dodgson's condensation formula and Plücker relations
Markus Fulmek, Michael Kleber
We present a ``method'' for bijective proofs for determinant identities, which is based on translating determinants to Schur functions by the Jacobi--Trudi identity. We illustrate…
Tournament Sequences and Meeussen Sequences
Matthew Cook, Michael Kleber
A "tournament sequence" is an increasing sequence of positive integers (t_1,t_2,...) such that t_1=1 and t_{i+1} <= 2 t_i. A "Meeussen sequence" is an increasing sequence of positi…