For a moduli space $M$ of stable sheaves over a K3 surface $X$, we propose a series of conjectural identities in the Chow rings $CH_\star (M \times X^\ell),\, \ell \geq 1,$ generalizing the classic Beauville–Voisin identity for a K3 surface. We emphasize consequences of the conjecture for the structure of the tautological subring $R_\star (M) \subset CH_\star (M).$ We prove the proposed identities when $M$ is the Hilbert scheme of points on a K3 surface. This is based on joint work with L. Flapan, A. Marian and R. Silversmith.

I will construct LG mirrors for the Johnson-Kollár series of anticanonical del Pezzo surfaces in weighted projective 3-spaces. The main feature of these surfaces is that their anticanonical linear system is empty. Thus they fall outside of the range of the known mirror constructions. For each of these surfaces, the LG mirror is a pencil of hyperelliptic curves. I will exhibit the regularised I-function of the surface as a period of the pencil and I will sketch how to construct the pencil starting from a work of Beukers, Cohen, and Mellit on finite hypergeometric functions. This is joint work with Alessio Corti.

Most 4-manifolds do not admit symplectic forms, but most admit 2-forms that are “nearly” symplectic. Just like the Seiberg-Witten (SW) invariants, there are Gromov invariants that are compatible with the near-symplectic form. Although (potentially exotic) 4-spheres don’t admit them, there is still a way to bring in near-symplectic techniques and I will describe my ongoing pseudo-holomorphic attempt(s) at analyzing them.

We provide a new parton theory for hole doped cuprates. We will describe both a pseudogap metal with small Fermi surfaces and the conventional Fermi liquid with large Fermi surfaces within mean field level of the same framework. For the pseudogap metal, “Fermi arc” observed in ARPES can be naturally reproduced. We also provide a theory for a critical point across which the carrier density jumps from x to 1+x. We will also discuss the generalization of the theory to Kondo breaking down transition in heavy fermion systems and generic SU(N) Hubbard model.

There is a large literature about points of bounded height on varieties, and about number fields of bounded discriminant. We explain how to unify these two questions by means of a new definition of height for rational points on (certain) stacks over global fields. I talked about some aspects of this work at Barry’s birthday conference, and will try in this talk to emphasize different points, including a conjecture about the asymptotic counting function for points of bounded height on a stack X which simultaneously generalizes the Manin conjectures (the case where X is a variety) and the Malle conjectures (the case where X is a classifying stack BG.)

I’ll discuss a recent connection between two seemingly unrelated problems: how to measure a collection of quantum states without damaging them too much (“gentle measurement”), and how to provide statistical data without leaking too much about individuals (“differential privacy,” an area of classical CS). This connection leads, among other things, to a new protocol for “shadow tomography” of quantum states (that is, answering a large number of questions about a quantum state given few copies of it).

A ray in a graph G = (V, E) is a sequence X (possibly infinite) of distinct vertices x0, x1, . . . such that, for every i, E(xi , xi+1). A classical theorem of graph theory (Halin [1965]) states that if a graph has, for each k 2 N, a set of k many disjoint (say no vertices in common) infinite rays then there is an infinite set of disjoint infinite rays.

The proof seems like an elementary argument by induction that uses the finite version of Menger’s theorem at each step. One would thus expect the theorem to follow by very elementary (even computable) methods plus a compactness argument (or equivalently arithmetic comprhension, ACA0). We show that this is not the case.

Indeed, the construction of the infinite set of disjoint rays is much more complicated. It occupies a level of complexity previously inhabited by a number of logical principals and only one fact from the mathematical literature. Such theorems are called theorems of hyperarithmetic analysis. Formally this means that they imply (in !-models) that for every set A all transfinite iterations (through well-orderings computable from A) of the Turing jump beginning with A exist. On the other hand, they are true in the (!-model) consisting of the subsets of N generated from any single set A by these jump iterations.

There are many variations of this theorem in the graph theory literature that inhabit the subject of ubiquity in graph theory. We discuss a number of them that also supply examples of theorems of hyperarithmetic analysis as well as classical variations that are proof theoretically even stronger.

This work is joint with James Barnes and Jun Le Goh.

If time permits we will also discuss a new class of theorems suggested by a “lemma” in one of the papers in the area. We call them almost theorems of hyperarithmetic analyisis. These are theorems that are proof theoretically very weak over Recursive Comprehension (RCA0) but become theorems of hyperarithmetic analysis once one assumes ACA0.

