I'm a first year math graduate student at MIT. Previously, I was an undergraduate at MIT, where I majored in Course 18: Mathematics and minored in Course 24-1: Philosophy. Within math, I am particularly interested in representation theory, Lie theory, and complexity theory. In addition to math, I am very passionate about criminal justice reform. I'm a fellow at The Educational Justice Institute (TEJI) at MIT, which seeks to create sustainable solutions to mass incarceration, social injustice, and barriers to reentry via education and technology. You can find my CV here.
Dual pairs in complex reductive groups. arXiv
In Roger Howe's Remarks on classical invariant theory, he introduces the notion of a dual pair of Lie subalgebras - a pair of reductive Lie subalgebras of a Lie algebra such that and are each other's centralizers in . This notion has a natural analog for algebraic groups: A dual pair of subgroups is a pair of reductive subgroups of an algebraic group such that and are each other's centralizers in . We present substantial progress towards classifying the dual pairs of the complex classical groups (, , , , and ) and their projective counterparts (, , , ). The classifications of dual pairs in , , and are known, but lack a unified explicit treatment; we provide such a treatment. Additionally, we classify the dual pairs in and , and present partial progress towards classifying the dual pairs in , , and .This research was done under the mentorship of David Vogan and Lucas Mason-Brown.
Recently, Fici, Restivo, Silva, and Zamboni introduced the notion of a k-anti-power, which is defined as a word of the form , where are distinct words of the same length. For an infinite word w and a positive integer k, define to be the set of all integers m such that is a k-anti-power, where denotes the i-th letter of w. Define also , where t denotes the Thue-Morse word. For all , is a well-defined positive integer, and for sufficiently large, is a well-defined odd positive integer. In his 2018 paper, Defant shows that and grow linearly in k. We generalize Defant's methods to prove that and grow linearly in k for any nonnegative integer j. In particular, we show that and . Additionally, we show that and .This research was done at the 2018 University of Minnesota Duluth REU program (see more below).
Given a finite word w over a finite alphabet V, consider the graph with vertex set V and with an edge between two elements of V if and only if the two elements alternate in the word w. Such a graph is said to be word-representable or 11-representable by the word w; this latter terminology arises from the phenomenon that the condition of two elements x and y alternating in a word w is the same as the condition of the subword of w induced by x and y avoiding the pattern 11. In this paper, we first study minimal length words which word-represent graphs, giving an explicit formula for both the length and the number of such words in the case of trees and cycles. We then extend the notion of word-representability (or 11-representability) of graphs to t-representability of graphs, for any pattern t on two letters. We prove that every graph is t-representable for any pattern t on two letters (except for possibly one class of t). Finally, we pose a few open problems for future consideration.This research was done at the 2018 University of Minnesota Duluth REU program (see more below).
In 2007, McNamara proved that two skew shapes can have the same Schur support only if they have the same number of rectangles as subdiagrams. This implies that two ribbons can have the same Schur support only if one is obtained by permuting row lengths of the other. We present substantial progress towards classifying when a permutation of row lengths of a ribbon produces a ribbon with the same Schur support as ; when this occurs for all , we say that α has full equivalence class. Our main results include a sufficient condition for a ribbon α to have full equivalence class. Additionally, we prove a separate necessary condition, which we conjecture to be sufficient.This research was done at the 2017 University of Minnesota Twin Cities REU program (see more below).
The special purpose sorting operation, context directed swap (CDS), is an example of the block interchange sorting operation studied in prior work on permutation sorting. CDS has been postulated to model certain molecular sorting events that occur in the genome maintenance program of some species of ciliates. We investigate the mathematical structure of permutations not sortable by the CDS sorting operation. In particular, we present substantial progress towards quantifying permutations with a given strategic pile size, which can be understood as a measure of CDS non-sortability. Our main results include formulas for the number of permutations in with maximum size strategic pile. More generally, we derive a formula for the number of permutations in with strategic pile size k, in addition to an algorithm for computing certain coefficients of this formula, which we call merge numbers.This research was done at the 2016 Boise State University REU program (see more below).
We study a three-player variation of the impartial avoidance game introduced by Anderson and Harary. Three players take turns selecting previously-unselected elements of a finite group. The losing player is the one who selects an element that causes the set of jointly-selected elements to be a generating set for the group, with the previous player winning and the remaining player coming in second place. We describe the winning strategy for these games on cyclic, dihedral, and nilpotent groups.
I participated in Joe Gallian's REU program at the University of Minnesota Duluth. I worked on both independent and collaborative projects in the field of combinatorics on words. For the former, I proved results relating to anti-powers of the Thue-Morse word, generalizing previous results of Colin Defant. For the latter, we proved results regarding the representability of graphs by words.
I participated in Vic Reiner's REU program at the University of Minnesota Twin Cities. Advised by Pasha Pylyavskyy, my research group worked on an algebraic combinatorics problem regarding the Schur supports of ribbon Schur functions.
I participated in Liljana Babinkostova and Marion Scheepers's REU program at Boise State University. I collaborated on an enumerative combinatorics problem relating to quantifying the "fixed points" of a particular sorting algorithm.