Projects

š¯”–_n-equivariant Koszul algebras from the Boolean lattice

Erin Delargy, Rylie Harris, Jiachen Kang, Bryan Lu, and Ramanuja Charyulu Telekicherla Kandalam explored two š¯”–_n-equivariant Koszul algebras arising from the Boolean lattice: the Chow ring of the Boolean matroid and the "colorful ring" associated to the barycentric subdivision of a simplex. The dimensions of the graded pieces of both of these algebras correspond to the Eulerian numbers, but the bases and representations for the graded pieces of the two algebras are vastly different. In this talk we compare and contrast the bases and representations for each of these algebras and their Koszul duals. Along the way, we investigate (sometimes noncommutative) Grƶbner bases for these algebras and their Koszul duals, and we prove branching rules for representations of the symmetric group which categorify a recursion on the Eulerian numbers.

Virtual resolutions of points in a product of projective spaces

Isidora Bailly-Hall, Karina Dovgodko, Sean Guan, Sai Sivakumar, and Jishi Sun extended previous work on virtual resolutions in products of projective spaces. Free resolutions, or syzygies, with a graded structure are algebraic objects that encode many geometric properties. This correspondence lies at the heart of classical projective algebraic geometry. Virtual resolutions were recently introduced by Berkesch, Erman, and Smith to produce a similar correspondence for smooth toric varieties. We will describe two methods for producing nice virtual resolutions for aĀ  finite sets of points in $\PP^n\times\PP^m$.

Simplicial Complexes and Jeu de Taquin

GL(n,k)-stable ideals in positive characteristic

Cluster monomials in graph LP algebras

Zeus Dantas e Moura, Ramanuja Charyulu Telekicherla Kandalam, and Dora Woodruff worked on cluster monomials associated to graph LP algebras. LP algebras are a generalization of cluster algebras, first defined by Lam and Pylyavskyy, and graph LP algebras are a particularly nice class of LP algebras, whose exchange polynomials are defined by a graph. Several well-known properties and conjectures about cluster algebras appear to hold for LP algebras too, and in our project, we extend these properties to graph LP algebras. In particular, we show that cluster monomials form a linear spanning set for all graph LP algebras, and show total positivity for LP algebras arising from certain classes of graphs.Ā 

(K)not detecting boundary slopes via intersections in the character variety arising from epimorphisms

Isidora Bailly-Hall, Karina Dovgodko, Akash Ganguly, Jiachen Kang, and Jishi Sun studied detecting boundary slopes via intersections in the character variety arising from epimorphisms onto certain knots.Ā  The SL(2,C) character variety has long been an important tool in the study of 3-manifolds. In particular, intersection points in character varieties of knot groups detect essential surfaces via SL(2,C)-trees. We describe intersection points in the character varieties of a family of hyperbolic two-bridge knot groups that have epimorphisms onto the trefoil knot. Using the technique of Farey recursion, we show that these intersection points correspond to algebraic non-integral representations. We also determine the boundary slopes detected by these intersection points.