Embedding partial idempotent Latin squares
From MaRDI portal
Publication:2545693
DOI10.1016/0097-3165(71)90027-6zbMATH Open0215.33403OpenAlexW2061267650MaRDI QIDQ2545693FDOQ2545693
Authors: C. 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
Cites Work
- Title not available (Why is that?)
- Embedding Incomplete Latin Squares
- A Combinatorial Theorem with an Application to Latin Rectangles
- 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
- The completion of finite incomplete Steiner triple systems with applications to loop theory
Cited In (12)
- Intersection preserving finite embedding theorems for partial quasigroups
- Totally symmetric and semi-symmetric quasigroups have the intersection preserving finite embeddability property
- On completing partial Latin squares with prescribed diagonals
- Embedding an incomplete latin square in a latin square with a prescribed diagonal
- Finite embedding theorems for partial Latin squares, quasi-groups, and loops
- Strong finite embeddability for classes of quasigroups
- Two finite embedding theorems for partial 3-quasigroups
- Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
- Finite partial cyclic triple systems can be finitely embedded
- Embedding an incomplete diagonal latin square in a complete diagonal latin square
- A finite partial idempotent latin cube can be embedded in a finite idempotent latin cube
- Finite embeddability in a class of infinitary algebras
This page was built for publication: Embedding partial idempotent Latin squares
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2545693)