Imagine the universe is a periodic crystal. If gravity makes space negatively curved, the thin walls of the crystalline structure might trace out a pattern of circles in the sky, visible at night. In this talk we will describe how to generate pictures of these patterns and how to think like a hyperbolic astronomer. We also touch on the connection to knots and links and arithmetic groups. The lecture is accompanied by an exhibit of prints in the Science Center lobby. (This talk will be accessible to members of the department at all levels.)

We provide a new parton theory for hole doped cuprates. We will describe both a pseudogap metal with small Fermi surfaces and the conventional Fermi liquid with large Fermi surfaces within mean field level of the same framework. For the pseudogap metal, “Fermi arc” observed in ARPES can be naturally reproduced. We also provide a theory for a critical point across which the carrier density jumps from x to 1+x. We will also discuss the generalization of the theory to Kondo breaking down transition in heavy fermion systems and generic SU(N) Hubbard model.

There is a large literature about points of bounded height on varieties, and about number fields of bounded discriminant. We explain how to unify these two questions by means of a new definition of height for rational points on (certain) stacks over global fields. I talked about some aspects of this work at Barry’s birthday conference, and will try in this talk to emphasize different points, including a conjecture about the asymptotic counting function for points of bounded height on a stack X which simultaneously generalizes the Manin conjectures (the case where X is a variety) and the Malle conjectures (the case where X is a classifying stack BG.)

I’ll discuss a recent connection between two seemingly unrelated problems: how to measure a collection of quantum states without damaging them too much (“gentle measurement”), and how to provide statistical data without leaking too much about individuals (“differential privacy,” an area of classical CS). This connection leads, among other things, to a new protocol for “shadow tomography” of quantum states (that is, answering a large number of questions about a quantum state given few copies of it).

A ray in a graph G = (V, E) is a sequence X (possibly infinite) of distinct vertices x0, x1, . . . such that, for every i, E(xi , xi+1). A classical theorem of graph theory (Halin [1965]) states that if a graph has, for each k 2 N, a set of k many disjoint (say no vertices in common) infinite rays then there is an infinite set of disjoint infinite rays.

The proof seems like an elementary argument by induction that uses the finite version of Menger’s theorem at each step. One would thus expect the theorem to follow by very elementary (even computable) methods plus a compactness argument (or equivalently arithmetic comprhension, ACA0). We show that this is not the case.

Indeed, the construction of the infinite set of disjoint rays is much more complicated. It occupies a level of complexity previously inhabited by a number of logical principals and only one fact from the mathematical literature. Such theorems are called theorems of hyperarithmetic analysis. Formally this means that they imply (in !-models) that for every set A all transfinite iterations (through well-orderings computable from A) of the Turing jump beginning with A exist. On the other hand, they are true in the (!-model) consisting of the subsets of N generated from any single set A by these jump iterations.

There are many variations of this theorem in the graph theory literature that inhabit the subject of ubiquity in graph theory. We discuss a number of them that also supply examples of theorems of hyperarithmetic analysis as well as classical variations that are proof theoretically even stronger.

This work is joint with James Barnes and Jun Le Goh.

If time permits we will also discuss a new class of theorems suggested by a “lemma” in one of the papers in the area. We call them almost theorems of hyperarithmetic analyisis. These are theorems that are proof theoretically very weak over Recursive Comprehension (RCA0) but become theorems of hyperarithmetic analysis once one assumes ACA0.

Imagine the universe is a periodic crystal. If gravity makes space negatively curved, the thin walls of the crystalline structure might trace out a pattern of circles in the sky, visible at night. In this talk we will describe how to generate pictures of these patterns and how to think like a hyperbolic astronomer. We also touch on the connection to knots and links and arithmetic groups. The lecture is accompanied by an exhibit of prints in the Science Center lobby. (This talk will be accessible to members of the department at all levels.)

I will give an introduction to the topic of this semester’s seminar: the automorphisms of E_n-operads. Our main goal is to understand the computation of Fresse, Turchin and Willwacher of the rational homotopy of Map^h(E_m,E_n^Q) in terms of graph homology. We then discuss some potential applications, and lines of inquiry opened up by this result. This connects the topic to differential topology and number theory.

