Format results
- Pravesh KothariICTS:31834
Spectral Refutations and Their Applications to Algorithms and Combinatorics
Pravesh KothariICTS:31833Extra Lecture - Quantum Matter, PHYS 777 2/2
Chong Wang Perimeter Institute for Theoretical Physics
Perverse coherent sheaves and cluster categorifications
Ilya Dumanskiy Massachusetts Institute of Technology (MIT) - Department of Mathematics
String Theory Course Q&A
PIRSA:25050005Universal Microscopic Descriptions for Anomalies and Long-Range Entanglement
Ryohei Kobayashi Institute for Advanced Study (IAS)
Spectral Refutations and Their Applications to Algorithms and Combinatorics
Pravesh KothariICTS:31834I will present a method to reduce extremal combinatorial problems to establishing the unsatisfiability of k-sparse linear equations mod 2 (aka k-XOR formulas) with a limited amount of randomness. This latter task is then accomplished by bounding the spectral norm of certain "Kikuchi" matrices built from the k-XOR formulas. In these talks, I will discuss a couple of applications of this method from the following list.
1. Proving hypergraph Moore bound (Feige's 2008 conjecture) -- the optimal trade-off between the number of equations in a system of k-sparse linear equations modulo 2 and the size of the smallest linear dependent subset. This theorem generalizes the famous irregular Moore bound of Alon, Hoory and Linial (2002) for graphs (equivalently, 2-sparse linear equations mod 2).
2. Proving a cubic lower bound on 3-query locally decodable codes (LDCs), improving on a quadratic lower bound of Kerenedis and de Wolf (2004) and its generalization to q-query locally decodable codes for all odd q,
3. Proving an exponential lower bound on linear 3-query locally correctable codes (LCCs). This result establishes a sharp separation between 3-query LCCs and 3-query LDCs that are known to admit a construction with a sub-exponential length. It is also the first result to obtain any super-polynomial lower bound for >2-query local codes.
Time permitting, I may also discuss applications to strengthening Szemeredi's theorem, which asks for establishing the minimal size of a random subset of integers S such that every dense subset of integers contains a 3-term arithmetic progression with a common difference from S, and the resolution of Hamada's 1970 conjecture on the algebraic rank of binary 4-designs.
I will include pointers to the many open questions and directions where meaningful progress seems within reach for researchers who may get interested in some of the topics.
Spectral Refutations and Their Applications to Algorithms and Combinatorics
Pravesh KothariICTS:31833I will present a method to reduce extremal combinatorial problems to establishing the unsatisfiability of k-sparse linear equations mod 2 (aka k-XOR formulas) with a limited amount of randomness. This latter task is then accomplished by bounding the spectral norm of certain "Kikuchi" matrices built from the k-XOR formulas. In these talks, I will discuss a couple of applications of this method from the following list.
1. Proving hypergraph Moore bound (Feige's 2008 conjecture) -- the optimal trade-off between the number of equations in a system of k-sparse linear equations modulo 2 and the size of the smallest linear dependent subset. This theorem generalizes the famous irregular Moore bound of Alon, Hoory and Linial (2002) for graphs (equivalently, 2-sparse linear equations mod 2).
2. Proving a cubic lower bound on 3-query locally decodable codes (LDCs), improving on a quadratic lower bound of Kerenedis and de Wolf (2004) and its generalization to q-query locally decodable codes for all odd q,
3. Proving an exponential lower bound on linear 3-query locally correctable codes (LCCs). This result establishes a sharp separation between 3-query LCCs and 3-query LDCs that are known to admit a construction with a sub-exponential length. It is also the first result to obtain any super-polynomial lower bound for >2-query local codes.
Time permitting, I may also discuss applications to strengthening Szemeredi's theorem, which asks for establishing the minimal size of a random subset of integers S such that every dense subset of integers contains a 3-term arithmetic progression with a common difference from S, and the resolution of Hamada's 1970 conjecture on the algebraic rank of binary 4-designs.
I will include pointers to the many open questions and directions where meaningful progress seems within reach for researchers who may get interested in some of the topics.
Extra Lecture - Quantum Matter, PHYS 777 2/2
Chong Wang Perimeter Institute for Theoretical Physics
Optional
Numerical Methods in (Loop) Quantum Gravity
Numerical methods are powerful tools for advancing our understanding of quantum gravity. In this talk, I will introduce two complementary numerical approaches. The first focuses on solving nonlinear partial differential equations that arise in Loop Quantum Gravity (LQG)-inspired effective models. This framework enables us to investigate the formation and evolution of shock waves in spherically symmetric gravitational collapse. The second approach involves the use of complex critical points, Lefschetz thimble techniques, and the Metropolis Monte Carlo algorithm to study the Lorentzian path integral in Spinfoam models and Quantum Regge Calculus. These methods offer new insights into quantum cosmology and black-to-white hole transitions.
Long-term stable non-linear evolutions of ultracompact black hole mimickers
Ultracompact black hole mimickers formed through gravitational collapse under reasonable assumptions obtain light rings in pairs, where one is unstable and the other one is not. Stable light rings are believed to be a potential source for dynamical instability due to the trapping of massless perturbations, as their decay is relatively slow. We study the stability of ultracompact boson stars admitting light rings combining a perturbative analysis with 3+1 numerical-relativity simulations with and without symmetry assumptions. We observe excellent agreement between all perturbative and numerical results which uniformly support the hypothesis that this family of black-hole mimickers is separated into stable and unstable branches by extremal-mass configurations. This separation includes, in particular, thin-shell boson stars with light rings located on the stable branch which we conclude to represent long-term stable black-hole mimickers. Our simulations suggest that the proposed mechanism may not be efficient after all to effectively destroy ultracompact black hole mimickers.Perverse coherent sheaves and cluster categorifications
Ilya Dumanskiy Massachusetts Institute of Technology (MIT) - Department of Mathematics
K-theoretical Coulomb branches are expected to have cluster structure. Cautis and Williams categorified this expectation. In particular, they conjecture (and prove in type A) that the category of perverse coherent sheaves on the affine Grassmannian is a cluster monoidal categorification. We discuss recent progress on this conjecture. In particular, we construct cluster short exact sequences of certain perverse coherent sheaves. We do that by constructing a bridge, relating this (geometric) category to the (algebraic) category of finite dimensional modules over the quantum affine group. This is done by relating both categories to the notion of Feigin--Loktev fusion product.
String Theory Course Q&A
PIRSA:25050005Superconductivity, with Anyons
Hart Goldman University of Minnesota
I will discuss the phenomenology of superconductors hosting both order parameter vortices and fractionally charged anyon excitations. I will demonstrate that in such systems superconductivity and topological order are intertwined under applied magnetic fields, leading to surprising observable consequences departing from traditional superconductivity from electronic pairing. In particular, I will show that vortices nucleated by perpendicular magnetic fields must trap anyons in their cores. However, because only some vortices can trap an integer number of anyons, this places a constraint on the vortex phase winding. In general, rather than the expected hc/2e quantization of superconducting vortices, we find instead the enhanced flux quantum of hc/e, which I will argue should affect a wide range of observables. I will further develop a general Landau-Ginzburg theory describing vortex fluctuations and discuss the phase diagram as perpendicular magnetic field is increased, showing that condensation of the intertwined vortices leads to exotic insulating phases hosting neutral anyons and a nonvanishing thermal Hall effect.
Universal Microscopic Descriptions for Anomalies and Long-Range Entanglement
Ryohei Kobayashi Institute for Advanced Study (IAS)
I will present a unified framework for understanding the statistics and anomalies of excitations—ranging from particles to higher-dimensional objects—in quantum lattice systems. We introduce a general method to compute the quantized statistics of Abelian excitations in arbitrary dimensions via Berry phases of locality-preserving symmetry operations, uncovering novel statistics for membrane excitations. These statistics correspond to quantum anomalies of generalized global symmetries and imply obstructions to gauging, enforcing long-range entanglement. In particular, we show that anomalous higher-form symmetries enforce intrinsic long-range entanglement, meaning that fidelity with any SRE states must exhibit exponential decay, unlike ordinary (0-form) symmetry anomalies. As an application, we identify a new example of (3+1)D mixed-state topological order with fermionic loop excitations, characterized by a breakdown of remote detectability linked to higher-form symmetry anomalies.
A General Framework for Low Soundness Homomorphism Testing
Tushant MittalICTS:31737In this talk, we will look at a general framework to design and analyze algorithms for the problem of testing homomorphisms between finite groups in the low-soundness regime.
Based on an upcoming joint work with Sourya Roy, University of Iowa.