Past Events

Discrete quantum walks are motivated by search problems. One of the best known quantum algorithms, Grover’s search, is a discrete quantum walk on the complete graph with loops. From an algebraic perspective, a discrete quantum walk is determined by a...

Probabilistic zero-forcing can be thought of as a model for rumour spreading, where a person is more likely to spread a rumour if several of their friends already believe it. We start with a graph that has one infected vertex. At each time step an...

Nonsmoothness and nonconvexity are significant challenges in large-scale optimization problems, such as training neural networks and solving inverse problems in computational imaging. Although first-order methods are commonly used to address these...

The Cobordism Hypothesis, as proposed by Baez and Dolan in 1995, provides a classification of n-extended Topological Quantum Field Theories (TQFTs). A n-extended TQFT is a symmetric monoidal n-functor from the n-category of cobordisms to an arbitrary...

For a finite set X, a family F of subsets of X is said to be increasing if any set A that contains B in F is also in F. The p-biased product measure of F increases as p increases from 0 to 1, and often exhibits a drastic change around a specific...

The nonlinear incidence mechanism is a more general disease transmission mechanism to fit the data in clinical observations or laboratory experiments. In a heterogeneous environment, how to describe the cognitive dispersal of individuals is also an...

For a noisy channel, the stationary capacity is the supremum of information rates achievable by stationary input processes. The Markov capacity of a given order is the supremum of information rates achievable by stationary Markov input processes of...

We will discuss a graph that encodes the divisibility properties of integers by primes. We prove that this graph has a strong local expander property almost everywhere. We then obtain several consequences in number theory, beyond the traditional...

The first cotangent cohomology module $T^1$ describes the first order deformations of a commutative ring. For Stanley-Reisner rings, this module has a purely combinatorial description: its multigraded components are given as the relative cohomology...

Residue calculus is, of course, a very powerful way to evaluate many different kinds of integrals. For multivariate integrals, however, it may get really cumbersome, to the point that one sometimes gets stuck in purely combinatorial complexity. I...