Geodesic
SOME n−2 TERRACES FROM n POWER-SEQUENCES, n BEING AN ODD PRIME POWER
Glasgow mathematical journal, Tome 52 (2010) no. 1, pp. 65-85

Voir la notice de l'article provenant de la source Cambridge University Press

A terrace for m is an arrangement (a1, a2, . . . , am) of the m elements of m such that the sets of differences ai+1 − ai and ai − ai+1 (i = 1, 2, . . . , m − 1) between them contain each element of m \ {0} exactly twice. For m odd, many procedures are available for constructing power-sequence terraces for m; each such terrace may be partitioned into segments, one of which contains merely the zero element of m, whereas each other segment is either (a) a sequence of successive powers of an element of m or (b) such a sequence multiplied throughout by a constant. We now adapt this idea by using power-sequences in n, where n is an odd prime power, to obtain terraces for m, where m = n − 2. We write each element from n so that they lie in the interval [0, n − 1] and then delete 0 and n − 1 so that they leave n − 2 elements that may be interpreted as the elements of n−2. A segment of one of the new terraces may be of type (a) or (b), incorporating successive powers of 2, with each entry evaluated modulo n. Our constructions provide n−2 terraces for all odd primes n satisfying 0 < n < 1,000 except for n = 127, 241, 257, 337, 431, 601, 631, 673, 683, 911, 937 and 953. We also provide n−2 terraces for n = 3r (r > 1) and for some values n = p2, where p is prime.
DOI : 10.1017/S0017089509990164
Mots-clés : Primary 11A07, secondary 05B30 
ANDERSON, IAN; PREECE, D. A. SOME n−2 TERRACES FROM n POWER-SEQUENCES, n BEING AN ODD PRIME POWER. Glasgow mathematical journal, Tome 52 (2010) no. 1, pp. 65-85. doi: 10.1017/S0017089509990164
@article{10_1017_S0017089509990164,
     author = {ANDERSON, IAN and PREECE, D. A.},
     title = {SOME n\ensuremath{-}2 {TERRACES} {FROM} n {POWER-SEQUENCES,} n {BEING} {AN} {ODD} {PRIME} {POWER}},
     journal = {Glasgow mathematical journal},
     pages = {65--85},
     year = {2010},
     volume = {52},
     number = {1},
     doi = {10.1017/S0017089509990164},
     url = {http://geodesic.mathdoc.fr/articles/10.1017/S0017089509990164/}
}
TY  - JOUR
AU  - ANDERSON, IAN
AU  - PREECE, D. A.
TI  - SOME n−2 TERRACES FROM n POWER-SEQUENCES, n BEING AN ODD PRIME POWER
JO  - Glasgow mathematical journal
PY  - 2010
SP  - 65
EP  - 85
VL  - 52
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.1017/S0017089509990164/
DO  - 10.1017/S0017089509990164
ID  - 10_1017_S0017089509990164
ER  - 
%0 Journal Article
%A ANDERSON, IAN
%A PREECE, D. A.
%T SOME n−2 TERRACES FROM n POWER-SEQUENCES, n BEING AN ODD PRIME POWER
%J Glasgow mathematical journal
%D 2010
%P 65-85
%V 52
%N 1
%U http://geodesic.mathdoc.fr/articles/10.1017/S0017089509990164/
%R 10.1017/S0017089509990164
%F 10_1017_S0017089509990164

[1] 1.Anderson, I. and Preece, D. A., Locally balanced change-over designs, Utilitas Math. 62 (2002), 33–59. Google Scholar

[2] 2.Anderson, I. and Preece, D. A., Power-sequence terraces for where n is an odd prime power, Discrete Math. 261 (2003), 31–58. Google Scholar | DOI

[3] 3.Anderson, I. and Preece, D. A., Some narcissistic half-and-half power-sequence terraces with segments of different lengths, Cong. Numer. 163 (2003), 5–26. Google Scholar

[4] 4.Anderson, I. and Preece, D. A., Narcissistic half-and-half power-sequence terraces for with n = pqt, Discrete Math. 279 (2004), 33–60. Google Scholar | DOI

[5] 5.Anderson, I. and Preece, D. A., Some power-sequence terraces for with as few segments as possible, Discrete Math. 293 (2005), 29–59. Google Scholar | DOI

[6] 6.Anderson, I. and Preece, D. A., Some terraces from power-sequences, n being an odd prime power, Proc. Edinbr. Math. Soc. 50 (2007), 527–549. Google Scholar | DOI

[7] 7.Anderson, I. and Preece, D. A., Some terraces from power-sequences, n being an odd prime, Discrete Math. 308 (2008), 4086–4107. Google Scholar | DOI

[8] 8.Bailey, R. A., Quasi-complete Latin squares: Construction and randomisation, J. R. Statist. Soc. B 46 (1984), 323–334. Google Scholar

[9] 9.Hilton, A. J. W., Mays, M., Rodger, C. A. and Nash-Williams, C. StJ. A., Hamiltonian double Latin squares, J. Combin. Theory B 87 (2003), 81–129. Google Scholar

[10] 10.Ringel, G., Map color theorem (Springer, Berlin, 1974). Google Scholar | DOI

Cité par Sources :