In this talk, we will introduce the concept of improvabilty of the dominant energy scalar and discuss strong consequences of non-improvability. We employ new, large families of deformations of the modified Einstein constraint operator and show that, generically, their adjoint linearizations are either injective, or else one can prove that kernel elements satisfy a “null-vector equation”. Combined with a conformal argument, we make significant progress toward Bartnik’s stationary conjecture. More specifically, we prove that a Bartnik minimizing initial data set can be developed into a spacetime that both satisfies the dominant energy condition and carries a global Killing field. We also show that this spacetime is vacuum near spatial infinity. This talk is based on the joint work with Dan Lee.

I’ll discuss the Viterbo transfer functor from the (partially) wrapped Fukaya category of a Liouville domain to that of a subdomain. It is a localization when everything in sight is Weinstein, and I’ll explain how much of that survives if we drop the assumption that the cobordism is Weinstein. The result allows us to turn natural questions about exact Lagrangians into interesting questions in homotopical algebra.

Future schedule is found here: https://scholar.harvard.edu/gerig/seminar

A celebrated theorem of C.L. Siegel from 1929 shows that the multiplicity of eigenvalues for the Laplace eigenfunctions on the unit disk is at most two. We study the fourth order clamped plate problem, showing that the multiplicity of eigenvalues is uniformly bounded. Our method is based on new recursion formulas and Siegel–Shidlovskii theory. If time permits, we discuss possible applications also to nodal geometry. The talk is based on a joint work with Yuri Lvovsky.

Motivic complexes of Voevodsky have no right to two properties (1) cohomological sparsity and (2) a relationship with differential forms. This is, however, true p-adically over characteristic p by a result of Geisser-Levine, relying on previous results of Bloch-Kato-Gabber. I will explain this result, including the cast of characters involved like the logarithmic de Rham-Witt sheaves, Bloch’s higher Chow groups and algebraic/Milnor K-theory.

The talk will revolve around combinatorial aspects Prym varieties, a class of Abelian varieties that occurs in the presence of double covers. Pryms have deep connections with torsion points of Jacobians, bi-tangent lines of curves, and spin structures. As I will explain, problems concerning Pryms may be reduced, via tropical geometry, to combinatorial games on graphs. As a consequence, we obtain new results concerning the geometry of special algebraic curves, and bounds on dimensions of certain Brill–Noether loci.

Sampling from a classical, thermal distribution is, in general, a computationally hard problem. In particular, standard Monte Carlo algorithms converge slowly close to a phase transition or in the presence of frustration. In this work, we explore whether a quantum computer can provide a speedup for problems of this type. The sampling problem can be reduced to the task of preparing a pure quantum state, the so-called Gibbs state [1]. Samples from the thermal distribution are obtained by performing projective measurements on this state. To prepare the Gibbs state, we exploit a mapping from a classical Monte Carlo algorithm to a quantum Hamiltonian whose ground state is the Gibbs state [2]. We demonstrate with concrete examples that a quantum speedup can be achieved by identifying optimal adiabatic trajectories in an extended parameter space of the quantum Hamiltonian. Our approach elucidates intimate connections between computational complexity and phase transitions. Finally, we propose a realistic implementation of the algorithm using Rydberg atoms suitable for near-term quantum devices.

[1] R. D. Somma and C. D. Batista, Phys. Rev. Lett. 99, 030603 (2007). [2] F. Verstraete, M. M. Wolf, D. Perez-Garcia, and J. I. Cirac, Phys. Rev. Lett. 96, 220601 (2006).

In this talk, we discuss how to derive the equivariant SYZ mirror of toric manifolds by counting holomorphic discs. In the case of (semi-)Fano toric manifolds, those mirrors recover Givental’s equivariant mirrors, which compute the equivariant quantum cohomology. Also, we formulate and compute open Gromov-Witten invariants of singular SYZ fiber, which are closely related to the open Gromov-Witten invariants of Aganagic-Vafa branes. This talk is based on joint work with Hansol Hong, Siu-Cheong Lau, and Xiao Zheng.

Motivic complexes of Voevodsky have no right to two properties (1) cohomological sparsity and (2) a relationship with differential forms. This is, however, true p-adically over characteristic p by a result of Geisser-Levine, relying on previous results of Bloch-Kato-Gabber. I will explain this result, including the cast of characters involved like the logarithmic de Rham-Witt sheaves, Bloch’s higher Chow groups and algebraic/Milnor K-theory.

