On the finite completion of partial latin cubes
From MaRDI portal
Publication:1843440
DOI10.1016/0097-3165(74)90032-6zbMath0282.05015OpenAlexW2021207890MaRDI QIDQ1843440
Publication date: 1974
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(74)90032-6
Free semigroups, generators and relations, word problems (20M05) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05)
Related Items (14)
On the rank of a Latin tensor ⋮ Intersection problem of Steiner systems S(3,4,2v) ⋮ Multidimensional Latin bitrades ⋮ Embedding in MDS codes and Latin cubes ⋮ Completion and deficiency problems ⋮ A construction of orthogonal arrays and applications to embedding theorems ⋮ Latin cubes with forbidden entries ⋮ Classification of Graeco-Latin Cubes ⋮ 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 ⋮ Latin cubes of even order with forbidden entries ⋮ Maximal partial Latin cubes ⋮ Generalized Hilton construction for embedding d-ary quasigroups
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Latin cubes orthogonal to their transposes, a ternary analogue of Stein quasigroups
- Transversal theory. An account of some aspects of combinatorial mathematics
- Extremal configurations and decomposition theorems. I
- Embedding Incomplete Latin Squares
- Über eine Klasse von ternären Quasigruppen
- Applications of the notion of independence to problems of combinatorial analysis
- Finitely Presented Loops, Lattices, etc. are Hopfian
- Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem
- A Combinatorial Theorem with an Application to Latin Rectangles
- Systems of Distinct Representatives
- An existence theorem for latin squares
This page was built for publication: On the finite completion of partial latin cubes
