Hostname: page-component-848d4c4894-pftt2 Total loading time: 0 Render date: 2024-06-09T07:15:32.521Z Has data issue: false hasContentIssue false

Twills with bounded float length

Published online by Cambridge University Press:  17 April 2009

Janet A. Hoskins
Affiliation:
Departments of Clothing and Textiles, Computer Science, University of Manitoba, Winnipeg, Manitoba, Canada R3T 2N2;
Cheryl E. Praeger
Affiliation:
Department of Mathematics, University of Western Australia, Nedlands, Western Australia 6009, Australia;
Anne Penfold Street
Affiliation:
Department of Mathematics, University of Queensland, St Lucia, Queensland 4067, Australia.
Rights & Permissions [Opens in a new window]

Abstract

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.

The simple twills on n harnesses can be classified according to their maximum float length. The number of n-harness twills with specified maximum float length is determined both by Burnside enumeration and, for n ≤ 20 , by an adaptation of a sieve algorithm for twills.

Type
Research Article
Copyright
Copyright © Australian Mathematical Society 1983

References

[1] Burnside, W., Theory of groups of finite order (Cambridge University Press, second edition, 1911; reprinted Dover, London, 1955).Google Scholar
[2] Grünbaum, Branko and Shephard, G.C., “Satins and twills; an introduction to the geometry of fabrics”, Math. Mag. 53 (1980), 139161.CrossRefGoogle Scholar
[3] Hoskins, Janet A., “Factoring binary matrices: a weaver's approach”, Combinatorial Mathematics IX, 300326 (Lecture Notes in Mathematics, 952. Springer-Verlag, Berlin, Heidelberg, New York, 1982).Google Scholar
[4] Hoskins, W.D. and Street, Anne Penfold, “Twills on a given number of harnesses”, J. Austral. Math. Soc. Ser. A 33 (1982), 115.CrossRefGoogle Scholar