Parity of transversals of Latin squares

From MaRDI portal
Publication:1985367

DOI10.5802/ALCO.103zbMATH Open1437.05033arXiv1912.11230OpenAlexW3099081656MaRDI QIDQ1985367FDOQ1985367

Ian M. Wanless, Darcy Best

Publication date: 7 April 2020

Published in: Algebraic Combinatorics (Search for Journal in Brave)

Abstract: We introduce a notion of parity for transversals, and use it to show that in Latin squares of order , the number of transversals is a multiple of 4. We also demonstrate a number of relationships (mostly congruences modulo 4) involving E1,dots,En, where Ei is the number of diagonals of a given Latin square that contain exactly i different symbols. Let A(imidj) denote the matrix obtained by deleting row i and column j from a parent matrix A. Define tij to be the number of transversals in L(imidj), for some fixed Latin square L. We show that for all a,b,c,d and L. Also, if L has odd order then the number of transversals of L equals tab mod 2. We conjecture that for all a,b,c,d. In the course of our investigations we prove several results that could be of interest in other contexts. For example, we show that the number of perfect matchings in a k-regular bipartite graph on 2n vertices is divisible by 4 when n is odd and . We also show that { m per}, A(a mid c)+{ m per}, A(b mid c)+{ m per}, A(a mid d)+{ m per}, A(b mid d) equiv 0 �mod 4 for all a,b,c,d, when A is an integer matrix of odd order with all row and columns sums equal to .


Full work available at URL: https://arxiv.org/abs/1912.11230




Recommendations




Cites Work


Cited In (4)





This page was built for publication: Parity of transversals of Latin squares

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985367)