Even latin squares of order 10

12/30/2020
by   Carolin Hannusch, et al.
0

The Alon-Tarsi Conjecture says that the number of even latin squares of even order is not equal to the number of odd latin squares of the same order. The conjecture is known to be true for n≤ 8 and for all n=2^r· p, where p is prime. In the current paper we show that the number of even latin squares is greater than the number of odd latin squares for n=10.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2018

On the number of semi-magic squares of order 6

We present an exact method for counting semi-magic squares of order 6. S...
research
01/29/2019

An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture

Vizing's conjecture (open since 1968) relates the sizes of dominating se...
research
04/10/2019

Least Squares Auto-Tuning

Least squares is by far the simplest and most commonly applied computati...
research
07/08/2023

The Value of Chess Squares

Valuing chess squares and determining the placement of pieces on the boa...
research
09/08/2017

Fast Algorithm for Enumerating Diagonal Latin Squares of Small Order

In this paper we propose an algorithm for enumerating diagonal Latin squ...
research
11/16/2021

Solving sums of squares in global fields

The problem of writing a totally positive element as a sum of squares ha...
research
03/16/2020

Complexity of Shapes Embedded in ℤ^n with a Bias Towards Squares

Shape complexity is a hard-to-quantify quality, mainly due to its relati...

Please sign up or login with your details

Forgot password? Click here to reset