Proof of the Alon-Tarsi conjecture for \(n=2^rp\) (Q1386553)

From MaRDI portal
Revision as of 10:58, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Proof of the Alon-Tarsi conjecture for \(n=2^rp\)
scientific article

    Statements

    Proof of the Alon-Tarsi conjecture for \(n=2^rp\) (English)
    0 references
    0 references
    25 May 1998
    0 references
    A Latin square \(L\) of order \(n\) is an \(n\times n\) matrix whose rows and columns are permutations of \(\{0,1,\dots,n-1\}\). Denote by \(\text{els}(n)\) and \(\text{ols}(n)\) respectively the number of even and odd Latin squares of order \(n\). The Alon-Tarsi conjecture states that \(\text{els}(n)= \text{ols}(n)\) for even \(n\). In this paper, the author shows that the conjecture is true for \(n= 2^r(p+ 1)\) where \(p\) is an odd prime.
    0 references
    0 references
    Latin square
    0 references
    Alon-Tarsi conjecture
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references