6th Annual Judith Ramaley Celebration of Research and Creative Scholarship
|
Poster #51 Avoiding Patterns in 3-Partition Sets Jennifer Herdan Faculty Mentor: Brant Deppa This poster will be on counting 3-partition sets, or sets of numbers broken into 3 pieces. Specifically, I will be looking at sets that avoid a 123 pattern. A 123 pattern is formed when it is possible to choose values, one from each partition, and the values will appear in ascending order. I will explain the set up of the problem and an example of a simple case. I will also be looking at different characteristics that are needed to avoid a 123 pattern, as well as times when a value’s placement doesn’t matter. |
|