University of Manitoba

In a reconfiguration problem, the goal is to change an initial configuration of some structure to a final configuration using some limited set of moves. Examples include: sorting a list by swapping pairs of adjacent elements; finding the edit...

How social traits evolve remains an open question in evolutionary biology. Two traits of particular interest are altruism (where an individual incurs a cost to help others) and spite (where an individual incurs a cost to harm others). Both traits...

There have been several recent outbreaks of cholera (for example, in Haiti and Yemen), which is a bacterial disease caused by the bacterium Vibrio cholerae. It can be transmitted to humans directly by person-to-person contact or indirectly via...

The 46th edition of the Canadian Operator Symposium (COSy) will take place at the University of Manitoba in Winnipeg, and we invite the participation of mathematicians working in operator algebras, operator theory and related fields. The meeting will...

The intersection of graph searching and probabilistic methods is a new topic within graph theory, with applications to graph searching problems such as the game of Cops and Robbers and its many variants, Firefighting, graph burning, and acquaintance...

Depth functions were developed to extend the univariate notions of median, quantiles, ranks, signs, and order statistics to the setting of multivariate data. Whereas a probability density function measures local probability weight, a depth function...

What: Keynote Speaker, panel discussion, breakout workshops on various math education topics at all levels, and a time to mix and mingle with refreshments. Panel Discussion by: Ian Donnelly, Mathematics Consultant, Manitoba Education and Training...

Non--isomorphic graphs with isomorphic canonical double cover (CDC) have the same number of walks of arbitrary length from corresponding vertices of the same degree. The total number of walks, for a specific length, depends only on the main...

An interesting question in spectral graph theory is about the structure of the eigenvectors of matrices associated with graphs. A graph is weakly Hadamard diagonalizable (WHD) if its Laplacian matrix L can be diagonalized with a weakly Hadamard...

For r ≥ 1, a graph has r-friendship property if every pair of vertices has exactly r common neighbours. The motivation for this definition is from the friendship theorem, which is on the graphs with 1-friendship property. The friendship theorem...