Garrett Brown
Garrett Brown has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- A. Mitchell1 shared publication
- Emilee Cardin1 shared publication
- J. Rogge1 shared publication
- John Ahn
Bowdoin College 04011 Brunswick ME USA
1 shared publication - Marion Scheepers
Department of Mathematics, Boise State University, Boise, ID 83725, USA
1 shared publication - Mohit Bansil
Michigan State University, East Lansing, USA
1 shared publication
Latest Publications
- Open Access
Classifying Permutations under Context-Directed Swaps and the \textbf{cds} game
A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by \textbf{cds}, then \textbf{cds} sorts it using the fewest possible block interchanges of any kind. This work introduces a classification of permutations based on their number of \textbf{cds}-eligible contexts. In prior work an object called the strategic pile of a permutation was discovered and shown to provide an efficient measure of the non-\textbf{cds}-sortability of a permutation. Focusing on the classification of permutations with maximal strategic pile, a complete characterization is given when the number of \textbf{cds}-eligible contexts is close to maximal as well as when the number of eligible contexts is minimal. A group action that preserves the number of \textbf{cds}-eligible contexts of a permutation provides, via the orbit-stabilizer theorem, enumerative results regarding the number of permutations with maximal strategic pile and a given number of \textbf{cds}-eligible contexts. Prior work introduced a natural two-person game on permutations that are not \textbf{cds}-sortable. The decision problem of which player has a winning strategy in a particular instance of the game appears to be of high computational complexity. Extending prior results, this work presents new conditions for player ONE to have a winning strategy in this combinatorial game.
Open AccessClassifying Permutations under Context-Directed Swaps and the \textbf{cds} game
A special sorting operation called Context Directed Swap, and denoted \textbf{cds}, performs certain types of block interchanges on permutations. When a permutation is sortable by \textbf{cds}, then \textbf{cds} sorts it using the fewest possible block interchanges of any kind. This work introduces a classification of permutations based on their number of \textbf{cds}-eligible contexts. In prior work an object called the strategic pile of a permutation was discovered and shown to provide an efficient measure of the non-\textbf{cds}-sortability of a permutation. Focusing on the classification of permutations with maximal strategic pile, a complete characterization is given when the number of \textbf{cds}-eligible contexts is close to maximal as well as when the number of eligible contexts is minimal. A group action that preserves the number of \textbf{cds}-eligible contexts of a permutation provides, via the orbit-stabilizer theorem, enumerative results regarding the number of permutations with maximal strategic pile and a given number of \textbf{cds}-eligible contexts. Prior work introduced a natural two-person game on permutations that are not \textbf{cds}-sortable. The decision problem of which player has a winning strategy in a particular instance of the game appears to be of high computational complexity. Extending prior results, this work presents new conditions for player ONE to have a winning strategy in this combinatorial game.
- Open Access
Spectra of Kohn Laplacians on Spheres
In this note, we study the spectrum of the Kohn Laplacian on the unit spheres in $\mathbb{C}^n$ and revisit Folland's classical eigenvalue computation. We also look at the growth rate of the eigenvalue counting function in this context. Finally, we consider the growth rate of the eigenvalues of the perturbed Kohn Laplacian on the Rossi sphere in $\mathbb{C}^2$.Open AccessSpectra of Kohn Laplacians on Spheres
In this note, we study the spectrum of the Kohn Laplacian on the unit spheres in $\mathbb{C}^n$ and revisit Folland's classical eigenvalue computation. We also look at the growth rate of the eigenvalue counting function in this context. Finally, we consider the growth rate of the eigenvalues of the perturbed Kohn Laplacian on the Rossi sphere in $\mathbb{C}^2$.