Past Events

The Bar and Cobar functors pair up to form an adjunction between the category of dg-algebras and dg-coalgebras. This adjunction can be used as a tool to provide a quasi-free resolution for any dg-algebra. We work out such a resolution for the case of...

Order convergence on a partially ordered set is a topological-like structure induced by the order, which usually fails to be an "actual" topology. However, on Boolean algebras and vector lattices this convergence satisfies the definition of a so...

We prove a new signed elementary symmetric function expansion of the chromatic quasisymmetric function of any natural unit interval graph. We then use sign-reversing involutions to prove new combinatorial formulas for melting lollipops and for K...

The Lorentz gas was originally introduced as a model for the movement of electrons in metals. It consists of a massless point particle (electron) moving through Euclidean space bouncing off a given set of scatterers $\mathcal{S}$ (atoms of the metal)...

The celebrated Erdõs similarity problem asks if it is always possible to construct a set of positive Lebesgue measure that does not contain any (nontrivial) affine copy of a given infinite set. The problem remains widely open. In this talk, I will...

Given an arbitrary probability measure $\mu$ on $PSU(1,1)$, understanding the structure of $\mu$-stationary measures is a notoriously difficult problem, in particular, due to the number of different settings one can work in. The answer is known to...

Fix $N\geq 1$ and let $L_1, L_2, \ldots, L_N$ be Dirichlet L-functions with distinct, primitive and even Dirichlet characters. We assume that these functions satisfy the same functional equation. Let $F(s)∶= c_1L_1(s)+c_2L_2(s)+\ldots+c_NL_N(s)$ be a...

In this talk, I will report on joint work in progress (with Robin Cockett and Ben MacAdam) on how the additive bundle construction (almost) equips the category Lex of lex categories with a tangent category structure. Let Lex be the category of (small...

The adjugate matrix of a graph G on n vertices, denoted by adj G, is the adjugate of xI - A, where A is the 0-1 adjacency matrix of the graph. The entries of this matrix are polynomials in the variable x, of varying degrees. We shall first outline...