We study the celestial description of the O(N) sigma model in the large N limit. Focusing on three dimensions, we analyze the implications of a UV complete, all-loop order 4-point amplitude of pions in terms of correlation functions defined on the celestial circle. We find these retain many key features from the previously studied tree-level case, such as their relation to Generalized Free Field theories and crossing-symmetry, but also incorporate new properties such as IR/UV softness and S-matrix metastable states. In particular, to understand unitarity, we propose a form of the optical theorem that controls the imaginary part of the correlator based solely on the presence of these resonances. We also explicitly analyze the conformal block expansions and factorization of four-point functions into three-point functions. We find that summing over resonances is key for these factorization properties to hold. This is a joint work with D. García-Sepúlveda, A. Guevara, J. Kulp.

The scattering equations connect two modern descriptions of scattering amplitudes: the CHY formalism and the framework of positive geometries. For theories in the CHY family whose S-matrix is captured by some positive geometry in the kinematic space, the corresponding canonical form can be obtained as the pushforward via the scattering equations of the canonical form of a positive geometry in the CHY moduli space. In this talk, I consider the general problem of pushing forward rational differential forms via the scattering equations. I will present some recent results (2206.14196) for achieving this without ever needing to explicitly solve any scattering equations. These results use techniques from computational algebraic geometry, and they extend the application of similar results for rational functions to rational differential forms.

Tensors, also known as multiway arrays, have become ubiquitous as representations for operators or as convenient schemes for storing data. Yet, when it comes to compressing these objects or analyzing the data stored in them, the tendency is to ``flatten” or ``matricize” the data and employ traditional linear algebraic tools, ignoring higher dimensional correlations/structure that could have been exploited. Impediments to the development of equivalent tensor-based approaches stem from the fact that familiar concepts, such as rank and orthogonal decomposition, have no straightforward analogues and/or lead to intractable computational problems for tensors of order three and higher.

In this talk, we will review some of the common tensor decompositions and discuss their theoretical and practical limitations. We then discuss a family of tensor algebras based on a new definition of tensor-tensor products. Unlike other tensor approaches, the framework we derive based around this tensor-tensor product allows us to generalize in a very elegant way all classical algorithms from linear algebra. Furthermore, under our framework, tensors can be decomposed in a natural (e.g. ‘matrix-mimetic’) way with provable approximation properties and with provable benefits over traditional matrix approximation. In addition to several examples from recent literature illustrating the advantages of our tensor-tensor product framework in practice, we highlight interesting open questions and directions for future research.