# Seminar

##### Filters:

## Combinatorics Seminar – Oct 29, 2021

29 October 2021, 2:30pm, Zoom Speaker: Marcelo Sales (Emory)Title: ‘Ramsey and Density Results for Approximate Arithmetic Progressions’ Abstract: Let AP_k = {a,a+d,…,a+(k−1)d} be an arithmetic progression of length k. For a given ε > 0, we call a set AP_k(ε) = {x0,…,xk−1} an ε-approximate arithmetic progression of length k if for some a and d, |xi −(a+id)|<εd...

## Rings and Modules Seminar – Oct. 19

19 October 2021, 2:40 pm, Zoom Speaker: Ranganathan Padmanabhan (University of Manitoba)Title: ‘Hungtington Varieties’ Abstract: A variety KK of lattices is called Huntington if every uniquely complemented lattice in KK is distributive. In 1904, E.V. Huntington conjectured that every uniquely complemented lattice was distributive. In fact, the conjecture had been verified for several special classes of lattices. However, in 1945, Dilworth...

## Combinatorics Seminar – Oct 22, 2021

22 October 2021, 3:30 pm (note the unusual time!), Zoom Speaker: Kyle Murphy (Dakota State)Title: Maximizing Five Cycles in K_r-free Subgraphs Abstract: Recently, Palmer and Gerbner defined the term $F$-Tur\’an Good to describe a graph $H$ which is unique maximized by the Tur\’an graph for all sufficiently large $F$-free graphs. Along with Bernard Lick\’y we...

## Combinatorics Seminar – Oct 15, 2021

15 October 2021, 2:30 pm, Zoom Speaker: Hermie Monterde (Manitoba, Math)Title: Continuous-Time Quantum Walks and Twin Vertices Abstract:Undirected graphs are used to model quantum spin networks, with the vertices and edges representing the qubits and their interactions, respectively. Each of these qubits has an associated quantum state that contains information, and in order to construct an...

## Rings and Modules Seminar – Oct. 5

5 October 2021, 2:40 pm, Zoom Speaker: Raqeeb Rasheed (University of Manitoba)Title: Resultant-Based Methods for Skew Elimination Abstract: This talk is about resultant-based methods for elimination of indeterminates of skew polynomial systems. We define the concept of resultant for bivariate skew polynomials via Dieudonné determinant and then applying a modular technique to improve the efficiency...

## Combinatorics Seminar – Oct 1, 2021

1 October 2021, 2:30 pm, Zoom Speaker: Shahin Kamali (Manitoba, CS)Title: Algorithms for Burning Graph Families Abstract: Graph burning is a simple model for the spread of social influence in networks. The objective is to measure how quickly a “fire”, e.g., a piece of fake news, can be spread in a network. The burning process takes place in...

## Combinatorics Seminar – Sept 24, 2021

24 September 2021, 2:30 pm, Zoom Speaker: Christopher van Bommel (Manitoba, Math)Title: ‘Fidelity of Quantum State Transfer on Paths with Potentials’ Abstract: Quantum computing is believed to provide many advantages over traditional computing, particularly considering the speed at which computations can be performed. One of the challenges that needs to be resolved in order to construct a quantum...