The talk will revolve around combinatorial aspects Prym varieties, a class of Abelian varieties that occurs in the presence of double covers. Pryms have deep connections with torsion points of Jacobians, bi-tangent lines of curves, and spin structures. As I will explain, problems concerning Pryms may be reduced, via tropical geometry, to combinatorial games on graphs. As a consequence, we obtain new results concerning the geometry of special algebraic curves, and bounds on dimensions of certain Brill–Noether loci.

Sampling from a classical, thermal distribution is, in general, a computationally hard problem. In particular, standard Monte Carlo algorithms converge slowly close to a phase transition or in the presence of frustration. In this work, we explore whether a quantum computer can provide a speedup for problems of this type. The sampling problem can be reduced to the task of preparing a pure quantum state, the so-called Gibbs state [1]. Samples from the thermal distribution are obtained by performing projective measurements on this state. To prepare the Gibbs state, we exploit a mapping from a classical Monte Carlo algorithm to a quantum Hamiltonian whose ground state is the Gibbs state [2]. We demonstrate with concrete examples that a quantum speedup can be achieved by identifying optimal adiabatic trajectories in an extended parameter space of the quantum Hamiltonian. Our approach elucidates intimate connections between computational complexity and phase transitions. Finally, we propose a realistic implementation of the algorithm using Rydberg atoms suitable for near-term quantum devices.

[1] R. D. Somma and C. D. Batista, Phys. Rev. Lett. 99, 030603 (2007). [2] F. Verstraete, M. M. Wolf, D. Perez-Garcia, and J. I. Cirac, Phys. Rev. Lett. 96, 220601 (2006).

In this talk, we discuss how to derive the equivariant SYZ mirror of toric manifolds by counting holomorphic discs. In the case of (semi-)Fano toric manifolds, those mirrors recover Givental’s equivariant mirrors, which compute the equivariant quantum cohomology. Also, we formulate and compute open Gromov-Witten invariants of singular SYZ fiber, which are closely related to the open Gromov-Witten invariants of Aganagic-Vafa branes. This talk is based on joint work with Hansol Hong, Siu-Cheong Lau, and Xiao Zheng.

Every Newton polygon satisfying the Kottwitz conditions occurs on Shimura varieties of PEL-type in positive characteristic (Viehmann/Wedhorn). In most cases, it is not known whether these Newton polygon strata contain points representing the Jacobians of smooth curves. In some cases, this is not even known for the mu-ordinary stratum. We provide a positive answer for the mu-ordinary and almost mu-ordinary strata in infinitely many cases. For base cases, we consider the arithmetic of some of Moonen’s families of cyclic covers of the projective line. As an application, we produce infinitely many new examples of unusual Newton polygons which occur for Jacobians of smooth curves. This is joint work with Li, Mantovan, and Tang.

In game theory, we often use infinite models to represent “limit” settings, such as markets with a large number of agents or games with a long time horizon. Yet many game-theoretic models incorporate finiteness assumptions that, while introduced for simplicity, play a real role in the analysis. Here, we show how to extend key results from (finite) models of matching, games on graphs, and trading networks to infinite models by way of Logical Compactness, a core result from Propositional Logic. Using Compactness, we prove the existence of man-optimal stable matchings in infinite economies, as well as strategy-proofness of the man-optimal stable matching mechanism. We then use Compactness to eliminate the need for a finite start time in a dynamic matching model. Finally, we use Compactness to prove the existence of both Nash equilibria in infinite games on graphs and Walrasian equilibria in infinite trading networks.

will speak on: “Symplectic, or mirrorical, look at the Fargues-Fontaine curve”

Homological mirror symmetry describes Lagrangian Floer theory on a torus in terms of vector bundles on the Tate elliptic curve. A version of Lekili and Perutz’s works “over Z[[t]]”, where t is the Novikov parameter. I will review this story and describe a modified form of it, which is joint work with Lekili, where the Floer theory is altered by a locally constant sheaf of rings on the torus. When the fiber of this sheaf of rings is perfectoid of characteristic p, and the holonomy around one of the circles in the torus is the pth power map, it is possible to specialize to t = 1, and the resulting theory there is described in terms of vector bundles on the equal-characteristic-version of the Fargues-Fontaine curve.

