Scientific

The Farey sequence FQ of order Q is an ascending sequence of fractions a/b in the unit interval (0,1] such that (a,b)=1 and 0

The distribution of values of Dirichlet L-functions \(L(s, \chi)\) for variable \(χ\) has been studied extensively and has a vast literature. Moments of higher derivatives has been studied as well, by Soundarajan, Sono, Heath-Brown etc. However, the study of the same for the logarithmic derivative \(L'(s, \chi)/ L(s, \chi)\) is much more recent and was initiated by Ihara, Murty etc. In this talk we will discuss higher derivatives of the logarithmic derivative and present some new results related to their distribution and moments at s=1.

Let \(p\) be an odd prime. We study Mazur's conjecture on the growth of the Mordell--Weil ranks of an elliptic curve \(E/\mathbb{Q}\) over an imaginary quadratic field in which \(p\) splits and \(E\) has good reduction at \(p\). In particular, we obtain criteria that may be checked through explicit calculation, thus allowing for the verification of Mazur's conjecture in specific examples. This is joint work with Rylan Gajek-Leonard, Jeffrey Hatley, and Antonio Lei.

The Gromov-Wasserstein (GW) distance quantifies dissimilarity between metric measure (mm) spaces and provides a natural alignment between them. As such, it serves as a figure of merit for applications involving alignment of heterogeneous datasets, including object matching, single-cell genomics, and matching language models. While various heuristic methods for approximately evaluating the GW distance from data have been developed, formal guarantees for such approaches—both statistical and computational—remained elusive. This work closes these gaps for the quadratic GW distance between Euclidean mm spaces of different dimensions. At the core of our proofs is a novel dual representation of the GW problem as an infimum of certain optimal transportation problems. The dual form enables deriving, for the first time, sharp empirical convergence rates for the GW distance by providing matching upper and lower bounds. For computational tractability, we consider the entropically regularized GW distance. We derive bounds on the entropic approximation gap, establish sufficient conditions for convexity of the objective, and devise efficient algorithms with global convergence guarantees. These advancements facilitate principled estimation and inference methods for GW alignment problems, that are efficiently computable via the said algorithms.

It is conjectured that there is no projective plane of order 12. Balanced splittable Hadamard matrices were introduced in 2018. In 2023, it was shown that a projective plane of order 12 is equivalent to a balanced multi-splittable Hadamard matrix of order 144. There will be an attempt to show the equivalence in a way that may require little background.