Cites work
- A Combinatorial Theorem with an Application to Latin Rectangles
- Embeddability and the Word Problem
- Embedding Incomplete Latin Squares
- Finitely Presented Loops, Lattices, etc. are Hopfian
- scientific article; zbMATH DE number 3182201 (Why is no real title available?)
- Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
- The completion of finite incomplete Steiner triple systems with applications to loop theory
- The Word Problem for Abstract Algebras
Cited in
(12)- Strong finite embeddability for classes of quasigroups
- 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
- Embedding an incomplete diagonal latin square in a complete diagonal latin square
- On completing partial Latin squares with prescribed diagonals
- Finite partial cyclic triple systems can be finitely embedded
- Finite embedding theorems for partial Latin squares, quasi-groups, and loops
- Completing a solution of the embedding problem for incomplete idempotent Latin squares when numerical conditions suffice
- Embedding an incomplete latin square in a latin square with a prescribed diagonal
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)
