27,484 research outputs found
How far can Nim in disguise be stretched?
A move in the game of nim consists of taking any positive number of tokens
from a single pile. Suppose we add the class of moves of taking a nonnegative
number of tokens jointly from all the piles. We give a complete answer to the
question which moves in the class can be adjoined without changing the winning
strategy of nim. The results apply to other combinatorial games with unbounded
Sprague-Grundy function values. We formulate two weakened conditions of the
notion of nim-sum 0 for proving the results.Comment: To appear in J. Combinatorial Theory (A
Parity of Sets of Mutually Orthogonal Latin Squares
Every Latin square has three attributes that can be even or odd, but any two
of these attributes determines the third. Hence the parity of a Latin square
has an information content of 2 bits. We extend the definition of parity from
Latin squares to sets of mutually orthogonal Latin squares (MOLS) and the
corresponding orthogonal arrays (OA). Suppose the parity of an
has an information content of bits. We show that
. For the case corresponding to projective
planes we prove a tighter bound, namely when
is odd and when is even. Using the
existence of MOLS with subMOLS, we prove that if
then for all sufficiently large .
Let the ensemble of an be the set of Latin squares derived by
interpreting any three columns of the OA as a Latin square. We demonstrate many
restrictions on the number of Latin squares of each parity that the ensemble of
an can contain. These restrictions depend on and
give some insight as to why it is harder to build projective planes of order than for . For example, we prove that when it is impossible to build an for which all
Latin squares in the ensemble are isotopic (equivalent to each other up to
permutation of the rows, columns and symbols)
Parity properties of Costas arrays defined via finite fields
A Costas array of order is an arrangement of dots and blanks into
rows and columns, with exactly one dot in each row and each column, the
arrangement satisfying certain specified conditions. A dot occurring in such an
array is even/even if it occurs in the -th row and -th column, where
and are both even integers, and there are similar definitions of odd/odd,
even/odd and odd/even dots. Two types of Costas arrays, known as Golomb-Costas
and Welch-Costas arrays, can be defined using finite fields. When is a
power of an odd prime, we enumerate the number of even/even odd/odd, even/odd
and odd/even dots in a Golomb-Costas array. We show that three of these numbers
are equal and they differ by from the fourth. For a Welch-Costas array
of order , where is an odd prime, the four numbers above are all equal
to when , but when , we show
that the four numbers are defined in terms of the class number of the imaginary
quadratic field , and thus behave in a much less
predictable manner.Comment: To appear in Advances in Mathematics of Communication
- …