The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
We derive necessary and sufficient conditions for there to exist a latin square of order containing two subsquares of order and that intersect in a subsquare of order . We also solve the case of two disjoint subsquares. We use these results to show that:
(a) A latin square of order cannot have more than subsquares of order , where . Indeed, the number of subsquares of order is bounded by a polynomial of degree at most in .
(b) For all there exists a loop of order in which every...
Download Results (CSV)