A combinatorial classification of finite quasigroups

DOI10.1007/S10469-019-09517-3zbMATH Open1444.20040OpenAlexW2924313150WikidataQ128166352 ScholiaQ128166352MaRDI QIDQ2011343

I. P. Mishutushkin

Publication date: 6 December 2019

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-019-09517-3

zbMATH Keywords

groupoidquasigroupisomorphismgroupbicyclesubgroupoidbicyclic decompositiongroupoid with right cancellation

Mathematics Subject Classification ID

Loops, quasigroups (20N05)

Cites Work

• Title not available (Why is that?)

Related Items (7)

A combinatorial construction of sets with good quotients by an action of a reductive group ⋮ Classification of quasigroups based on period factors ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ Title not available (Why is that?) ⋮ The Post-Gluskin-Hosszú theorem for finite \(n\)-quasigroups and self-invariant families of permutations ⋮ Title not available (Why is that?)

Recommendations

• Quasigroups 👍 👎
• Classification of cyclic quasigroups 👍 👎
• On some classes of finite quasi-ℱ-groups 👍 👎
• On the classification of finite quasi-quantum groups 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: A combinatorial classification of finite quasigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2011343)