A conjecture by Bienvenu and Geroldinger on power monoids

Abstract

Let S be a numerical monoid, i.e., a submonoid of the additive monoid ( N, +) of non-negative integers such that N S is finite. Endowed with the operation of set addition, the family of all finite subsets of S containing 0 is itself a monoid, which we denote by P fin, 0(S). We show that, if S1 and S2 are numerical monoids and P fin, 0(S1) is isomorphic to P fin, 0(S2), then S1 = S2. (In fact, we establish a more general result, in which S1 and S2 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.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…