A conjecture by Bienvenu and Geroldinger on power monoids
Combinatorics
2025-04-04 v2 Number Theory
Abstract
Let be a numerical monoid, i.e., a submonoid of the additive monoid of non-negative integers such that is finite. Endowed with the operation of set addition, the family of all finite subsets of containing is itself a monoid, which we denote by . We show that, if and are numerical monoids and is isomorphic to , then . (In fact, we establish a more general result, in which and are allowed to be subsets of the non-negative rational numbers that contain zero and are closed under addition.) This proves a conjecture of Bienvenu and Geroldinger.
Cite
@article{arxiv.2310.17713,
title = {A conjecture by Bienvenu and Geroldinger on power monoids},
author = {Salvatore Tringali and Weihao Yan},
journal= {arXiv preprint arXiv:2310.17713},
year = {2025}
}
Comments
6 pages, no figures. Final version to appear in Proc. Amer. Math. Soc