Combinatorics

Explicit results about primes in Chebotarev's density theorem

Speaker: 
Habiba Kadiri
Date: 
Mon, Jan 27, 2020
Location: 
PIMS, University of Lethbridge
Conference: 
Lethbridge Number Theory and Combinatorics Seminar
Abstract: 

Let $L/K$ be a Galois extension of number fields with Galois group $G$, and let $C⊂G$ be a conjugacy class. Attached to each unramified prime ideal p in OK is the Artin symbol $\sigma p$, a conjugacy class in $G$. In 1922 Chebotarev established what is referred to his density theorem (CDT). It asserts that the number $\pi C(x)$ of such primes with $\sigma p=C$ and norm $Np≤x$ is asymptotically $\left|C\right|\left|G\right|\mathrm{Li} (x)$ as $x\rightarrow\infty$ where $\mathrm{Li} (x)$ is the usual logarithmic integral. As such, CDT is a generalisation of both the prime number theorem and Dirichlet's theorem on primes in arithmetic progressions. In light of Linnik's result on the least prime in an arithmetic progression, one may ask for a bound for the least prime ideal whose Artin symbol equals C. In 1977 Lagarias and Odlyzko proved explicit versions of CDT and in 1979 Lagarias, Montgomery and Odlyzko gave bounds for the least prime ideal in the CDT. Since 2012 several unconditional explicit results of these theorems have appeared with contributions by Zaman, Zaman and Thorner, Ahn and Kwon, and Winckler. I will present several recent results we have proven with Das, Ng, and Wong.

Class: 

Regular Representations of Groups

Speaker: 
Joy Morris
Date: 
Mon, Jan 20, 2020
Location: 
PIMS, University of Lethbridge
Conference: 
Lethbridge Number Theory and Combinatorics Seminar
CRG: 
Abstract: 

A natural way to understand groups visually is by examining objects on which the group has a natural permutation action. In fact, this is often the way we first show groups to undergraduate students: introducing the cyclic and dihedral groups as the groups of symmetries of polygons, logos, or designs. For example, the dihedral group $D_8$ of order 8 is the group of symmetries of a square. However, there are some challenges with this particular example of visualisation, as many people struggle to understand how reflections and rotations interact as symmetries of a square.

 

Every group G admits a natural permutation action on the set of elements of $G$ (in fact, two): acting by right- (or left-) multiplication. (The action by right-multiplication is given by $\left{t_g : g \in G\right}, where $t_g(h) = hg$ for every $h \in G$.) This action is called the "right- (or left-) regular representation" of $G$. It is straightforward to observe that this action is regular (that is, for any two elements of the underlying set, there is precisely one group element that maps one to the other). If it is possible to find an object that can be labelled with the elements of $G$ in such a way that the symmetries of the object are precisely the right-regular representation of $G$, then we call this object a "regular representation" of $G$.

 

A Cayley (di)graph $Cay(G,S)$ on the group $G$ (with connection set $S$, a subset of $G$) is defined to have the set $G$ as its vertices, with an arc from $g$ to $sg$ for every $s$ in $S$. It is straightforward to see that the right-regular representation of $G$ is a subset of the automorphism group of this (di)graph. However, it is often not at all obvious whether or not $Cay(G,S)$ admits additional automorphisms. For example, $Cay(Z_4, {1,3})$ is a square, and therefore has $D_8$ rather than $Z_4$ as its full automorphism group, so is not a regular representation of $Z_4$. Nonetheless, since a regular representation that is a (di)graph must always be a Cayley (di)graph, we study these to determine when regular representations of groups are possible.

 

I will present results about which groups admit graphs, digraphs, and oriented graphs as regular representations, and how common it is for an arbitrary Cayley digraph to be a regular representation.

Class: 

Combinatorial Matrices

Speaker: 
Richard A. Brualdi
Date: 
Tue, Mar 1, 2016
Location: 
PIMS, University of Manitoba
Conference: 
PIMS-UManitoba Distinguished Lecture
Abstract: 

Matrices contain combinatorial information. They may provide alternative representations of combinatorial ideas. Examples include permutation matrices as representations of permutations of a finite set, and adjacency matrices as representations of a finite graph. The linear algebraic properties of these matrices may provide useful combinatorial information, and combinatorial information about a matrix may impact its linear algebraic properties. At the same time, some combinatorial constructs are defined by matrices. A notable example is the alternating sign matrices which arise in a number of ways including from the partial order on permutations called the Bruhat order. In this talk we will explore various connections between combinatorics and matrices, combinatorial matrices.

Class: 

Sparse - Dense Phenomena

Speaker: 
Jaroslav Nesetril
Date: 
Fri, Feb 28, 2014
Location: 
PIMS, University of British Columbia
Conference: 
PIMS/UBC Distinguished Colloquium
Abstract: 

The dichotomy between sparse and dense structures is one of the profound, yet fuzzy, features of contemporary mathematics and computer science. We present a framework for this phenomenon, which equivalently defines sparsity and density of structures in many different yet equivalent forms, including effective decomposition properties. This has several applications to model theory, algorithm design and, more recently, to structural limits.

Class: 

Small Number and the Basketball Tournament

Speaker: 
Veselin Jungic
Mark Maclean
Rena Sinclair
Date: 
Tue, May 1, 2012
Location: 
Simon Fraser University, Burnaby, Canada
University of British Columbia, Vancouver, Canada
Conference: 
BIRS First Nations Math Education Workshop
Abstract: 

The mathematical context of the third story, Small Number and the Basketball Tournament, contains some basic principles of combinatorics. The plot of the story and the closing question are structured in a manner that allows the moderator to introduce the notion of permutations and combinations. Since the numbers used in the story are relatively small, this can be used to encourage the young audience to explore on their own. Mathematics is also present in the background. Small Number and his friends do mathematics after school in the Aboriginal Friendship Centre. He loves playing the game of Set and when he comes home his sister is just finishing her math homework. Small Number and his friend would like to participate in a big half-court tournament, and so on.

For more details see http://mathcatcher.irmacs.sfu.ca/content/small-number

Class: 

Lectures on Integer Partitions

Author: 
Herbert S. Wilf
Date: 
Thu, Jun 1, 2000
Location: 
University of Victoria, Victoria, Canada
Conference: 
PIMS Distinguished Chair Lectures
Abstract: 

What I’d like to do in these lectures is to give, first, a review of the classical theory of integer partitions, and then to discuss some more recent developments. The latter will revolve around a chain of six papers, published since 1980, by Garsia-Milne, Jeff Remmel, Basil Gordon, Kathy O’Hara, and myself. In these papers what emerges is a unified and automated method for dealing with a large class of partition identities.

By a partition identity I will mean a theorem of the form “there are the same number of partitions of n such that . . . as there are such that . . ..” A great deal of human ingenuity has been expended on finding bijective and analytical proofs of such identities over the years, but, as with some other parts of mathematics, computers can now produce these bijections by themselves. What’s more, it seems that what the computers discover are the very same bijections that we humans had so proudly been discovering for all of those years.

These lectures are intended to be accessible to graduate students in mathematics and computer science.

Notes: 
Subject: 
Class: