18 search results - page 3 / 4 » arscom 2008 |
ARSCOM
2008
13 years 6 months ago
2008
A Greedy Defining Set is a set of entries in a Latin square with the property that when the square is systematically filled in with a greedy algorithm, the greedy algorithm succee...
ARSCOM
2008
13 years 6 months ago
2008
Let P be a polygon whose vertices have been colored (labeled) cyclically with the numbers 1, 2, . . . , c. Motivated by conjectures of Propp, we are led to consider partitions of ...
ARSCOM
2008
13 years 6 months ago
2008
We present 3 open challenges in the field of Costas arrays. They are: a) the determination of the number of dots on the main diagonal of a Welch array, and especially the maximal ...
ARSCOM
2008
13 years 6 months ago
2008
Various enumeration problems for classes of simply generated families of trees have been the object of investigation in the past. We mention the enumeration of independent subsets,...
ARSCOM
2008
13 years 6 months ago
2008
We classify the minimal blocking sets of size 15 in PG(2, 9). We show that the only examples are the projective triangle and the sporadic example arising from the secants to the u...