Fixed-Point-Free Involution Word Diagrams
| dc.contributor.advisor | Young, Benjamin | |
| dc.contributor.author | Potter, Jake | |
| dc.date.accessioned | 2022-10-04T19:47:13Z | |
| dc.date.available | 2022-10-04T19:47:13Z | |
| dc.date.issued | 2022-10-04 | |
| dc.description.abstract | We define a useful diagram for studying fixed-point-free involution words. Following the example of Little, we define a specific and a general bumping algorithm on these diagrams. These algorithms serve as the basis for bijective proofs of corresponding transition equations for fixed-point-free involution Stanley symmetric functions. We also use the diagrams to show deletion and exchange properties of FPF involution words. | en_US |
| dc.identifier.uri | https://hdl.handle.net/1794/27636 | |
| dc.language.iso | en_US | |
| dc.publisher | University of Oregon | |
| dc.rights | All Rights Reserved. | |
| dc.subject | bumping algorithm | en_US |
| dc.subject | fixed-point-free | en_US |
| dc.subject | involutions | en_US |
| dc.title | Fixed-Point-Free Involution Word Diagrams | |
| dc.type | Electronic Thesis or Dissertation | |
| thesis.degree.discipline | Department of Mathematics | |
| thesis.degree.grantor | University of Oregon | |
| thesis.degree.level | doctoral | |
| thesis.degree.name | Ph.D. |
Files
Original bundle
1 - 1 of 1
Loading...
- Name:
- Potter_oregon_0171A_13387.pdf
- Size:
- 427.82 KB
- Format:
- Adobe Portable Document Format