Mathematics Program at Bard College
Program Overview
Courses
Program Requirements
Faculty
Events
Student Research
Links
Division of Mathematics, Science, and Computing
Science Initiative
Contact Us
Home
Student Research
Mathematics Program Students with Senior Project Titles 1990 to Present


2006

  • Michael Knight: Primus: Patterns Primes Produce Plugged into the Expanding Product of a Particular Polynomial
  • Benjamin Rin: The Model Theory of Topoi
  • Kenneth Ober: Topological Logics

2005

  • David Eisenstadter: Perfect Coloring of Periodic Patterns with Translation Groups
  • Alina Marinova: Robots' Motion on a Graph: Configuration Spaces for a 2-Robot System
  • Janeta Marinova: Closure Operators on Lattices and Boolean Algebras
  • Mariana Raykova: Sequential Dynamical Systems

2004

  • Rubaba Ali: Application of Grobner Bases to the M-Color Problem for Graphs
  • Catherine Belin: Chip-Firing Games
  • Kerri-Ann Norton: The Game of Life on a Torus
  • Benjamin Rubenstein: Voronoi Tessellations
  • Kathryn Smith: Arrays, Rook Circuits, and Mininal Hamiltonian Graphs

2003

  • Monica Elkinton: Manipulating Voting Systems: Can We Get There from Hare?
  • Elena Grigorescu: Hilbert Series and Free Resolutions
  • Jill Patterson: Male of Female? The Application of Fuzzy Logic to Simulate a Bard Student's Decision-Making Process When Determining an Individual's Sex?

2002

2001

  • Luke Nickerson:

2000

  • Erin Boyer: Forbidden Subgraphs for Edge Domination
  • Shankar Gopalakrishnan: Cutting out the Junk: Breaking up Surfaces with Isolated Singularities
  • Maren Holmen: SET Theory

1999

  • Josh Foure: Speed III : Stop that Bus
  • Corina Tanasa: Geodesics Types of Singular Surfaces

1998

  • Nathan Ryan: Characterising low dimensional simplicial complexes or playing with kids' toys

1997

  • Brant Jones: Conducting a Tabu Search on the Graph Coloring Problem
  • Esteban Rubens: Partially ordered sets, generalized fences and dimension
  • Rodney Waldhoff: The matching model for routing permutations on graphs
  • Brandon Weber: Uniform approximation of continuous functions using artificial neural networks

1996

  • Marissa K. Bernstein: Traversability problems in graph theory
  • Dan C. Carroll: Smooth surfaces for computer aided geometric design
  • He Jiang: Transformations of regular polygons
  • Van Anh Nguyen: A binomial model for option pricing
  • Joshua Richman: Three is the loneliest number
  • Kathryn Ryan: Error-detecting codes via group theory

1995

  • Jason Foulkes: Set Product vs. Coset Product
  • Nil Ozel: List, and list T-Coloring results for 2-chromatic graphs
  • Diego Socolinsky: On the curvature of polyhedra

1994

  • Robert Cutler: Edge Domination of G x Qn
  • Weili Wu: The classification of discrete patterns, monohedral tilings and some thoughts about k-anisohedral tiles

1993

  • Matthew Lee: Counting the subgroups of the dihedral groups : a numerical theoretic approach to abstract algebra
  • Thomas Regner: The significance of neural networks for artificial intelligence

1992

  • Jeffrey Bolden: Dimension and planarity in partial ordered sets
  • Melissa Cahoon: A Graphic analysis of the hare voting system
  • David Steinberg: Real and complex etheral calculus : or, playing around with these numbers and seeing what works
  • Anne Willig: Three-colorings of cyclic groups

1990

  • Jade Bingham: Efficient orientations of city street graphs
  • Linda Burgess: Stress Analysis of Axisymmetric Shells
  • Laura Muller: Symmetry groups, perfect colorings, and compound designs : staying within the (guide) lines