Previous Conferences & Workshops

Matrix powering, and more generally iterated matrix multiplication, is a fundamental linear algebraic primitive with myriad applications in computer science. Of particular interest is the problem’s space  complexity as it constitutes the main route...

While conducting a series of number-theoretic machine learning experiments, He, Lee, Oliver, and Pozdnyakov noticed a curious oscillation in the averages of Frobenius traces of elliptic curves over Q.  If one computes the average value of a_p(E) for...

Suppose that $\Sigma \subset \mathbb{C}$ is compact and symmetric about the real axis and is a finite union of rectangles and real intervals with transfinite diameter $d_{\Sigma}>1$. Suppose that $\mu$ is a $H$ older arithmetic probability...

In a recent machine learning based study, He, Lee, Oliver, and Pozdnyakov observed a striking oscillating pattern in the average value of the P-th Frobenius trace of elliptic curves of prescribed rank and conductor in an interval range. Sutherland...

In this talk, we will discuss the computation of motivic stable homotopy groups and their applications in classical computations. Specifically, we will discuss an example of complex motivic applications in classical theory, the Adams spectral...

In 1976, Gérard Rauzy proved a characterization of deterministic numbers: y is deterministic iff for any normal number x, x+y is also normal. During my lecture I willdiscuss  how normal and deterministic numbers behave under arithmetic operations. ...

In its dynamical formulation, the Furstenberg—Sárközy theorem states that for any invertible measure-preserving system $(X, \mu, T)$, any set $A \subseteq X$ with $\mu(A) > 0$, and any integer polynomial $P$ with $P(0) = 0$,
$$c(A) = \lim_{N-M \to...