On the number of transversals in Cayley tables of cyclic groups

DOI10.1016/J.DAM.2009.09.006zbMath1225.05047OpenAlexW2024897051MaRDI QIDQ968119

Ian M. Wanless, Nicholas J. Cavenagh

Publication date: 5 May 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.09.006

zbMATH Keywords

complete mappingLatin squaretransversalorthomorphismdiagonally cyclichomogeneous Latin bitrademagic juggling sequencerandom MOLSrandom mutually orthogonal Latin squaressemi-queen

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15)

Related Items (16)

Orthogonal trades in complete sets of MOLS ⋮ Computer search for graceful labeling: a survey ⋮ On the number of additive permutations and Skolem-type sequences ⋮ A congruence connecting Latin rectangles and partial orthomorphisms ⋮ On the number of transversals in a class of Latin squares ⋮ The spectrum for 3-way \(k\)-homogeneous Latin trades ⋮ Additive triples of bijections, or the toroidal semiqueens problem ⋮ Differences of Bijections ⋮ Degree of orthomorphism polynomials over finite fields ⋮ Graceful labelling: state of the art, applications and future directions ⋮ On the existence of \(3\)-way \(k\)-homogeneous Latin trades ⋮ Existence results for cyclotomic orthomorphisms ⋮ Indivisible partitions of Latin squares ⋮ Compound orthomorphisms of the cyclic group ⋮ Circulant matrices and mathematical juggling ⋮ On the number of transversals in Latin squares

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of transversals in a Latin square
• Applying fast simulation to find the number of good permutations
• Compound orthomorphisms of the cyclic group
• Latin bitrades derived from groups
• Estimating the number of good permutations by a modified fast simulation method
• On completing three cyclically generated transversals to a Latin square
• Estimating the number of Latin rectangles by the fast simulation method
• Most Latin squares have many subsquares
• Upper bound on the number of complete maps
• Completing partial Latin squares with two cyclically generated prescribed diagonals
• Diagonally cyclic Latin squares.
• Estimation of the number of ``good permutations with applications to cryptography
• All-even Latin squares
• A congruence connecting Latin rectangles and partial orthomorphisms
• 3-homogeneous Latin trades
• On the number of Latin squares
• On the existence of k-homogeneous Latin bitrades
• On the X-rays of permutations
• The theory and application of latin bitrades: A survey
• The cycle structure of two rows in a random Latin square
• Irregular arrays and randomization
• Asymptotic Methods in Enumeration
• Generating uniformly distributed random latin squares
• The n-Queens Problem
• Atomic Latin squares of order eleven
• Transversals in Latin Squares

This page was built for publication: On the number of transversals in Cayley tables of cyclic groups