Past Events

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...

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...

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...

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...

Motivated by an application in the routing of technicians at a French public utility, we introduce a highly efficient heuristic together with a branch-price-and-cut algorithm for the doubly open park-and-loop routing problem. This problem is an...

The eccentricity matrix ε(G) of a connected graph G is obtained from the distance matrix of G by keeping the largest nonzero entries in each row and each column, and leaving zeros in the remaining ones. The eigenvalues of ε(G) are the ε-eigenvalues...