A Finite-Bound Partition Equinumerosity Result Generalizing a Solution of a Problem Posed by Andrews and Deutsch
Combinatorics
2023-12-18 v1
Abstract
We introduce a finite-bound extension of a partition equinumerosity result which was orignally proposed as a problem by Andrews and Deutsch in 2016, and given a generalized form in 2018 by Smoot and Yang. We also give a simple bijective proof, itself an extension of the proof given of the 2018 generalization.
Cite
@article{arxiv.2312.09973,
title = {A Finite-Bound Partition Equinumerosity Result Generalizing a Solution of a Problem Posed by Andrews and Deutsch},
author = {Michael J. Schlosser and Nicolas Allen Smoot},
journal= {arXiv preprint arXiv:2312.09973},
year = {2023}
}