OFFSET
1,1
COMMENTS
A diagonal Latin square A has a generalized symmetry (automorphism) if for all cells A[x][y] = v and A[x'][y'] = v' the relation is satisfied: x' = Px[x], y' = Py[y], v' = Pv[v], where Px, Py and Pv are some permutations that describe generalized symmetry (automorphism). In view of the possibility of an equivalent permutation of the rows and columns of the square and the corresponding transformations in permutations Px, Py and Pv, it is not the types of permutations that are important, but the structure of the multisets L(P) of cycle lengths in them (number of different multisets of order n is A000041). In view of this, codes of various generalized symmetries can be described by the types like (1,1,1) (trivial), (1,16,16) and so on (see example). A diagonal Latin square A has a generalized symmetry in parastrophic slices if for all cells A[x][y] = v and A[a'][b'] = c' the relation is satisfied: (a',b',c') = R(Px[x],Py[y],Pv[v]), where R is one of 6 possible parastrophic transformations:
1. (x,y,v) -> (a,b,c) (trivial).
2. (x,v,y) -> (a,b,c).
3. (y,x,v) -> (a,b,c) (transpose).
4. (y,v,x) -> (a,b,c).
5. (v,x,y) -> (a,b,c).
6. (v,y,x) -> (a,b,c).
A set of squares with selected parastrophic transformation R forms one of 6 parastrophic slices. Diagonal Latin squares with a generalized symmetry are a special case of generalized symmetries in parastrophic slice # 1. Diagonal Latin squares with generalized symmetries in parastrophic slices are rare; usually they have a large number of transversals, orthogonal mates, etc.
For all orders in which diagonal Latin squares exist a(n) >= 1 due to the existence of the trivial generalized symmetry with code (1,1,1) in first parastrophic slice and Px=Py=Pv=e. - Eduard I. Vatutin, Jan 24 2023, updated Mar 25 2023
The set of generalized symmetries is a subset of the generalized symmetries in parastrophic slices, so A357473(n) <= a(n). - Eduard I. Vatutin, Jan 25 2023
Orthogonal diagonal Latin squares are a subset of diagonal Latin squares, so A358891(n) <= a(n). - Eduard I. Vatutin, Jan 28 2023
LINKS
FORMULA
a(n) <= 6*A000041(n)^3. - Eduard I. Vatutin, Dec 29 2022
EXAMPLE
For order n=4 there are 5 different multisets L(P) with codes listed below in format "code - multiset":
1 - {1,1,1,1},
2 - {1,1,2},
3 - {1,3},
4 - {2,2},
5 - {4}.
Diagonal Latin squares of order n=4 have a(4)=76 different types of generalized symmetries in parastrophic slices.
Slice 1 (10 generalized symmetries), R=(x,y,v):
1. A=0123321010322301 (string representation of the square), Px=[0,1,2,3], Py=[0,1,2,3], Pv=[0,1,2,3] (trivial generalized symmetry), L(Px)={1,1,1,1,1}, L(Py)={1,1,1,1,1}, L(Pv)={1,1,1,1,1}, generalized symmetry type 1-(1,1,1).
2. A=0123321010322301, Px=[0,1,2,3], Py=[1,0,3,2], Pv=[1,0,3,2], L(Px)={1,1,1,1}, L(Py)={2,2}, L(Pv)={2,2}, generalized symmetry type 1-(1,4,4).
...
10. A=0123321010322301, Px=[1,2,3,0], Py=[2,3,1,0], Pv=[1,0,2,3], L(Px)={4}, L(Py)={4}, L(Pv)={1,1,2}, generalized symmetry type 1-(5,5,2).
Slice 2 (10 generalized symmetries), R=(x,v,y):
11. A=0123321010322301, Px=[0,1,2,3], Py=[0,1,2,3], Pv=[0,1,2,3], L(Px)={1,1,1,1,1}, L(Py)={1,1,1,1,1}, L(Pv)={1,1,1,1,1}, generalized symmetry type 2-(1,1,1).
12. A=0123321010322301, Px=[0,1,2,3], Py=[1,0,3,2], Pv=[1,0,3,2], L(Px)={1,1,1,1}, L(Py)={2,2}, L(Pv)={2,2}, generalized symmetry type 2-(1,4,4).
...
20. A=0123321010322301, Px=[1,2,3,0], Py=[2,3,1,0], Pv=[1,0,2,3], L(Px)={4}, L(Py)={4}, L(Pv)={1,1,2}, generalized symmetry type 2-(5,5,2).
Slice 3 (14 generalized symmetries).
Slice 4 (14 generalized symmetries).
Slice 5 (14 generalized symmetries).
Slice 6 (14 generalized symmetries).
Total 10+10+14+14+14+14=76 generalized symmetries in parastrophic slices.
CROSSREFS
KEYWORD
nonn,more,hard
AUTHOR
Eduard I. Vatutin, Nov 20 2022
STATUS
approved