Alexander.Berkovich

Affiliation: University of Florida

Title Of Talk: Finite analogs of partition bias related to hook length two and a variant of Sylvester's map

Abstract: In this talk I discuss the total number of hooks of length two in all odd partitions of n and all distinct partitions of n with a bound on the largest part of the partitions. I generalize inequalities of Ballantine, Burson, Craig, Folsom and Wen by showing there is a bias in the number of hooks of length two in all odd partitions over all distinct partitions of n in presence of a bound on the largest part. To establish such a bias, I use a variant of Sylvester's map. This talk is based on a joint work with Aritram Dhar

WARNING: This page contains MATH-JAX

Last update made Tue Mar 10 21:28:01 CDT 2026.
Please report problems to: fgarvan@ufl.edu