In this paper, we propose the number of permutations of length n having k overlined inversions, which we call over-Mahonian number. We study useful properties and some combinatorial interpretations by lattice paths/overpartitions and tilings. Furthermore, we prove combinatorially that these numbers form a log-concave sequence and therefore unimodal.
No takes yet. Share an insight, caveat, or question.
Kessouri et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: