Last edited May 12, 2003 by wtbaker@uiuc.edu
Find this document at http://www.ncsa.uiuc.edu/Classes/MATH198/wtbaker/opinstruct.html
Back Home
Back To Project Page

References:



Research References:

Baez, John. This Weeks Finds in Mathematical Physics (Week 144). INFOMAG Russian Ministry of Sciences. January 21, 2000.
     http://www.infomag.ru:8082/dbase/B003E/000126-082.txt
     Main Site: http://www.infomag.ru

Bogomolny, Alexander. Permutations Bogomolny is a former Associate Professor of Mathematics at the University of Iowa.
     http://www.cut-the-knot.com/do_you_know/permutation.shtml
     Main Site:www.cut-the-knot.com

Catalan Number MathWorld. Wolfram Research.
     http://mathworld.wolfram.com/CatalanNumber.html

Catalan numbers. University of Illinois Champaign-Urbana. CS273: Introduction to Theoretical Computer Science Spring 2003 Class Notes. Prepared by: Ari Trachtenberg, Ed Reingold, Tanya Berger-Wolf, David Bunde, Jeff Erikson, Mitch Harris, Cinda Heeren, and Shripad Thite.
     http://www-courses.cs.uiuc.edu/~cs273/notes/catalan.pdf

Counting Sets. University of Illinois Champaign-Urbana. CS273: Introduction to Theoretical Computer Science Spring 2003 Class Notes. Prepared by: Ari Trachtenberg, Ed Reingold, Tanya Berger-Wolf, David Bunde, Jeff Erikson, Mitch Harris, Cinda Heeren, and Shripad Thite.
     http://www-courses.cs.uiuc.edu/~cs273/notes/combos.pdf

Dickau, Robert M. Catalan numbers. Drexel University.
     http://mathforum.org/advanced/robertd/catalan.html

Fischer, Hanspeter. The 3-Dimensional Associahedron. Ball State University.
     http://www.cs.bsu.edu/~fischer/math215/associahedron.html

Hwa, Theodore. Counting Nodes in Planar Rooted Trees. Stanford University.
     http://www.stanford.edu/~hwatheod/prt.html

Information of Permutations. The (Combinatorial) Object Server. University of Victoria, British Columbia Canada.
     http://www.theory.csc.uvic.ca/~cos/inf/perm/PermInfo.html

Permutation MathWorld. Wolfram Research.
     http://mathworld.wolfram.com/Permutation.html

Rote, GŁnter. Binary trees having a given number of nodes with 0, 1, and 2 children. Graz University of Technology.
     http://www.mat.univie.ac.at/~slc/wpapers/s38pr_rote.pdf

Whitley, Darrel. C1.4 Permuatations. Handbook of Evolutionary Computation. IOP Publishing Ltd. And Oxford University Press. 1997.
     http://www.iop.org/Books/CIL/HEC/abs/ecc1_4.htm
     Main Site: http://www.iop.org/Books/CIL/HEC/index.htm

Zabrocki, Mike. The permutahedron for n=4. York University.
     http://garsia.math.yorku.ca/~zabrocki/posets/phedron4/


Code References:

illiSkel and CAVEskel acted as the framework for the associahedron and the permutahedron in this project. As part of illiSkel, the lighted vertex balls make use of the illiLight lighting model.

illiSkel:
   skel.c = OpenSkelGlut.c = Noosh97 with CAVE removed
   (C) 1994--2002 Board of Trustees University of Illinois
   A Model Real-Time Interactive C/OpenGL/GLUT Animator
   George Francis, Stuart Levy, Glenn Chappell, Chris Hartman
   e-mail gfrancis@math.uiuc.edu

CAVEskel:
   skel.c = OpenSkelGlut.c = Noosh97 with CAVE removed and put back
   (C) 1994 Board of Trustees University of Illinois
   A Model Real-Time Interactive OpenGL Application
   George Francis, Glenn Chappell, Chris Hartman
   e-mail gfrancis@math.uiuc.edu

illiLight:
   illiLight by Ray Idaszak 1989