
Explores the deep structure of rational numbers, focusing on their layered nature within [0,1]. Covers key concepts like Farey sequences and Ford circles, emphasizing rationals' importance in modern mathematics.

Explore real-rooted polynomials, their properties, and connections to combinatorics in this comprehensive lecture covering fundamental theorems, root interlacing, and applications to random spanning trees.

Explore the categorical interpretation of GKZ D-modules in toric homological mirror symmetry, focusing on B-side categories and characteristic cycle strata.

Explore combinatorial approaches to sectional category in finite T_0 spaces, examining McCord maps, weak homotopy equivalences, and Fadell-Neuwirth fibrations through computational examples.

Exploring parametrized motion planning in hyperplane arrangement bundles, focusing on topological complexity under supersolvability conditions. Joint work with Dan Cohen.

Explore new combinatorial condition numbers for linear and integer programs, their relation to existing measures, and their impact on circuit diameter bounds and simplex methods.

Exploration of multiport networks, generalizing Kirchhoff's theorem with novel mathematical approaches. Insights into electrical engineering applications and superport network theory.

Explore quasipolynomial bounds in extremal combinatorics with Zander Kelley, examining key problems and recent advancements in this mathematical field.

Explore classical inequalities in enumerative and algebraic combinatorics, their combinatorial interpretations, and their impact on the field. Gain insights into complexity theoretic aspects.

Delve into communication complexity theory through rectangles, exploring inequality principles, combinatorial strategies, and their applications in computational game theory.

Explore advanced geometric constructions in delta-matroids, examining their relationship to matroids and proving ultra log-concavity of independent sets in mathematical structures.

Explore the probabilistic method in combinatorics and its application to graph theory, focusing on proving the crossing number inequality in graph drawings.