University of Victoria

The International Centre for Theoretical Physics (ICTP), with the financial support of PIMS, is hosting the 5th Summer School on Theory, Mechanisms and Hierarchical Modelling of Climate Dynamics: “Convection and Clouds” between the 1st and 19th July...

For a population model that encodes parent-child relations, an ordered representation is a partial or complete labelling of individuals, in order of their descendants’ long-term success in some sense, with respect to which the ancestral structure is...

In Graph Theory, the well-known problems of packing and independence are generalized by broadcast packing and broadcast independence. As an analogy, placing cell towers (of various powers) in a network so that the signals do not interfere is a...

In this talk we consider the oriented colouring problem for graphs with bounded Euler genus. That is we consider the smallest $k$ such that all oriented graphs embeddable on surfaces of Euler genus at most $g$ necessarily have an oriented...

Lifting theorems have played a key role in many recent breakthrough results in diverse areas of theoretical cs and mathematics via simple yet profound connections between these areas and communication complexity. A typical lifting theorem translates...

The word complexity function p(n) of a subshift X measures the number of n-letter words appearing in sequences in X, and X is said to have linear complexity if p(n)/n is bounded. It's been known since work of Ferenczi that linear word complexity...

Let q=1 mod 4 be a prime power and let F_q be the finite field of q elements. The Paley graph of order q is the graph with vertex set F_q, such that two vertices are adjacent if and only if their difference is a square in F_q. Paley graphs play an...

Since suggested by Tur\'an in 1941, determining the Tur\'an density of hypergraphs has been a notoriously difficult problem at the center of extremal combinatorics. Subsequently, several natural variants of this problem have been suggested, most...

Suppose a graph G has list chromatic number k. It is easy to see that if L is a (k+1)-list assignment for G, then G admits two L-colourings f and g where f(v) =/= g(v) for every vertex v in the graph. But what if we want still more disjoint L...

We consider an arbitrary sequence of d*d matrices (A_n) of norm at most 1 and subject them to noiselike perturbations of size epsilon. We show that the perturbed system has simple Lyapunov spectrum (no repeated exponents) and discuss universal bounds...