Counting Colored Coprime Compositions

Combinatorics/Partitions Seminar

Meeting Details

For more information about this meeting, contact Calendar Administrator

Speaker: Matthew Katz, Penn State

Abstract: We will look at compositions which are colored and whose parts have a greatest common divisor of 1. In 2007, it was proven that the number of such compositions is highly divisible. Here, we prove more divisibility properties for a related family of polynomials and specifically focus on when factors are cyclotomic.

Room Reservation Information

Room Number: 106 McAllister

Date: 11/10/2009

Time: 11:15am - 12:05pm