Tuesday, June 13

Enumerative Combinatorics and Algorithms

3:30 pm - 5:30 pm
Room: Section B
Chair: Arthur T. Benjamin Harvey Mudd College, USA

3:30-3:45 New Computer-Assisted Results on Kaprekar's Constants
Byron L. Walden, Santa Clara University, USA
3:50 - 4:05 Enumeration Via Functionals
Heinrich Niederhausen, Florida Atlantic University, USA
4:10 - 4:25 The Number of Irreducible Polynomials over Finite Fields with Given Trace and Subtrace
F. Ruskey, J. Sawada, M. Serra, University of Victoria, Canada; K. Cattell, Hewlett-Packard Labs, USA; and C.R. Miers, University of Victoria, Canada
4:30-4:45 Recounting Fibonacci Numbers and Continued Fractions
Arthur T. Benjamin, Harvey Mudd College, USA; and Jennifer J. Quinn, Occidental College, USA
4:50 - 5:05 Simple Constant Amortized Time Generation of Fixed Length Numeric Partitions
John Boyer, University of Victoria and PureEdge Solutions, Inc., Canada
5:10 - 5:25 The Periodic Property of Binomial Coefficients Modulo m and Applications
Shi-Chun Tsai, National Chi-Nan University, Taiwan

©2000 Society for Industrial and Applied Mathematics
Designed by Donaghy's Web Consulting
Created 3/16/00; Updated 3/29/00