Shape Computation Lab

Counting, Coloring and Computing

 


Title:

Counting, Coloring and Computing: Lessons from the Kindergarten

Authors:

Athanassios Economou

Editor:

Javier Barrallo

Conference:

International Society of Arts, Mathematics and Architecture: Proceedings of the First International Conference (ISAMA)

Series:

ISAMA 1999

Pages:

147-155

Publisher:

The University of the Basque Country, San Sebastian, Spain

Publication date:

June 1999

Keywords:

Symmetry, Permutations, Kindergarten method, Frederic Froebel, Polya’s Theorem of Counting, Shape studies

Abstract:

A systematic inquiry into some of the geometric possibilities inherent in Frederick Froebel's kindergarten method. A series of studies pertaining to counting, coloring and computing issues is proposed. The Froebel building gifts are used as samples for this approach. The symmetry groups and subgroups of these building blocks are identified and their conjugacy classes are established. The cycle indices of the permutation groups of the blocks are used within Polya's theorem of counting to provide all non-equivalent perfect coloring schemes for the blocks. A catalogue of all n-colorings of the blocks for n≤3 is provided as well and its application within a specific computational framework is suggested in the end.

links