Past Events

Let q≡1(mod4) be a prime power and Fq be the finite field with q elements. Let 1/2σ1 be fixed. We consider D a monic square-free polynomial in Fq[T] and χD the Kronecker symbol associated with D. In this talk, we will discuss the distribution of...

How to approximate intractable integrals? This is an old problem which is still a pain point in many disciplines (including mine, Bayesian inference, but also statistical mechanics, computational chemistry, combinatorics, etc). The vast majority of...

The aim of structured optimization is to assemble a solution, using a given set of atoms, to fit a model to data. Polarity, which generalizes the notion of orthogonality from linear sets to general convex sets, plays a special role in a simple and...

We develop a dynamic programming methodology that seeks to maximize investor outcomes over multiple, potentially competing goals (such as upgrading a home, paying college tuition, or maintaining an income stream in retirement), even when financial...

Please note that this event will be rescheduled after UNBC's Faculty Association returns to work. Many systems exhibit a digit bias. For example, the first digit base 10 of the Fibonacci numbers or of 2n equals 1 about 30% of the time; the IRS uses...

Starting from a sequence of positive real numbers (w_n), which we call weights, we construct a tree in a recursive manner: at time 1, the tree has only one vertex. Then at any step n+1, we add a new vertex to the tree and we choose its parent at...

A major challenge in mathematical analysis of infectious diseases is that the epidemic process is usually only partially observed. Although we might be able to identify when an individual became symptomatic, rarely can we observe when infection began...

We will attempt, in a colloquium-like fashion, to introduce the basic concepts of quantum mechanics and functional analysis necessary to derive the connection between twisted equivariant K-theory of a d-1 dimensional torus and quasi-adiabatic...

The classical Erdos-Ko-Rado theorem in extremal combinatorics states the following: Given a family F of k-subsets of an n-set that is "pairwise intersecting" (meaning A \cap B \neq \emptyset for all A,B in F) it follows that F can be no larger than...

In number theory and diophantine geometry, the theory of "heights" is essential in studying finiteness questions. Roughly, they capture the "arithmetic complexity" of the object of study. We give a formula relating various notions of heights of...