Harmonic Analysis and Representation Commons^™

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.

The Boundedness Of The Hardy-Littlewood Maximal Function And The Strong Maximal Function On The Space Bmo, Wenhao Zhang

CMC Senior Theses

In this thesis, we present the space BMO, the one-parameter Hardy-Littlewood maximal function, and the two-parameter strong maximal function. We use the John-Nirenberg inequality, the relation between Muckenhoupt weights and BMO, and the Coifman-Rochberg proposition on constructing A₁ weights with the Hardy- Littlewood maximal function to show the boundedness of the Hardy-Littlewood maximal function on BMO. The analogous statement for the strong maximal function is not yet understood. We begin our exploration of this problem by discussing an equivalence between the boundedness of the strong maximal function on rectangular BMO and the fact that the strong maximal function maps …

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 …

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.

Supercharacters, Exponential Sums, And The Uncertainty Principle, J.L. Brumbaugh '13, Madeleine Bulkow '14, Patrick S. Fleming, Luis Alberto Garcia '14, Stephan Ramon Garcia, Gizem Karaali, Matt Michal '15, Andrew P. Turner '14

Pomona Faculty Publications and Research

The theory of supercharacters, which generalizes classical character theory, was recently introduced by P. Diaconis and I.M. Isaacs, building upon earlier work of C. Andre. We study supercharacter theories on $(Z/nZ)^d$ induced by the actions of certain matrix groups, demonstrating that a variety of exponential sums of interest in number theory (e.g., Gauss, Ramanujan, and Kloosterman sums) arise in this manner. We develop a generalization of the discrete Fourier transform, in which supercharacters play the role of the Fourier exponential basis. We provide a corresponding uncertainty principle and compute the associated constants in several cases.

Ramanujan Sums As Supercharacters, Christopher F. Fowler '12, Stephan Ramon Garcia, Gizem Karaali

Pomona Faculty Publications and Research

The theory of supercharacters, recently developed by Diaconis-Isaacs and Andre, can be used to derive the fundamental algebraic properties of Ramanujan sums. This machinery frequently yields one-line proofs of difficult identities and provides many novel formulas. In addition to exhibiting a new application of supercharacter theory, this article also serves as a blueprint for future work since some of the abstract results we develop are applicable in much greater generality.

Discrepancy Convergence For The Drunkard's Walk On The Sphere, Francis E. Su

All HMC Faculty Publications and Research

We analyze the drunkard's walk on the unit sphere with step size θ and show that the walk converges in order C/sin²(θ) steps in the discrepancy metric (C a constant). This is an application of techniques we develop for bounding the discrepancy of random walks on Gelfand pairs generated by bi-invariant measures. In such cases, Fourier analysis on the acting group admits tractable computations involving spherical functions. We advocate the use of discrepancy as a metric on probabilities for state spaces with isometric group actions.

Almost Periodic Factorization Of Certain Block Triangular Matrix Functions, Ilya M. Spitkovsky, Darryl H. Yong

All HMC Faculty Publications and Research

Let

where , and . For rational such matrices are periodic, and their Wiener-Hopf factorization with respect to the real line always exists and can be constructed explicitly. For irrational , a certain modification (called an almost periodic factorization) can be considered instead. The case of invertible and commuting , was disposed of earlier-it was discovered that an almost periodic factorization of such matrices does not always exist, and a necessary and sufficient condition for its existence was found. This paper is devoted mostly to the situation when is not invertible but the commute pairwise (). The complete description is …