L5

The preferential attachment model is a natural and popular random graph model for a growing network that contains very well-connected ``hubs''. Despite intense interest in the higher-order connectivity of these networks, their Betti numbers at higher dimensions have been largely unexplored.

In this talk, after a brief survey on random topology, we study the clique complexes of preferential attachment graphs, and we prove the asymptotics of the expected Betti numbers. If time allows, we will briefly discuss their homotopy connectedness as well. This is joint work with Gennady Samorodnitsky, Christina Lee Yu and Rongyi He, and it is based on the preprint https://arxiv.org/abs/2305.11259

In topological data analysis, persistence barcodes record the
persistence of homological generators in a one-parameter filtration
built on the data at hand. In contrast, computing the pointwise Euler
characteristic (EC) of the filtration merely records the alternating sum
of the dimensions of each homology vector space.

In this talk, we will show that despite losing the classical
"signal/noise" dichotomy, EC tools are powerful descriptors, especially
when combined with new integral transforms mixing EC techniques with
Lebesgue integration. Our motivation is fourfold: their applicability to
multi-parameter filtrations and time-varying data, their remarkable
performance in supervised and unsupervised tasks at a low computational
cost, their satisfactory properties as integral transforms (e.g.,
regularity and invertibility properties) and the expectation results on
the EC in random settings. Along the way, we will give an insight into
the information these descriptors record.

This talk is based on the work [https://arxiv.org/abs/2111.07829] and
the joint work with Olympio Hacquard [https://arxiv.org/abs/2303.14040].

Various constructions relevant to practical problems such as clustering and graph classification give rise to multiparameter persistence modules (MPPM), that is, linear representations of non-totally ordered sets. Much of the mathematical interest in multiparameter persistence comes from the fact that there exists no tractable classification of MPPM up to isomorphism, meaning that there is a lot of room for devising invariants of MPPM that strike a good balance between discriminating power and complexity of their computation. However, there is no consensus on what type of information we want these invariants to provide us with, and, in particular, there seems to be no good notion of “global” or “high persistence” features of MPPM.

With the goal of substantiating these claims, as well as making them more precise, I will start with an overview of some of the known invariants of MPPM, including joint works with Bauer and Oudot. I will then describe recent work of Bjerkevik, which contains relevant open questions and which will help us make sense of the notion of global feature in multiparameter persistence.

Let w(x_1,...,x_r) be a word in a free group. For any group G, w induces a word map w:G^r-->G. For example, the commutator word w=xyx^(-1)y^(-1) induces the commutator map. If G is finite, one can ask what is the probability that w(g_1,...,g_r)=e, for a random tuple (g_1,...,g_r) of elements in G.

In the setting of finite simple groups, Larsen and Shalev showed there exists epsilon(w)>0 (depending only on w), such that the probability that w(g_1,...,g_r)=e is smaller than |G|^(-epsilon(w)), whenever G is large enough (depending on w).

In this talk, I will discuss analogous questions for compact groups, with a focus on the family of unitary groups; For example, given r independent Haar-random n by n unitary matrices A_1,...,A_r, what is the probability that w(A_1,...,A_r) is contained in a small ball around the identity matrix?

Based on a joint work with Nir Avni and Michael Larsen.  

The two-colored Temperley-Lieb algebra is a generalization of the Temperley-Lieb algebra. The analogous two-colored Jones-Wenzl projector plays an important role in the Elias-Williamson construction of the diagrammatic Hecke category. In this talk, I will give conditions for the existence and rotatability of the two-colored Jones-Wenzl projector in terms of the invertibility and vanishing of certain two-colored quantum binomial coefficients. As a consequence, we prove that Abe’s category of Soergel bimodules is equivalent to the diagrammatic Hecke category in complete generality.

 

The proximal Galerkin finite element method is a high-order, nonlinear numerical method that preserves the geometric and algebraic structure of bound constraints in infinitedimensional function spaces. In this talk, we will introduce the proximal Galerkin method and apply it to solve free-boundary problems, enforce discrete maximum principles, and develop scalable, mesh-independent algorithms for optimal design. The proximal Galerkin framework is a natural consequence of the latent variable proximal point (LVPP) method, which is an stable and robust alternative to the interior point method that will also be introduced in this talk.

In particular, LVPP is a low-iteration complexity, infinite-dimensional optimization algorithm that may be viewed as having an adaptive barrier function that is updated with a new informative prior at each (outer loop) optimization iteration. One of the main benefits of this algorithm is witnessed when analyzing the classical obstacle problem. Therein, we find that the original variational inequality can be replaced by a sequence of semilinear partial differential equations (PDEs) that are readily discretized and solved with, e.g., high-order finite elements. Throughout the talk, we will arrive at several unexpected contributions that may be of independent interest. These include (1) a semilinear PDE we refer to as the entropic Poisson equation; (2) an algebraic/geometric connection between high-order positivity-preserving discretizations and an infinite-dimensional Lie group; and (3) a gradient-based, bound-preserving algorithm for two-field density-based topology optimization.

The complete latent variable proximal Galerkin methodology combines ideas from nonlinear programming, functional analysis, tropical algebra, and differential geometry and can potentially lead to new synergies among these areas as well as within variational and numerical analysis. This talk is based on [1].

Keywords: pointwise bound constraints, bound-preserving discretization, entropy regularization, proximal point

Mathematics Subject Classifications (2010): 49M37, 65K15, 65N30

References  [1] B. Keith, T.M. Surowiec. Proximal Galerkin: A structure-preserving finite element method for pointwise bound constraints arXiv preprint arXiv:2307.12444 2023.

Brown University Email address: @email

Simula Research Laboratory Email address: @email

I will report on current work in progress on the construction of anticyclotomic p-adic L-functions for Rankin--Selberg products. I will explain how by p-adically interpolating the branching law for the spherical pair (U(n)xU(n+1), U(n)) we can construct a p-adic L-function attached to cohomological automorphic representations of U(n) x U(n+1), including anticyclotomic variation. Due to the recent proof of the unitary Gan--Gross--Prasad conjecture, this p-adic L-function interpolates the square root of the central L-value. Time allowing, I will explain how we can extend this result to the Coleman family of an automorphic representation.

This talk will cover the greatest hits of pointwise ergodic theory, beginning with Birkhoff's theorem, then Bourgain's work, and finishing with more modern directions.

Is there a partition of the natural numbers into finitely many pieces, none of which contains a Pythagorean triple (i.e. a solution to the equation x²+y²=z²)? This is one of the simplest questions in arithmetic Ramsey theory which is still open. I will present a recent partial result, showing that in any finite partition of the natural numbers there are two numbers x,y in the same cell of the partition, such that x²+y²=z² for some integer z which may be in a different cell. 

The proof consists, after some initial maneuvers inspired by ergodic theory, in controlling the behavior of completely multiplicative functions along certain quadratic polynomials. Considering separately aperiodic and "pretentious" functions, the last major ingredient is a concentration estimate for functions in the latter class when evaluated along sums of two squares.

The talk is based on joint work with Frantzikinakis and Klurman.

In this talk, we present an algorithm to compute p-adic heights on hyperelliptic curves with good reduction. Our algorithm improves a previous algorithm of Balakrishnan and Besser by being considerably simpler and faster and allowing even degree models. We discuss two applications of our work: to apply the quadratic Chabauty method for rational and integral points on hyperelliptic curves and to test the p-adic Birch and Swinnerton-Dyer conjecture in examples numerically. This is joint work with Steffen Müller.