๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A product theorem for row-complete Latin squares

โœ Scribed by Jeff Higham

Publisher
John Wiley and Sons
Year
1997
Tongue
English
Weight
136 KB
Volume
5
Category
Article
ISSN
1063-8539

No coin nor oath required. For personal study only.

โœฆ Synopsis

In this article it is shown how to construct a row-complete latin square of order mn, given one of order m and given a sequencing of a group of order n. This yields infinitely many new orders for which row-complete latin squares can be constructed.

๐Ÿ“œ SIMILAR VOLUMES

Row-complete latin squares of every comp
Row-complete latin squares of every composite order exist
โœ Jeff Higham ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 247 KB ๐Ÿ‘ 1 views

A construction for a row-complete latin square of order n, where n is any odd composite number other than 9, is given in this article. Since row-complete latin squares of order 9 and of even order have previously been constructed, this proves that row-complete latin squares of every composite order

Cropper's question and Cruse's theorem a
Cropper's question and Cruse's theorem about partial Latin squares
โœ J. Goldwasser; A. J. W. Hilton; D. Patterson ๐Ÿ“‚ Article ๐Ÿ“… 2011 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 151 KB

In 1974 Cruse gave necessary and suf cient conditions for an rร—s partial latin square P on symbols r 1 , r 2 ,...,r t , which may have some unfilled cells, to be completable to an nร—n latin square on symbols r 1 , r 2 ,...,r n , subject to the condition that the unfilled cells of P must be lled with

An Asymptotic Complete Intersection Theo
An Asymptotic Complete Intersection Theorem for Chain Products
โœ Christian Bey; Konrad Engel ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 145 KB

Let N (n, k) be the set of all n-tuples over the alphabet {0, 1, . . . , k} whose component sum equals . A subset F โŠ† N (n, k) is called a t-intersecting family if every two tuples in F have nonzero entries in at least t common coordinates. We determine the maximum size of a t-intersecting family in

A dirac-type theorem for squares of grap
A dirac-type theorem for squares of graphs
โœ Tomasz Traczyk Jr. ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 221 KB

We prove that if G is a connected graph with p vertices and minimum degree greater than max( p/4 -1,3) then G2 is pancyclic. The result is best possible of its kind.