Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-18T21:10:47.042Z Has data issue: false hasContentIssue false

The Asymptotic Behaviour of Equidistant Permutation Arrays

Published online by Cambridge University Press:  20 November 2018

S. A. Vanstone*
Affiliation:
St. Jerome's College, University of Waterloo, Waterloo, Ontario
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

An equidistant permutation array (EPA) A(r λ v) is a v × r array defined on a set V of r symbols such that every row is a permutation of V and any two distinct rows have precisely λ common column entries. Define R(r, λ) to be the largest value of v for which there exists an A (r, λ; v). Deza [2] has shown that

where n = r – λ. Bolton [1] has shown that

(*)

In this paper, we show that equality holds in (*) for λ > ┌n/3┐(n 2 + n). In order to do this we require several more definitions.

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 1979