Open Access. Powered by Scholars. Published by Universities.®
- Keyword
-
- Algebraic combinatorics (2)
- Combinatorics (2)
- 05 (1)
- 05-02 (1)
- 05A05 (1)
-
- 05C99 Graph theory (1)
- 05E (1)
- 05E10 (1)
- 05E18 (1)
- 05E99 Algebraic combinatorics (1)
- 13F60 Cluster algebras (1)
- 14M25 Toric varieties (1)
- 20B30 (1)
- 52B11 (1)
- Adinkra (1)
- Algebra (1)
- Authomorphism rigidity of graphs (1)
- Chip firing (1)
- Combinatorial aspects of representation theory (1)
- Graph (1)
- Interpolation Jack polynomial (1)
- Interpolation polynomial (1)
- Jacobian (1)
- K-colorability (1)
- Lie algebras (1)
- Partition algebra (1)
- Permutation statistics (1)
- Permutations & Words & Matrices (1)
- Polynomial method (1)
- Random walk (1)
- Publication Type
Articles 1 - 9 of 9
Full-Text Articles in Algebra
An Inquiry Into Lorentzian Polynomials, Tomás Aguilar-Fraga
An Inquiry Into Lorentzian Polynomials, Tomás Aguilar-Fraga
HMC Senior Theses
In combinatorics, it is often desirable to show that a sequence is unimodal. One method of establishing this is by proving the stronger yet easier-to-prove condition of being log-concave, or even ultra-log-concave. In 2019, Petter Brändén and June Huh introduced the concept of Lorentzian polynomials, an exciting new tool which can help show that ultra-log-concavity holds in specific cases. My thesis investigates these Lorentzian polynomials, asking in which situations they are broadly useful. It covers topics such as matroid theory, discrete convexity, and Mason’s conjecture, a long-standing open problem in matroid theory. In addition, we discuss interesting applications to known …
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.
Permutations, Representations, And Partition Algebras: A Random Walk Through Algebraic Statistics, Ian Shors
Permutations, Representations, And Partition Algebras: A Random Walk Through Algebraic Statistics, Ian Shors
HMC Senior Theses
My thesis examines a class of functions on the symmetric group called permutation statistics using tools from representation theory. In 2014, Axel Hultman gave formulas for computing expected values of permutation statistics sampled via random walks. I present analogous formulas for computing variances of these statistics involving Kronecker coefficients – certain numbers that arise in the representation theory of the symmetric group. I also explore deep connections between the study of moments of permutation statistics and the representation theory of the partition algebras, a family of algebras introduced by Paul Martin in 1991. By harnessing these partition algebras, I derive …
On Rank-Two And Affine Cluster Algebras, Feiyang Lin
On Rank-Two And Affine Cluster Algebras, Feiyang Lin
HMC Senior Theses
Motivated by existing results about the Kronecker cluster algebra, this thesis is concerned with two families of cluster algebras, which are two different ways of generalizing the Kronecker case: rank-two cluster algebras, and cluster algebras of type An,1. Regarding rank-two cluster algebras, our main result is a conjectural bijection that would prove the equivalence of two combinatorial formulas for cluster variables of rank-two skew-symmetric cluster algebras. We identify a technical result that implies the bijection and make partial progress towards its proof. We then shift gears to study certain power series which arise as limits of ratios of …
On The Mysteries Of Interpolation Jack Polynomials, Havi Ellers
On The Mysteries Of Interpolation Jack Polynomials, Havi Ellers
HMC Senior Theses
Interpolation Jack polynomials are certain symmetric polynomials in N variables with coefficients that are rational functions in another parameter k, indexed by partitions of length at most N. Introduced first in 1996 by F. Knop and S. Sahi, and later studied extensively by Sahi, Knop-Sahi, and Okounkov-Olshanski, they have interesting connections to the representation theory of Lie algebras. Given an interpolation Jack polynomial we would like to differentiate it with respect to the variable k and write the result as a linear combination of other interpolation Jack polynomials where the coefficients are again rational functions in k. In this …
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
Classifying The Jacobian Groups Of Adinkras, Aaron R. Bagheri
HMC Senior Theses
Supersymmetry is a theoretical model of particle physics that posits a symmetry between bosons and fermions. Supersymmetry proposes the existence of particles that we have not yet observed and through them, offers a more unified view of the universe. In the same way Feynman Diagrams represent Feynman Integrals describing subatomic particle behaviour, supersymmetry algebras can be represented by graphs called adinkras. In addition to being motivated by physics, these graphs are highly structured and mathematically interesting. No one has looked at the Jacobians of these graphs before, so we attempt to characterize them in this thesis. We compute Jacobians through …
Graph Cohomology, Matthew Lin
Graph Cohomology, Matthew Lin
HMC Senior Theses
What is the cohomology of a graph? Cohomology is a topological invariant and encodes such information as genus and euler characteristic. Graphs are combinatorial objects which may not a priori admit a natural and isomorphism invariant cohomology ring. In this project, given any finite graph G, we constructively define a cohomology ring H*(G) of G. Our method uses graph associahedra and toric varieties. Given a graph, there is a canonically associated convex polytope, called the graph associahedron, constructed from G. In turn, a convex polytope uniquely determines a toric variety. We synthesize these results, and describe the …
Realizing The 2-Associahedron, Patrick N. Tierney
Realizing The 2-Associahedron, Patrick N. Tierney
HMC Senior Theses
The associahedron has appeared in numerous contexts throughout the field of mathematics. By representing the associahedron as a poset of tubings, Michael Carr and Satyan L. Devadoss were able to create a gener- alized version of the associahedron in the graph-associahedron. We seek to create an alternative generalization of the associahedron by considering a particle-collision model. By extending this model to what we dub the 2- associahedron, we seek to further understand the space of generalizations of the associahedron.
Recognizing Graph Theoretic Properties With Polynomial Ideals, Jesus A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar
Recognizing Graph Theoretic Properties With Polynomial Ideals, Jesus A. De Loera, Christopher J. Hillar, Peter N. Malkin, Mohamed Omar
All HMC Faculty Publications and Research
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polynomial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Gröbner bases, toric algebra, convex programming, and real algebraic geometry.