Pith. Sign in

RECORD

Maximal subgroups of finitely presented special inverse monoids

Group Theory · Submitted 8 Dec 2022

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and moreover every such maximal subgroup can also arise in the $E$-unitary case.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2212.04204 (version 2)
Pith IDO4JGMQK2, Pith's permanent record of this paper and its review
CitationMark Kambites, Robert D. Gray. "Maximal subgroups of finitely presented special inverse monoids." arXiv:2212.04204 (2022). https://pith.science/paper/O4JGMQK2
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,421 input tokens.

What the abstract itself states, as probabilities: claims first 0.70 · states limitation 0.25 · human participants 0.01 · controlled comparison 0.03 · randomized assignment 0.01 · states quantitative result 0.14 · compares with prior results 0.91 · mentions code or data availability 0.01.

The abstract, sentence by sentence

arXiv listing abstract v2. Results and the main claim are underlined; .

We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and moreover every such maximal subgroup can also arise in the $E$-unitary case. We also prove that the possible groups of units are exactly the finitely generated recursively presented groups; this improves upon a result of, and answers a question of, the first author and Ru\v{s}kuc. These results give the first significant insight into the maximal subgroups of such monoids beyond the group of units, and the results together demonstrate that it is possible for the subgroup structure to have a complexity which significantly exceeds that of the group of units. We also observe that a finitely presented special inverse monoid (even an $E$-unitary one) may have infinitely many pairwise non-isomorphic maximal subgroups.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. contribution 0.72 0.82 0.04 asserted 0.65
s1 We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and moreover every such maximal subgroup can also arise in the $E$-unitary case. result 1.00 0.96 0.77 asserted 1.00
s2 We also prove that the possible groups of units are exactly the finitely generated recursively presented groups; this improves upon a result of, and answers a question of, the first author and Ru\v{s}kuc. result 0.99 0.91 0.14 asserted 1.00
s3 These results give the first significant insight into the maximal subgroups of such monoids beyond the group of units, and the results together demonstrate that it is possible for the subgroup structure to have a complexity which significantly exceeds that of the group of units. interpretation 1.00 0.88 0.14 asserted 0.99
s4 We also observe that a finitely presented special inverse monoid (even an $E$-unitary one) may have infinitely many pairwise non-isomorphic maximal subgroups. result 1.00 0.92 0.07 hedged possibility 0.95

What kind of paper the classifier reports this is: theoretical result 1.00 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v2
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

We study the maximal subgroups (also known as group $\mathcal{H}$-classes) of finitely presented special inverse monoids. We show that the maximal subgroups which can arise in such monoids are exactly the recursively presented groups, and moreover every such maximal subgroup can also arise in the $E$-unitary case. We also prove that the possible groups of units are exactly the finitely generated recursively presented groups; this improves upon a result of, and answers a question of, the first author and Ru\v{s}kuc. These results give the first significant insight into the maximal subgroups of such monoids beyond the group of units, and the results together demonstrate that it is possible for the subgroup structure to have a complexity which significantly exceeds that of the group of units. We also observe that a finitely presented special inverse monoid (even an $E$-unitary one) may have infinitely many pairwise non-isomorphic maximal subgroups.

Human review
How the literature uses it

1 arXiv paper cite this in 4 sentences

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

Papers citing it · 1 sentence without a confident label

Uses its method or tool 1 paper
Cites it as background 1 paper

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.