Name
Abstract | ||
|---|---|---|
Bounds are obtained on the number of distinct transversal designs TD(g,n) (having g groups with n points in each group) for certain values of g and n. Amongst other results it is proved that, if 2<g⩽q+1 where q is a prime power, then the number of nonisomorphic TD(g,qr) designs is at least qαrq2r(1−o(1)) as r→∞, where α=1/q4. The bounds obtained give equivalent bounds for the numbers of distinct and nonisomorphic sets of g−2 mutually orthogonal Latin squares of order n in the corresponding cases. Applications to other combinatorial designs are also described. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.jcta.2013.05.004 | Journal of Combinatorial Theory, Series A |
Keywords | Field | DocType |
Transversal designs,Mutually orthogonal Latin squares,Enumeration | Discrete mathematics,Orthogonal array,Combinatorics,Enumeration,Transversal (geometry),Combinatorial design,Graeco-Latin square,Prime power,Mathematics | Journal |
Volume | Issue | ISSN |
120 | 7 | 0097-3165 |
Citations | PageRank | References |
2 | 0.41 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Diane M. Donovan | 1 | 6 | 2.93 |
| Mike J. Grannell | 2 | 40 | 11.20 |