Four isomorphisms linking architectural problems to combinatorial mathematics answer tour questions: How many ways can a given population be partitioned into a given schedule of groups? What is the most probable way that a given population will divide into a given number of groups? How many ways can a set of activities be allocated to a set of spaces? How many ways can subsets of a set of activities be allocated to a set of spaces? Further unsolved questions are also discussed.
Get full access to this article
View all access options for this article.
References
1.
FawcettW H, 1976a“Measuring adaptability”Transactions of the Martin Centre1 (Woodhead-Faulkner, Cambridge) pp 5–40.
2.
FawcettW H, 1976b“School management and school design”Journal of Architectural Research5 (3) 10–21.
3.
LiuC L, 1968Introduction to Combinatorial Mathematics (McGraw-Hill, New York).
4.
MarchL J, 1976Architecture of Form (Cambridge University Press, Cambridge).
5.
MirskyL, 1971Transversal Theory (Academic Press, London).
6.
NijenhuisAWilfH, 1975Combinatorial Algorithms (John Wiley, New York).
7.
RyserH J, 1963Combinatorial Mathematics (John Wiley, New York).
8.
TomescuI, 1975Introduction to Combinatorics (Collet's, Wellingborough).
