Graduate Algebra Seminar: Three problems in enumerative combinatorics with algebraic solutions

Wednesday, October 16 at 1:00pm to 2:00pm

This is a past event.

Kaprielian Hall (KAP), 427
3620 South Vermont Avenue, Los Angeles, CA 90089

Peter Kagey, USC

Abstract: This talk will use techniques from linear algebra and elementary group theory to count several different combinatorial structures that have come up in recreational mathematics.

For example, the number of certain subgraphs of a family of grid graphs can be shown to satisfy a linear recurrence using the Cayley–Hamilton theorem, and the number of subsets of $\{n, n+1, n+2, \hdots, n+m\}$ such that the product is a perfect square can be shown to be of the form $2^N$ by using properties of matrices over the field of two elements.

Event Type

Lecture / Talk / Workshop


University Park Campus

Add this to your calendar

Recent Activity