Topology seminars

Seth Koren shows how global symmetry structure and field-space topology affect particle-physics predictions beyond the usual analysis of small field fluctuations. Different possible global forms of the Standard Model gauge group imply different model-independent predictions for fractionally charged particles. Collider searches for these particles could identify the gauge-group structure and exclude unification models. The talk then examines axion theories, using the DFSZ model to show how the global properties of scalar fields and gauge symmetries modify axion strings and can resolve the cosmological domain-wall problem.

Egor Shelukhin presents cases of the Hilbert–Smith conjecture for group actions by homeomorphisms with symplectic structure. The results exclude faithful actions of the additive p-adic group in this setting and give additional restrictions on group actions in symplectic topology. The argument combines a new approach to these action problems with power operations in Floer cohomology and quantitative methods in symplectic topology.

Neural activity in many sensory systems is organized on low-dimensional manifolds by means of convex receptive fields. Neural codes in these areas are constrained by this organization, as not every neural code is compatible with convex receptive fields. The same codes are also constrained by the structure of the underlying neural network. In my talk I will attempt to provide answers to the following natural questions: (i) How do recurrent circuits generate codes that are compatible with the convexity of receptive fields? (ii) How can we utilize the constraints imposed by the convex receptive field to understand the underlying stimulus space. To answer question (i), we describe the combinatorics of the steady states and fixed points of recurrent networks that satisfy the Dale’s law. It turns out the combinatorics of the fixed points are completely determined by two distinct conditions: (a) the connectivity graph of the network and (b) a spectral condition on the synaptic matrix. We give a characterization of exactly which features of connectivity determine the combinatorics of the fixed points. We also find that a generic recurrent network that satisfies Dale's law outputs convex combinatorial codes. To address question (ii), I will describe methods based on ideas from topology and geometry that take advantage of the convex receptive field properties to infer the dimension of (non-linear) neural representations. I will illustrate the first method by inferring basic features of the neural representations in the mouse olfactory bulb.

Self-organization is a universal concept spanning numerous disciplines including mathematics, physics and biology. Chromosomes are self-organizing polymers that fold into orderly, hierarchical and yet dynamic structures. In the past decade, advances in experimental biology have provided a means to reveal information about chromosome connectivity, allowing us to directly use this information from experiments to generate 3D models of individual genes, chromosomes and even genomes. In this talk I will present a novel data-driven modeling approach and discuss a number of possibilities that this method holds. I will discuss a detailed study of the time-evolution of X chromosome inactivation, highlighting both global and local properties of chromosomes that result in topology-driven dynamical arrest and present and characterize a novel type of motion we discovered in knots that may have applications to nanoscale materials and machines.

In this talk, I’ll introduce the formal concept of a (pre)sheaf as data attached to a topological space. Sheaves capture the notion of patching local sources of information to form a global whole, e.g., the binding of visual features such as colour and shape. The formal theory appears to be closely related to the foundational properties asserted by the Information Integration Theory (IIT) for phenomenology. A comparison is intended to engender discussion on ways that phenomenology may benefit from a sheaf theory, or (more generally) a category theory approach.

Entorhinal grid cells, so-called because of their hexagonally tiled spatial receptive fields, are organized in modules which, collectively, are believed to form a population code for the animal’s position. Here, we apply topological data analysis to simultaneous recordings of hundreds of grid cells and show that joint activity of grid cells within a module lies on a toroidal manifold. Each position of the animal in its physical environment corresponds to a single location on the torus, and each grid cell is preferentially active within a single “field” on the torus. Toroidal firing positions persist between environments, and between wakefulness and sleep, in agreement with continuous attractor models of grid cells.

Rigidity is the ability of a system to resist imposed stresses before ultimately undergoing failure. However, disordered materials often contain both rigid and floppy subregions that complicate the utility of taking system-wide averages. I will talk about 3 frameworks capable of connecting the internal structure of disordered materials to their rigidity and/or failure under loading, and describe how my collaborators and I have applied these frameworks to laboratory data on laser-cut lattices and idealized granular materials. These are, in order of increasing physics content: (1) centrality within an adjacency matrix describing its connectivity, (2) Maxwell constraint counting on the full network of frictional contact forces, and (3) the vibrational modes of a synthetic dynamical matrix (Hessian). The first two rely primarily on topology, and the second two contrast the utility of considering interparticle forces (Coulomb failure) vs. the energy landscape. All three methods, while successfully elucidating the origins of rigidity and brittle vs. ductile failure, also provide interesting counterpoints regarding how much information is enough to make predictions.

The dream of programmable matter is to create materials whose physical properties (shape, moduli, response to perturbations, etc.) can be changed on the fly. For many years, my group has been thinking about how to program flat sheets that fold up into three dimensional shapes, most recently by exploiting the principles of origami design. Unfortunately, a combinatorial explosion of folding pathways makes robust folding particularly challenging. In this talk, I will discuss how this pluripotency arises from the topology of the configuration space. This suggests a broader understanding of a larger class of materials spanning from folding forms to spring networks to mechanical structures that perform computational logic.