Mānoa Seminar Series in Machine Learning and Computational Neuroscience

Mānoa Seminar Series in Machine Learning and Computational Neuroscience

The $\Sigma^0_3$-completeness of the problem of subdirect irreducibility of an algebra.

Title: Renault’s Equivalence Theorem for $C^*$-Algebras of Étale Groupoids Abstract: The main goal of the talk is to relay the methods of our proof which shows that Morita equivalence of locally compact Hausdorff étale groupoids[...]

Title: Monoidal Computer

Mānoa Seminar Series in Machine Learning and Computational Neuroscience

Zeros of entire functions represented by Fourier transforms This talk will explore the properties of kernels that have Fourier transforms that are real entire functions with only real zeros. With the aid of the Mellin[...]

A LOOK AT SOME FAMILIES OF GEOMETRIES AND THEIR LATTICES OF FLATS We look at a family of geometries of a particularly simple type. We then consider the lattices of flats of these geometries. Since[...]

Mānoa Seminar Series in Machine Learning and Computational Neuroscience

Speaker: Thomas Strohmer (UC Davis) Title: Phase retrieval, random matrices, and convex optimization Abstract: Phase retrieval is the century-old problem of reconstructing a function, such as a signal or image, from intensity measurements, typically from[...]

American option pricing and optimal stopping for success runs We study some properties of the American derivative security price, for which the payoff is the length of the current run of heads. We discuss the[...]

I plan to give a couple of talks, the number depending on interest, on a paper of George Csordas, “Fourier transforms and the Riemann $\xi$-function”. George shows that the Riemann hypothesis is equivalent to a[...]