Past Events

When experiencing an ambiguous sensory stimulus (e.g., the vase-faces image), subjects may report random alternations (time scale, seconds) between the possible interpretations. I will describe dynamical models with multiple time scales for neuronal...

In 1944, Linnik showed that the least prime in an arithmetic progression given by a mod q for (a,q)=1 is at most cq^L for some absolutely computable constants c and L. A lot of work has gone in computing explicit bounds for c and L. The best known...

We consider covering graphs obtained by lifting trees as voltage graphs over cyclic groups. We generalize a tool of Hell, Nishiyama, and Stacho, known as the billiard strategy, for constructing Hamiltonian cycles in the covering graphs of paths. The...

Abstract: Constructing and training the neural network depends on various types of Stochastic Gradient Descent (SGD) methods, with adaptations that help with convergence by boosting the speed of the gradient search. Convergence for existing...

Given a target distribution \(pi\) and an arbitrary Markov infinitesimal generator \(L\) a finite state space \(chi\), in this talk we develop three structured and inter-related approaches to generate new reversiblizations from \(L\). The first...

Isogeometric analysis (IGA) has been recently developed to build a bridge between geometric computer-aided design and PDE analysis. In IGA, spline functions used for geometric domain descriptions are also used to discretize PDE problems on such...

Consider all shifts of finite type constrained by a condition on the forbidden set, e.g. only allowing a single forbidden word of fixed length. Which such shifts have the minimum/maximum possible entropy? Among all binary shifts forbidding a single...

Habitat loss is a key component driving decreases in biodiversity and the extinction of species worldwide. Of particular concern is human-driven habitat loss, primarily through agriculture, resource extraction, and urbanization. In this talk, I will...

Elliptic curve isogeny path finding has many applications in number theory and cryptography. For supersingular curves, this problem is known to be easy when one small endomorphism or the entire endomorphism ring are known. Unfortunately, computing...