Jang’s equation is a degenerate elliptic differential equation which plays an important role in the positive mass theorem. In this talk, we describe a high order WENO (Weighted Essentially Non-Oscillatory) scheme for the Jang’s equation. Some special solutions will be shown, such as those possessing spherical symmetry and axial symmetry.

The out-of-time-ordered correlation (OTOC) and entanglement are two physically motivated and widely used probes of the “scrambling” of quantum information, a phenomenon that has drawn great interest recently in quantum gravity and many-body physics. We argue that the corresponding notions of scrambling can be fundamentally different, by proving an asymptotic separation between the time scales of the saturation of OTOC and that of entanglement entropy in a random quantum circuit model defined on graphs with a tight bottleneck, such as tree graphs connected at the roots. Our result counters the intuition that a random quantum circuit mixes in time proportional to the diameter of the underlying graph of interactions. It also provides a more rigorous justification for an argument of arXiv:1807.04363, that black holes may be slow information scramblers. Such observations may be of fundamental importance in the understanding of the black hole information problem. The bounds we obtained for OTOC are interesting in their own right in that they generalize previous studies of OTOC on lattices to the geometries on graphs in a rigorous and general fashion.

I will briefly review the pseudogap phenomenology in high Tc cuprate superconductors, especially recent experiments related to charge density waves and pair density waves, and propose a simple theory of the pseudogap. By quantum disordering a pair density wave, we found a state composed of insulating antinodal pairs and a nodal electron pocket. We compare the theoretical predictions with ARPES results, optical conductivity, quantum oscillation and other experiments.

We consider the family of normal octic fields with Galois group $D_4$, ordered by their discriminant. In forthcoming joint work with Arul Shankar, we verify the strong form of Malle’s conjecture for this family of number fields, obtaining the order of growth as well as the constant of proportionality. In this talk, we will discuss and review the combination of techniques from analytic number theory and geometry-of-numbers methods used to prove this and related results.

Can you use the homotopy type of the space of knots in a simply-connected 4-manifold to distinguish smooth structures? The answer is no, using embedding calculus. I will also give some examples which show that embedding calculus does distinguish smooth structures in high dimensions. This is joint with Ben Knudsen.

Quantum money is a cryptographic protocol for quantum computers. A quantum money protocol consists of a quantum state which can be created (by the mint) and verified (by anybody with a quantum computer who knows what the “serial number” of the money is), but which cannot be duplicated, even by somebody with a copy of the quantum state who knows the verification protocol. Several previous proposals have been made for quantum money protocols. We will discuss the history of quantum money and give a protocol which cannot be broken unless lattice cryptosystems are insecure.

Max Dehn made many remarkable contributions to mathematics, and his name pops up in lots of places, most often in topology, where we have “Dehn surgery”, the “Dehn twist”, and “Dehn’s lemma”. Famously, Dehn supplied an incorrect proof of the lemma that bears his name. The mistake wasn’t noticed for nearly a decade, and took nearly another four decades to fix. In this talk, I won’t mention the lemma, but I will say a few words about Dehn himself, a few more about his early work on “scissors congruences”, and then yet more on the Dehn twist, closing with a recent result about Dehn twists in four dimensions. (This talk will be accessible to members of the department at all levels.)

I will briefly review the pseudogap phenomenology in high Tc cuprate superconductors, especially recent experiments related to charge density waves and pair density waves, and propose a simple theory of the pseudogap. By quantum disordering a pair density wave, we found a state composed of insulating antinodal pairs and a nodal electron pocket. We compare the theoretical predictions with ARPES results, optical conductivity, quantum oscillation and other experiments.

We consider the family of normal octic fields with Galois group $D_4$, ordered by their discriminant. In forthcoming joint work with Arul Shankar, we verify the strong form of Malle’s conjecture for this family of number fields, obtaining the order of growth as well as the constant of proportionality. In this talk, we will discuss and review the combination of techniques from analytic number theory and geometry-of-numbers methods used to prove this and related results.

Can you use the homotopy type of the space of knots in a simply-connected 4-manifold to distinguish smooth structures? The answer is no, using embedding calculus. I will also give some examples which show that embedding calculus does distinguish smooth structures in high dimensions. This is joint with Ben Knudsen.

