In this note complete systems of orthogonal F-squares are constructed in which the number of symbols is variable and the order n is a prime power. Further, we give an extension of the MacNeish theorem by constructing systems of orthogonal F-squares of composite order n = (p1^e1)•(p2^e2)•...•(pm^em) having a variable number of symbols: such construction improves the results that have been reached so far.
A construction of sets of pairwise orthogonal F-squares of composite order / P., Lancellotti; Pellegrino, Consolato. - STAMPA. - 123:(1986), pp. 285-289. ((Intervento presentato al convegno International Conference on Finite Geometries and Combinatorial Structures tenutosi a Bari, Italy nel 24-29 September 1984.
A construction of sets of pairwise orthogonal F-squares of composite order
PELLEGRINO, Consolato
1986-01-01
Abstract
In this note complete systems of orthogonal F-squares are constructed in which the number of symbols is variable and the order n is a prime power. Further, we give an extension of the MacNeish theorem by constructing systems of orthogonal F-squares of composite order n = (p1^e1)•(p2^e2)•...•(pm^em) having a variable number of symbols: such construction improves the results that have been reached so far.
Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris
