##### Department of Mathematics,

University of California San Diego

****************************

### Math 269 - Combinatorics

## Mark Tiefenbruck

#### UCSD

## Using an Extension of the Garsia-Milne Involution Principle to Find Bijections

##### Abstract:

\indent We will consider two recent open problems stating that certain statistics on various sets of combinatorial objects are equidistributed. The first, posed by Anders Claesson and Svante Linusson, relates nestings in matchings of $2n$ points on a line to occurrences of a certain pattern in permutations in $S_n$. The second, posed by Miles Jones and Jeffrey Remmel, relates occurrences of a large class of consecutive permutation patterns to occurrences of the same pattern in the cycles of permutations. We will prove an extension of the Garsia-Milne involution principle and use it to solve both problems.

### October 25, 2011

### 4:00 PM

### AP&M 7321

****************************