Embedding partial idempotent Latin squares

DOI10.1016/0097-3165(71)90027-6zbMath0215.33403OpenAlexW2061267650MaRDI QIDQ2545693

Charles C. Lindner

Publication date: 1971

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(71)90027-6

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items

On completing partial Latin squares with prescribed diagonals ⋮ Embedding an incomplete diagonal latin square in a complete diagonal latin square ⋮ Strong finite embeddability for classes of quasigroups ⋮ Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice ⋮ A finite partial idempotent latin cube can be embedded in a finite idempotent latin cube ⋮ Finite embeddability in a class of infinitary algebras ⋮ Two finite embedding theorems for partial 3-quasigroups ⋮ 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 ⋮ Finite embedding theorems for partial Latin squares, quasi-groups, and loops ⋮ Embedding an incomplete latin square in a latin square with a prescribed diagonal

Cites Work

• Unnamed Item
• The completion of finite incomplete Steiner triple systems with applications to loop theory
• 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
• A Combinatorial Theorem with an Application to Latin Rectangles
• Embeddability and the Word Problem