
Explore polynomial bounds on Reidemeister moves in knot theory, examining algorithms for trivial knot recognition and the relationship between diagram complexity and move sequences.

Explore variational approximations in Bayesian inference, focusing on group-variable selection and heteroscedastic Gaussian processes. Learn efficient parameter estimation and process forecasting techniques.

Explore Fréchet regression for analyzing gene co-expression networks using population-level single-cell data. Learn to test associations between covariance matrices and covariates.

Explore connections between $L^2$-invariants in operator algebra and entropy/mean dimension in topological dynamical systems, focusing on algebraic actions of discrete groups.

Explore the Langlands project's deep connection between automorphic forms and arithmetic, tracing its roots and current challenges in mathematics.

Explore the chromatic number of random graphs, focusing on lower bounds for G(n,1/2) and its limiting distribution. Discover recent advancements in graph theory and probabilistic methods.

Explore optimal bounds and applications of Hamiltonicity in expanders with Nemanja Draganić, delving into extremal and probabilistic combinatorics, Ramsey theory, and theoretical computer science.

Explore geometric ideas and constructions in the study of rationality of higher-dimensional algebraic varieties, focusing on recent developments and challenges.

Explore tensor power decomposition in group representations, focusing on asymptotic behavior and non-negligible summands using symmetric tensor category theory.

Explore geometric stability of Weyl's law and its applications to asymptotic spectral shape optimization, focusing on eigenvalue behavior in bounded Lipschitz domains.

Explore one-ended spanning trees in free Borel actions of amenable groups, with applications to Borel combinatorics. Discover related results in Baire measurable and Borel settings.

Explore advanced techniques for identifying Poisson boundaries of hyperbolic groups, focusing on the innovative "pin down approximation criterion" for finite entropy measures without moment assumptions.

Explore countable Borel equivalence relations, continuous actions on compact spaces, and subshifts. Investigate complexity and genericity of properties like hyperfiniteness in the space of subshifts.

Explore hypergraph decompositions and their applications in combinatorics with Oxford Professor Peter Keevash, known for solving the Existence Conjecture for Combinatorial Designs.

Explore extremal combinatorics, graph theory, and theoretical computer science with Prof. Jie Han's insights on rainbow thresholds in mathematics.

Explore geometric applications of linear algebra with János Pach, covering discrete geometry, convexity, and combinatorics in this research seminar.

Explore hypertrees with Professor Nati Linial, delving into combinatorics, algorithms, and their applications in computer science and mathematics.

Explore Chinese Restaurant process and statistical inference with Prof. Kiranmoy Das, covering Bayesian modeling and longitudinal data analysis applications.

Explore tensor categories as quantum symmetries, using Jones subfactor theory and bi-unitary connections to study 2D topological order and tensor networks.

Explore tensor categories as quantum symmetries, using Jones subfactor theory and bi-unitary connections to study 2D topological order and tensor networks.

Explore tensor categories as quantum symmetries, using Jones subfactor theory and bi-unitary connections to study 2D topological order and tensor networks.