Finite embedding theorems for partial Latin squares, quasi-groups, and loops

DOI10.1016/0097-3165(72)90067-2zbMath0246.05012OpenAlexW2092581972MaRDI QIDQ2555503

Charles C. Lindner

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(72)90067-2

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05) Varieties (08B99)

Related Items

Completion and deficiency problems, On embedding incomplete symmetric Latin squares, Strong finite embeddability for classes of quasigroups, Research problems from the 19th British Combinatorial Conference, Finite embeddability in a class of infinitary algebras, Intersection preserving finite embedding theorems for partial quasigroups, Totally symmetric and semi-symmetric quasigroups have the intersection preserving finite embeddability property, Finite partial cyclic triple systems can be finitely embedded, Constructing and embedding mutually orthogonal Latin squares: reviewing both new and existing results

Cites Work

• Embedding partial idempotent Latin squares
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• On the Foundations of Quasigroups
• Embedding Incomplete Latin Squares
• Finitely Presented Loops, Lattices, etc. are Hopfian
• Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
• The Word Problem for Abstract Algebras
• Embeddability and the Word Problem