Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- (Abstract Harmonic Analysis) Explicit machine computation and programs (not the theory of computation or programming) (1)
- 05A05 (1)
- 05E10 (1)
- 20B30 (1)
- 20C30 (1)
-
- 20G05 Representation theory (1)
- 20H20 Other matrix groups over fields (1)
- 43-04 (1)
- 43A30 (1)
- 65T50 Discrete and fast Fourier transforms (1)
- Combinatorial aspects of representation theory (1)
- Fourier and Fourier-Stieltjes transforms on nonabelian groups and on semigroups (1)
- Permutations & Words & Matrices (1)
- Representations of finite symmetric groups (1)
- Symmetric Groups (1)
Articles 1 - 3 of 3
Full-Text Articles in Algebra
Long Increasing Subsequences, Hannah Friedman
Long Increasing Subsequences, Hannah Friedman
HMC Senior Theses
In my thesis, I investigate long increasing subsequences of permutations from two angles. Motivated by studying interpretations of the longest increasing subsequence statistic across different representations of permutations, we investigate the relationship between reduced words for permutations and their RSK tableaux in Chapter 3. In Chapter 4, we use permutations with long increasing subsequences to construct a basis for the space of 𝑘-local functions.
A New Subgroup Chain For The Finite Affine Group, David Alan Lingenbrink Jr.
A New Subgroup Chain For The Finite Affine Group, David Alan Lingenbrink Jr.
HMC Senior Theses
The finite affine group is a matrix group whose entries come from a finite field. A natural subgroup consists of those matrices whose entries all come from a subfield instead. In this paper, I will introduce intermediate sub- groups with entries from both the field and a subfield. I will also examine the representations of these intermediate subgroups as well as the branch- ing diagram for the resulting subgroup chain. This will allow us to create a fast Fourier transform for the group that uses asymptotically fewer opera- tions than the brute force algorithm.
Fast Algorithms For Analyzing Partially Ranked Data, Matthew Mcdermott
Fast Algorithms For Analyzing Partially Ranked Data, Matthew Mcdermott
HMC Senior Theses
Imagine your local creamery administers a survey asking their patrons to choose their five favorite ice cream flavors. Any data collected by this survey would be an example of partially ranked data, as the set of all possible flavors is only ranked into subsets of the chosen flavors and the non-chosen flavors. If the creamery asks you to help analyze this data, what approaches could you take? One approach is to use the natural symmetries of the underlying data space to decompose any data set into smaller parts that can be more easily understood. In this work, I describe …