Avoiding Paired Colored Patterns in Length Three

dc.contributor.advisorRiehl, Manda R.
dc.contributor.authorWilliams, Tristan
dc.date.accessioned2010-12-07T21:42:31Z
dc.date.available2010-12-07T21:42:31Z
dc.date.issued2010-04
dc.descriptionColor poster with text and diagrams.en
dc.description.abstractThis project studies pattern avoidance in colored permutations (S_n\wr C_r) using the pattern matching condition developed by Toufik Mansour. He proved results in enumeration of avoidance classes of patterns of length two. We have taken the next step and proved results in the enumeration of avoidance classes of paired patterns of length three.en
dc.description.sponsorshipUniversity of Wisconsin--Eau Claire Office of Research and Sponsored Programsen
dc.identifier.urihttp://digital.library.wisc.edu/1793/47478
dc.language.isoen_USen
dc.relation.ispartofseriesUSGZE AS589en
dc.subjectPermutationsen
dc.subjectCombinatorial analysisen
dc.subjectPostersen
dc.titleAvoiding Paired Colored Patterns in Length Threeen
dc.typePresentationen

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Williams2Spr10.pdf
Size:
197.24 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
2.03 KB
Format:
Item-specific license agreed upon to submission
Description: