scientific article; zbMATH DE number 3443668
From MaRDI portal
Publication:4769064
zbMATH Open0283.05014MaRDI QIDQ4769064FDOQ4769064
Authors: József Dénes, Anthony Donald Keedwell
Publication date: 1974
Title of this publication is not available (Why is that?)
Combinatorial aspects of block designs (05B05) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Orthogonal arrays, Latin squares, Room squares (05B15) Loops, quasigroups (20N05)
Cited In (only showing first 100 items - show all)
- Complete mappings in some linear and projective groups
- Computing the autotopy group of a Latin square by cycle structure
- Multimagic rectangles based on large sets of orthogonal arrays
- The spectrum for quasigroups with cyclic automorphisms and additional symmetries.
- Reconstruction of group multiplication tables by quadrangle criterion
- Positive margins and primary decomposition
- Lopsided Lovász Local lemma and Latin transversals
- Completely inverse \(AG^{**}\)-groupoids.
- Further results on mutually nearly orthogonal Latin squares
- The smallest graph of girth 6 and valency 7
- Left loops, bipartite graphs with parallelism and bipartite involution sets.
- Indivisible partitions of Latin squares
- A natural generalization of orthogonality of Latin squares
- A remark on doubly diagonalized orthogonal latin squares
- Completing partial Latin squares with prescribed diagonals.
- Diagonally cyclic Latin squares.
- Groupoids with quasigroup and Latin square properties.
- An improved bound on the sizes of matchings guaranteeing a rainbow matching
- Relatively inherently nonfinitely q-based semigroups
- Strong forms of orthogonality for sets of hypercubes
- Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems
- Algorithm portfolios
- On the combinatorial problems which I would most like to see solved
- Maximum transversal in partial Latin squares and rainbow matchings
- How far apart can the group multiplication tables be?
- On the number of 1-factorizations of the complete graph
- Hyperovals in nets of small degree
- Some new conjugate orthogonal Latin squares
- Mappings of Latin squares
- Avoiding partial Latin squares and intricacy
- Ranks of permutative matrices
- A General Product Construction for Error Correcting Codes
- Title not available (Why is that?)
- Latin trades in groups defined on planar triangulations
- Characterization of extreme points of multi-stochastic tensors
- A candidate for the ``Next Fermat Problem
- Additive and multiplicative relations connecting conjugate algebraic numbers
- Point sets and sequences with small discrepancy
- On hamiltonian circuits in Cayley diagrams
- Estimation of the number of ``good permutations with applications to cryptography
- Associativity in multiary quasigroups: The way of biased expansions
- Some comments on Latin squares and on Graeco-Latin squares, illustrated with postage stamps and old playing cards
- Transversals in row-latin rectangles
- Matroid representations by partitions
- Parallel concepts in graph theory
- Non-isomorphic \(2\)-groups coincide at most in three quarters of their multiplication tables
- Covering radius for sets of permutations
- On orthogonal Latin squares
- On quasigroups rich in associative triples
- Frame self-orthogonal Mendelsohn triple systems of type \(h^n\)
- Existence of orthogonal Latin squares with aligned subsquares
- On the existence of unparalleled even cycle systems
- Groups with anti-symmetric mappings
- \(d\)-dimensional hypercubes and the Euler and MacNeish conjectures
- Check character systems over groups and orthogonal Latin squares
- On the number of even and odd Latin squares of order \(p+1\)
- On the existence of nested orthogonal arrays
- Perfect matchings in \(r\)-partite \(r\)-graphs
- Holey Steiner pentagon systems
- Latin squares without orthogonal mates
- Circular neighbor-balanced designs universally optimal for total effects
- Bruck nets, codes, and characters of loops
- Classification of \(k\)-nets
- Completing partial Latin squares with two cyclically generated prescribed diagonals
- Dihedral biembeddings and triangulations by complete and complete tripartite graphs
- Cages—a survey
- Incidence matrices and inequalities for combinatorial designs
- Knight's move squares
- Covering with Latin transversals
- Large matchings in bipartite graphs have a rainbow matching
- Turán and Ramsey properties of subcube intersection graphs
- Transversals and multicolored matchings
- Generalized Latin squares. II
- Further Results on the Construction of Mutually Orthogonal Latin Squares and the Falsity of Euler's Conjecture
- Orthomorphisms of dihedral groups
- On multiplication groups of loops
- Check character systems using quasigroups. II
- Check character systems using quasigroups. I.
- The geometry of binary systems
- The specification of rank reducing observation sets in experimental design
- Enumeration of MOLS of small order
- Generalized Latin squares and their defining sets
- Monogamous latin squares
- Upper bounds on sets of orthogonal colorings of graphs
- Small latin squares, quasigroups, and loops
- On the orthogonal Latin squares polytope
- Gruppenuniversalität und Homogenisierbarkeit
- Point sets with uniformity properties and orthogonal hypercubes
- An improved approximation algorithm for the partial Latin square extension problem.
- Enumeration formulas for latin and frequency squares
- A generalization of plexes of Latin squares
- Maximal sets of Latin squares and partial transversals
- A computational algebraic geometry approach to analyze pseudo-random sequences based on Latin squares
- A new conjecture concerning admissibility of groups
- A historical perspective of the theory of isotopisms
- Eine Bemerkung zur Abschätzung der Anzahl orthogonaler lateinischer Quadrate mittels Siebverfahren
- Application of the special Latin square to a parallel routing algorithm on a recursive circulant network.
- Sets of mutually orthogonal Sudoku frequency squares
- Polynomial representation of complete sets of mutually orthogonal frequency squares of prime power order
- An LP-based proof for the non-existence of a pair of orthogonal Latin squares of order 6.
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 Q4769064)