scientific article; zbMATH DE number 1455120
The authors employ the common thread of Latin squares to allow them to weave together many important areas of discrete mathematics. Their book is suitable as a text for advanced undergraduate students. Although topics of importance from linear algebra and abstract algebra are provided when needed, the maturity gained from having studied those subjects would prove invaluable in reaping the most benefit from this very well-written and interesting text. After an introduction to Latin squares and a discussion of mutually orthogonal Latin squares, the authors present various generalizations (orthogonal hypercubes and frequency squares). They then present related topics from discrete mathematics, covering the inclusion-exclusion principle, groups, and graphs, showing their relationships with Latin squares. Applications to affine and projective planes, combinatorial designs, magic squares, Room squares, statistics, error-correcting codes, cryptology, and nets are dealt with in detail. After the introductory chapters, most of the chapters are completely independent of each other, and so a number of different types of courses could be offered from this book. Exercises with hints and partial solutions, and many references, are included.
- The subconstituent algebra of a Latin square
- Clique facets of the axial and planar assignment polytopes
- Bol loops and Bruck loops of order \(pq\) up to isotopism
- On the difference between permutation polynomials
- Generalized Latin matrix and construction of orthogonal arrays
- The number of different reduced complete sets of MOLS corresponding to \(\mathrm{PG} (2,q)\)
- Sets of mutually orthogonal Sudoku frequency squares
- On derivatives of planar mappings and their connections to complete mappings
- A projection pursuit method on the multidimensional squared contingency table
- On the dimension of the space of magic squares over a field
- The structure of reduced Sudoku grids and the Sudoku symmetry group
- Pseudo orthogonal Latin squares
- On distance in some finite planes and graphs arising from those planes
- On perfect and Reed-Muller codes over finite fields
- Enumerating partial Latin rectangles
- Gossip Latin square and the meet-all gossipers problem
- \(C_{4p}\)-frame of complete multipartite multigraphs
- Isomorphisms of hypergroups and of \(n\)-hypergroups with applications.
- Complete mappings and Carlitz rank
- Generalized Latin squares and their defining sets
- Generalizations of complete mappings of finite fields and some applications
- Construction of the mutually orthogonal extraordinary supersquares
- T-functions revisited: new criteria for bijectivity/transitivity
- The correspondence between mutually unbiased bases and mutually orthogonal extraordinary supersquares
- Gröbner bases and the number of Latin squares related to autotopisms of order \(\leq 7\)
- A review of uniform cross-over designs
- A new class of facets for the Latin square polytope
- On multi-index assignment polytopes
- Searching for mutually orthogonal Latin squares via integer and constraint programming
- The construction of nearly balanced and nearly strongly balanced uniform cross-over designs
- The construction of association schemes by parameter amendment
- Euler and combinatorial calculus
- Mutually orthogonal rectangular gerechte designs
- Constructions of (t,m,s)-nets and (t,s)-sequences
- The wheels of the orthogonal Latin squares polytope: classification and valid inequalities
- On the completability of incomplete orthogonal Latin rectangles
- Enumeration of MOLS of small order
- Different partners, different places: mathematics applied to the construction of four-couple folk dances
- On some classes of functions and hypercubes
- Mixed orthogonal arrays, \((u,m,\mathbf{e},s)\)-nets, and \((u,\mathbf{e},s)\)-sequences
- Ranks of permutative matrices
- Design of strong cryptographic schemes based on Latin squares
- Binary relations on ternary semihypergroups.
- scientific article; zbMATH DE number 7228877 (Why is no real title available?)
- Frequency permutation arrays
- Multidimensional Latin bitrades
- A Generalization ofn-Ary Algebraic Systems
- Upper bounds on sets of orthogonal colorings of graphs
- Strong forms of orthogonality for sets of hypercubes
- Some comments on Latin squares and on Graeco-Latin squares, illustrated with postage stamps and old playing cards
- On a method of construction of orthogonal quasigroup systems by means of groups
- Estimates of the neighborhood volumes of binary codes via their weight spectra
- The \(p\)-adic theory of automata functions
- Some structure spaces of generalized semirings
- scientific article; zbMATH DE number 7310171 (Why is no real title available?)
- Further results on Erdős-Faber-Lovász conjecture
- Transversals in generalized Latin squares
- A generalization of plexes of Latin squares
- Maximal partial transversals in a class of latin squares
- A graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6
- The geometry of sets of orthogonal frequency hypercubes
- Recent results on Choi's orthogonal Latin squares
- The geometry of frequency squares
- An enumeration of 1-perfect ternary codes
- Local permutation polynomials and the action of e-Klenian groups
- Row‐column factorial designs with multiple levels
- Half quasigroups and generalized quasigroup orthogonality.
- Some results on complete permutation polynomials and mutually orthogonal Latin squares
- Sets of orthogonal hypercubes of class \(r\)
- Associativity in multiary quasigroups: The way of biased expansions
- Terwilliger algebras constructed from Cayley tables of finite Bol loops
- Myrvold's results on orthogonal triples of 10 10 Latin squares: a SAT investigation
- Local permutation polynomials of maximum degree over prime finite fields
- An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
- Orthogonal Latin squares based on groups
- Latin squares of diamond dispersed pattern
- Construction of \(n\)-ary \(F\)-polygroups.
- A novel construction of quantum Latin square with maximum cardinality
- Polynomial completeness and strong non-affinity of almost all n-quasigroups
- The subconstituent algebra of strongly regular graphs associated with a Latin square
- On the orthogonal Latin squares polytope
- Bilateral matching with Latin squares
- Large-scale access scheduling in wireless mesh networks using social centrality
- Finite field constructions of combinatorial arrays
- Blocker sets, orthogonal arrays and their application to combination locks
- The wheels of the OLS polytope: Facets and separation
- Around the Hosszú-Gluskin theorem for n-ary groups.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4484908)
