On the number of transversals in Cayley tables of cyclic groups
From MaRDI portal
(Redirected from Publication:968119)
Recommendations
- Completing partial transversals of Cayley tables of Abelian groups
- Enumeration of transversals in the Cayley tables of the non-cyclic groups of order 8
- On Cayley graphs on the symmetric group generated by transpositions
- Transversals in the Cayley tables of the non-cyclic groups of order 8
- scientific article; zbMATH DE number 7093055
- On transitive Cayley graphs of groups and semigroups
- On the number of cyclic subgroups of a group
- On the number of cyclic subgroups of a finite group
- On the number of cyclic subgroups of a finite group
- On the number of cyclic subgroups in a finite group
Cites work
- scientific article; zbMATH DE number 2186994 (Why is no real title available?)
- scientific article; zbMATH DE number 50662 (Why is no real title available?)
- scientific article; zbMATH DE number 469325 (Why is no real title available?)
- scientific article; zbMATH DE number 1873117 (Why is no real title available?)
- scientific article; zbMATH DE number 863491 (Why is no real title available?)
- scientific article; zbMATH DE number 1409947 (Why is no real title available?)
- 3-homogeneous Latin trades
- A congruence connecting Latin rectangles and partial orthomorphisms
- All-even Latin squares
- Applying fast simulation to find the number of good permutations
- Asymptotic Methods in Enumeration
- Atomic Latin squares of order eleven
- Completing partial Latin squares with two cyclically generated prescribed diagonals
- Compound orthomorphisms of the cyclic group
- Diagonally cyclic Latin squares.
- Estimating the number of Latin rectangles by the fast simulation method
- Estimating the number of good permutations by a modified fast simulation method
- Estimation of the number of ``good permutations with applications to cryptography
- Generating uniformly distributed random latin squares
- Irregular arrays and randomization
- Latin bitrades derived from groups
- Most Latin squares have many subsquares
- On completing three cyclically generated transversals to a Latin square
- On the X-rays of permutations
- On the existence of \(k\)-homogeneous Latin bitrades
- On the number of Latin squares
- The On-Line Encyclopedia of Integer Sequences
- The cycle structure of two rows in a random Latin square
- The n-Queens Problem
- The number of transversals in a Latin square
- The theory and application of latin bitrades: A survey
- Transversals in Latin Squares
- Upper bound on the number of complete maps
- \(k\)-homogeneous Latin trades
Cited in
(21)- Differences of bijections
- Graceful labelling: state of the art, applications and future directions
- Indivisible partitions of Latin squares
- Additive triples of bijections, or the toroidal semiqueens problem
- Transversals of additive Latin squares
- The number of transversals in a Latin square
- On the number of transversals in Latin squares
- On the number of transversals in a class of Latin squares
- On the number of additive permutations and Skolem-type sequences
- Compound orthomorphisms of the cyclic group
- Maximal partial transversals in a class of latin squares
- On completing three cyclically generated transversals to a Latin square
- On the existence of \(3\)-way \(k\)-homogeneous Latin trades
- A congruence connecting Latin rectangles and partial orthomorphisms
- Circulant matrices and mathematical juggling
- The spectrum for 3-way \(k\)-homogeneous Latin trades
- Orthogonal trades in complete sets of MOLS
- On the intersection of three or four transversals of the back circulant Latin squares
- Degree of orthomorphism polynomials over finite fields
- Existence results for cyclotomic orthomorphisms
- Computer search for graceful labeling: a survey
This page was built for publication: On the number of transversals in Cayley tables of cyclic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968119)
