Mates in near-factorizations are unique and explicitly computable, and nontrivial near-factorizations are shown not to exist in noncyclic abelian groups below order 200.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.GR 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Uniqueness and explicit computation of mates in near-factorizations
Mates in near-factorizations are unique and explicitly computable, and nontrivial near-factorizations are shown not to exist in noncyclic abelian groups below order 200.