Pith. sign in

REVIEW 2 cited by

On the isomorphism problem for power semigroups

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.11475 v2 pith:AL5RHNRA submitted 2024-02-18 math.RA math.CO

classification math.RAmath.CO
keywords mathcalcompletedownwardsubsemigroupcancellativeisomorphismsemigroupcommutative
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Let $\mathcal P(S)$ be the semigroup obtained by equipping the family of all non-empty subsets of a (multiplicatively written) semigroup $S$ with the operation of setwise multiplication induced by $S$ itself. We call a subsemigroup $P$ of $\mathcal P(S)$ downward complete if any element of $S$ lies in at least one set $X \in P$ and any non-empty subset of a set in $P$ is still in $P$. We obtain, for a commutative semigroup $S$, a characterization of the cancellative elements of a downward complete subsemigroup of $\mathcal P(S)$ in terms of the cancellative elements of $S$. Consequently, we show that, if $H$ and $K$ are cancellative semigroups and either of them is commutative, then every isomorphism from a downward complete subsemigroup of $\mathcal P(H)$ to a downward complete subsemigroup of $\mathcal P(K)$ restricts to an isomorphism from $H$ to $K$. This solves a special case of a problem of Tamura and Shafer from the late 1960s and generalizes a recent result by Bienvenu and Geroldinger, where it is assumed, among other conditions, that $H$ and $K$ are numerical monoids.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On finitary power monoids of linearly orderable monoids

    math.AC 2025-01 conditional novelty 8.0 of 10

    For linearly orderable monoids, quasi-ACCP and almost ACCP ascend to finitary power monoids, while atomicity, near atomicity, and quasi-atomicity do not; atomic power monoids are characterized as those from atomic MCD...

  2. On primality and atomicity of numerical power monoids

    math.CO 2024-12 conditional novelty 6.0 of 10

    Restricted numerical power monoids have no primal elements, and the distribution of atom sizes in P_fin,0(N_0) is asymptotically binomial with parameters n and 1/2.

Pith tools