Quantum money is a cryptographic protocol for quantum computers. A quantum money protocol consists of a quantum state which can be created (by the mint) and verified (by anybody with a quantum computer who knows what the “serial number” of the money is), but which cannot be duplicated, even by somebody with a copy of the quantum state who knows the verification protocol. Several previous proposals have been made for quantum money protocols. We will discuss the history of quantum money and give a protocol which cannot be broken unless lattice cryptosystems are insecure.

Max Dehn made many remarkable contributions to mathematics, and his name pops up in lots of places, most often in topology, where we have “Dehn surgery”, the “Dehn twist”, and “Dehn’s lemma”. Famously, Dehn supplied an incorrect proof of the lemma that bears his name. The mistake wasn’t noticed for nearly a decade, and took nearly another four decades to fix. In this talk, I won’t mention the lemma, but I will say a few words about Dehn himself, a few more about his early work on “scissors congruences”, and then yet more on the Dehn twist, closing with a recent result about Dehn twists in four dimensions. (This talk will be accessible to members of the department at all levels.)

Higher symmetries can emerge at low energies in a topologically ordered state with no symmetry, when some topological excitations have very high energy scales while other topological excitations have low energies. The low energy properties of topological orders in this limit, with the emergent higher symmetries, may be described by higher symmetry protected topological order. This motivates us, as a simplest example, to study a lattice model of $Z_n$-1-symmetry protected topological (1-SPT) states in 3+1D for even $n$. We write down an exactly solvable lattice model and study its boundary transformation. On the boundary, we show the existence of anyons with non-trivial self-statistics. For the $n=2$ case, where the bulk classification is given by an integer $m$ mod 4, we show that the boundary can be gapped with double semion topological order for $m=1$ and toric code for $m=2$. The bulk ground state wavefunction amplitude is given in terms of the linking numbers of loops in the dual lattice. Our construction can be generalized to arbitrary 1-SPT protected by finite unitary symmetry.

Homological mirror symmetry (HMS) asserts that the Fukaya category of a symplectic manifold is derived equivalent to the category of coherent sheaves on the mirror complex manifold. Without suitable enlargement (split closure) of the Fukaya category, certain objects of it are missing to prevent HMS from being true. Kapustin and Orlov conjecture that coisotropic branes should be included into the Fukaya category from a physics view point. In this talk, I will construct for linear symplectic tori a version of the Fukaya category including coisotropic branes and show that the usual Fukaya category embeds fully faithfully into it. I will also explain the motivation of the construction through the perspective of Homological mirror symmetry.

We make the case that over the coming decade, computer assisted reasoning will become far more widely used in the mathematical sciences. This includes interactive and automatic theorem verification, symbolic algebra, and emerging technologies such as formal knowledge repositories, semantic search and intelligent textbooks.

After a short review of the state of the art, we survey directions where we expect progress, such as mathematical search and formal abstracts, developments in computational mathematics, integration of computation into textbooks, and organizing and verifying large calculations and proofs. For each we try to identify the barriers and potential solutions.

One of the fundamental challenges in number theory is to understand the intricate way in which the additive and multiplicative structures in the integers intertwine. We will explore a dynamical approach to this topic. After introducing a new dynamical framework for treating questions in multiplicative number theory, we will present an ergodic theorem which contains various classical number-theoretic results, such as the Prime Number Theorem, as special cases. This naturally leads to a formulation of an extended form of Sarnak’s conjecture, which deals with the disjointness of actions of (N,+) and (N,*). This talk is based on joint work with Vitaly Bergelson.

From Harvard Magazine: In Norman Juster's children’s book The Phantom Tollbooth, the land of infinity can be reached by following a line drawn on the... Read
more

Harvard senior and mathematics concentrator Natalia Pacheco-Tallaj was awarded the 2020 Alice T. Schafer prize on Thursday, January 16 by the Association for Women in... Read
more

Harvard Mathematics Department graduate student Alexander Smith, who is expected to receive his Ph.D. in 2020, was awarded the 2019 inaugural David Goss Prize in... Read
more

Confirmed speakers: Toby Colding, MIT Tristan Collins, MIT Simon Donaldson, Stony Brook University Hélène Esnault, Freie Universität Berlin Kenji Fukaya, Stony Brook University Pengfei Guan,... Read
more

Conference Poster Organizers: Laura DeMarco (Northwestern University) Sarah Koch (University of Michigan) Ronen Mukamel (Rice University) Kevin Pilgrim (Indiana University) Registration Confirmed speakers: Anton Zorich,... Read
more