Georgia Institute of Technology College of Sciences

We will describe an elegant construction of potential counterexamples to the Smooth 4-Dimensional Poincaré Conjecture whose input is a fibered, homotopy-ribbon knot in the 3-sphere. The construction also produces links that are potential counterexamples to the Generalized Property R Conjecture, as well as balanced presentations of the trivial group that are potential counterexamples to the Andrews-Curtis Conjecture. We will then turn our attention to generalized square knots (connected sums of torus knots with their mirrors), which provide a setting where the potential counterexamples mentioned above can be explicitly understood. Here, we show that the constructed 4-manifolds are diffeomorphic to the 4-sphere; but the potential counterexamples to the other conjectures persist. In particular, we present a new, large family of geometrically motivated balanced presentations of the trivial group. Along the way, we give a classification of fibered, homotopy-ribbon disks bounded by generalized square knots up to isotopy and isotopy rel-boundary. This talk is based on joint work with Alex Zupan.

Assemblies are subsets of neurons whose coordinated excitation is hypothesized to represent the subject's thinking of an object, idea, episode, or word. Consequently, they provide a promising basis for a theory of how neurons and synapses give rise to higher-level cognitive phenomena. The existence (and pivotal role) of assemblies was first proposed by Hebb, and has since been experimentally confirmed, as well as rigorously proven to emerge in the model of computation in the brain recently developed by Papadimitriou & Vempala. In light of contemporary studies which have documented the creation and activation of sequences of assemblies of neurons following training on tasks with sequential decisions, we study here the brain's mechanisms for working with sequences in the assemblies model of Papadimitriou & Vempala.  We show that (1) repeated presentation of a sequence of stimuli leads to the creation of a sequence of corresponding assemblies -- upon future presentation of any contiguous sub-sequence of stimuli, the corresponding assemblies are activated and continue until the end of the sequence; (2) when the stimulus sequence is projected to two brain areas in a "scaffold", both memorization and recall are more efficient, giving rigorous backing to the cognitive phenomenon that memorization and recall are easier with scaffolded memories; and (3) existing assemblies can be quite easily linked to simulate an arbitrary finite state machine (FSM), thereby capturing the brain's ability to memorize algorithms. This also makes the assemblies model capable of arbitrary computation simply in response to presentation of a suitable stimulus sequence, without explicit control commands. These findings provide a rigorous, theoretical explanation at the neuronal level of complex phenomena such as sequence memorization in rats and algorithm learning in humans, as well as a concrete hypothesis as to how the brain's remarkable computing and learning abilities could be realized.

Joint work with Christos Papadimitriou and Santosh Vempala.

In the past few decades the problem of reconstructing high-dimensional functions taking values in abstract spaces from limited samples has received increasing attention, largely due to its relevance to uncertainty quantification (UQ) for computational science and engineering. These UQ problems are often posed in terms of parameterized partial differential equations whose solutions take values in Hilbert or Banach spaces. Impressive results have been achieved on such problems with deep learning (DL), i.e. machine learning with deep neural networks (DNN). This work focuses on approximating high-dimensional smooth functions taking values in reflexive and typically infinite-dimensional Banach spaces. Our novel approach to this problem is fully algorithmic, combining DL, compressed sensing, orthogonal polynomials, and finite element discretization. We present a full theoretical analysis for DNN approximation with explicit guarantees on the error and sample complexity, and a clear accounting of all sources of error. We also provide numerical experiments demonstrating the efficiency of DL at approximating such high-dimensional functions from limited data in UQ applications.