|
Speaker: Gabriel WongTitle: Member Seminar Title TBAVenue: CMSA Room G10Member Seminar Speaker: Gabriel Wong |
|
Speaker: Aghil AlaeeTitle: Member Seminar Title TBAVenue: CMSA Room G10Member Seminar Speaker: Aghil Alaee |
|
Speaker: Freid TongTitle: Member Seminar Title TBAVenue: CMSA Room G10Member Seminar Speaker: Freid Tong |
|
Speaker: Puskar MondalTitle: Member Seminar Title TBAVenue: CMSA Room G10Member Seminar Speaker: Puskar Mondal |
|
Speaker: Changji XuTitle: Member Seminar Title TBAVenue: CMSA Room G10Member Seminar Speaker: Changji Xu |
|
Speaker: Faidra MonachouTitle: Member Seminar Title TBAVenue: CMSA Room G10Member Seminar Speaker: Faidra Monachou |
|
Speaker: Jue LiuTitle: Member Seminar Title TBAVenue: CMSA Room G10Member Seminar Speaker: Jue Liu |
|
Speaker: Max WiesnerTitle: Quantum Gravity constraints beyond asymptotic regimesVenue: CMSA Room G10Member Seminar Speaker: Max Wiesner Title: Quantum Gravity constraints beyond asymptotic regimes Abstract: Not every effective field theory that is consistent in the absence of gravity can be completed to a consistent theory of quantum gravity. The goal of the Swampland program is to find general criteria that distinguish effective field theories, that can be obtained as a low-energy approximation of quantum gravity, from those that are inconsistent in the presence of gravity. These criteria are oftentimes motivated by patterns observed in explicit compactifications of perturbative string theory and have passed many non-trivial tests in asymptotic regions of the field space such as, e.g., weak coupling limits. Still, the Swampland criteria should equally apply to effective theories that do… |
|
Speaker: Michael SimkinTitle: Randomized algorithms in combinatoricsVenue: CMSA Room G10Member Seminar Speaker: Michael Simkin Title: Randomized algorithms in combinatorics Abstract: Randomized algorithms have been a computational workhorse for almost as long as there have been computers. Surprisingly, such algorithms can also be used to attack problems that are neither algorithmic nor probabilistic. Time permitting I will discuss the following combintorial examples: Enumerative combinatorics and the n-queens problem: In how many ways can one place n queens on an n x n chessboard so that no queen threatens any other? Constructions of combinatorial designs and the Erdos high-girth Steiner triple system problem: An order-n Steiner triple system (STS) is a collection of triples on n vertices such that every pair of vertices is contained in exactly one triple. In… |
|
Speaker: Juven WangTitle: Categorical Symmetry of the Standard Model from Gravitational AnomalyVenue: CMSA Room G10Member Seminar Speaker: Juven Wang Title: Categorical Symmetry of the Standard Model from Gravitational Anomaly Abstract: In the Standard Model, the total “sterile right-handed” neutrino number n_{νR} is not equal to the family number Nf. The anomaly index (-Nf+n_{νR}) had been advocated to play an important role in our previous work on Cobordism and Deformation Class of the Standard Model [2112.14765, 2204.08393] and Ultra Unification [2012.15860] in order to predict new highly entangled sectors beyond the Standard Model. Moreover, the invertible baryon minus lepton number B−L symmetry current conservation can be violated quantum mechanically by gravitational backgrounds such as gravitational instantons. In specific, we show that a noninvertible categorical counterpart of the B−L symmetry still survives in gravitational backgrounds. In general, we… |
|
Speaker: Barak WeissTitle: New bounds on lattice covering volumes, and nearly uniform coversVenue: CMSA Room G10Member Seminar Speaker: Barak Weiss Title: New bounds on lattice covering volumes, and nearly uniform covers Abstract: Let L be a lattice in R^n and let K be a convex body. The covering volume of L with respect to K is the minimal volume of a dilate rK, such that L+rK = R^n, normalized by the covolume of L. Pairs (L,K) with small covering volume correspond to efficient coverings of space by translates of K, where the translates lie in a lattice. Finding upper bounds on the covering volume as the dimension n grows is a well studied problem, with connections to practical questions arising in computer science and electrical engineering. In a recent paper with Or Ordentlich (EE,… |
|
Speaker: Dan KapecTitle: Hints of Flat Space HolographyVenue: CMSA Room G10Member Seminar Speaker: Dan Kapec Title: Hints of Flat Space Holography Abstract: Despite our detailed understanding of holography in Anti-de Sitter space, flat space holography remains somewhat mysterious. “Celestial CFT” is a formalism which attempts to recast quantum gravity in (d+2)-dimensional asymptotically flat spacetimes in terms of a d-dimensional Euclidean conformal field theory residing at the conformal boundary. I will discuss certain universal aspects of this correspondence. As in Anti-de Sitter space, bulk gravitons produce a boundary stress tensor, and bulk gluons furnish boundary-conserved currents. I will also show that continuous spaces of vacua in the bulk map directly onto the conformal manifold of the boundary CFT. This correspondence provides a new perspective on the role of the BMS group… |
|
Speaker: Farzan VafaTitle: Dynamics of active nematic defects on conesVenue: CMSA Room G10Member Seminar Speaker: Farzan Vafa Title: Dynamics of active nematic defects on cones Abstract: In the first part of the talk, we investigate the ground-state configurations of two-dimensional liquid crystals with p-fold rotational symmetry (p-atics) on cones. The cone apex develops an effective topological charge, which in analogy to electrostatics, leads to defect absorption and emission at the cone apex as the deficit angle of the cone is varied. We find three types of ground-state configurations as a function of cone angle, which is determined by charged defects screening the effective apex charge: (i) for sharp cones, all of the +1/p defects are absorbed by the apex; (ii) at intermediate cone angles, some of the +1/p defects are absorbed… |
|
Speaker: Chuck DoranTitle: Motivic Geometry of Two-Loop Feynman IntegralsVenue: CMSA Room G10Member Seminar Speaker: Chuck Doran Title: Motivic Geometry of Two-Loop Feynman Integrals Abstract: We study the geometry and Hodge theory of the cubic hypersurfaces attached to two-loop Feynman integrals for generic physical parameters. We show that the Hodge structure attached to planar two-loop Feynman graphs decomposes into a mixed Tate piece and a variation of Hodge structure from families of hyperelliptic curves, elliptic curves, or rational curves depending on the space-time dimension. We give more precise results for two-loop graphs with a small number of edges. In particular, we recover a result of Spencer Bloch that in the well-known double box example there is an underlying family of elliptic curves, and we give a concrete description of these elliptic curves. We show… |
|
Speaker: Michael DouglasTitle: AI and Theorem ProvingVenue: CMSA Room G10Member Seminar Speaker: Mike Douglas Title: AI and Theorem Proving Abstract: We survey interactive theorem proving and the Lean theorem prover, and the use of AI and large language models to improve this technology. We hope to start a discussion on projects we can do at the CMSA. |
|
Speaker: Alejandro PovedaTitle: Compactness and Anticompactness Principles in Set TheoryVenue: CMSA Room G10Member Seminar Speaker: Alejandro Poveda Title: Compactness and Anticompactness Principles in Set Theory Abstract: Several fundamental properties in Topology, Algebra or Logic are expressed in terms of Compactness Principles.For instance, a natural algebraic question is the following: Suppose that G is an Abelian group whose all small subgroups are free – Is the group G free? If the answer is affirmative one says that compactness holds; otherwise, we say that compactness fails. Loosely speaking, a compactness principle is anything that fits the following slogan: Suppose that M is a mathematical structure (a group, a topological space, etc) such that all of its small substructures N have certain property $\varphi$; then the ambient structure M has property $\varphi$, as well…. |
|
Speaker: Damian van de HeisteegTitle: Light states in the interior of CY moduli spacesVenue: CMSA Room G10Member Seminar Speaker: Damian van de Heisteeg Title: Light states in the interior of CY moduli spaces Abstract: In string theory one finds that states become massless as one approaches boundaries in Calabi-Yau moduli spaces. In this talk we look in the opposite direction, that is, we search for points where the mass gap for these light states is maximized — the so-called desert. In explicit examples we identify these desert points, and find that they correspond to special points in the moduli space of the CY, such as orbifold points and rank two attractors. |
|
Speaker: Mauricio RomoTitle: Quantum trace and length conjecture for hyperbolic knotVenue: CMSA Room G10Member Seminar Speaker: Mauricio Romo Title: Quantum trace and length conjecture for hyperbolic knot Abstract: I will define the quantum trace map for an ideally triangulated hyperbolic knot complement on S^3. This map assigns an operator to each element L of the Kauffman Skein module of knot complement. Motivated by an interpretation of this operator in the context of SL(2,C) Chern-Simons theory, one can formulate a ‘length conjecture’ for the hyperbolic length of L. |
|
Speaker: Shuaijie QianTitle: Some non-concave dynamic optimization problems in financeVenue: CMSA Room G10Member Seminar Speaker: Shuaijie Qian (Harvard CMSA) Title: Some non-concave dynamic optimization problems in finance Abstract: Non-concave dynamic optimization problems appear in many areas of finance and economics. Most of existing literature solves these problems using the concavification principle, and derives equivalent, concave optimization problems whose value functions are still concave. In this talk, I will present our recent work on some non-concave dynamic optimization problems, where the concavification principle may not hold and the resulting value function is indeed non-concave. The first work is about the portfolio selection model with capital gains tax and a bitcoin mining model with exit options and technology innovation, where the average tax basis and the average mining cost serves as an approximation, respectively…. |
|
Speaker: David ZuckermanTitle: Explicit Ramsey Graphs and Two Source ExtractorsVenue: CMSA Room G10Speaker: David Zuckerman, Harvard CMSA/University of Texas at Austin Title: Explicit Ramsey Graphs and Two Source Extractors Abstract: Ramsey showed that any graph on N nodes contains a clique or independent set of size (log N)/2. Erdos showed that there exist graphs on N nodes with no clique or independent set of size 2 log N, and asked for an explicit construction of such graphs. This turns out to relate to the question of extracting high-quality randomness from two independent low-quality sources. I’ll explain this connection and our recent exponential improvement in constructing two-source extractors. |