Jagged partitions and lattice paths
Abstract
A lattice-path description of K-restricted jagged partitions is presented. The corresponding lattice paths can have peaks only at even x coordinate and the maximal value of the height cannot be larger than K-1. Its weight is twice that of the corresponding jagged partitions. The equivalence is demonstrated at the level of generating functions. A bijection is given between K-restricted jagged partitions and partitions restricted by the following frequencies conditions: f2j-1 is even and fj+fj+1≤ K-1, where fj is the number of occurrences of the part j in the partition. Bijections are given between paths and these restricted partitions and between paths and partitions with successive ranks in a prescribed interval.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.