Boundaries of Rank 2 Positroids - A Graphical Algorithm

Explore the boundaries of rank 2 positroids through a graphical algorithm approach in this 54-minute conference talk. Learn about the mathematical structures and computational methods used to analyze positroids, which are important objects in algebraic combinatorics and representation theory. Discover how graphical algorithms can be employed to understand and compute the boundaries of these mathematical objects, with specific focus on the rank 2 case. Gain insights into the intersection of combinatorial mathematics and algorithmic approaches, as presented at the Women at the Intersection of Mathematics and Theoretical Physics discussion meeting. Understand the theoretical foundations and practical applications of this specialized area of mathematics through detailed explanations and visual representations of the graphical algorithm methodology.