Jagged partitions and lattice paths
P. Jacob, P. Mathieu
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.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.