Events Search and Views Navigation
October 2024
Atlantic Graph Theory Seminar
Speaker #1: Peter Collier, Dalhousie University Title #1: Zero Forcing on Twisted Hypercubes Abstract #1: The hypercube stands out as a compelling and versatile structure that extends the geometric notion of a cube into higher dimensions. We study the twisted hypercube variant in an attempt to optimize processes on similarly degree-regular, highly connected graphs. The particular process we optimize is zero forcing, a graph infection process in which a particular colour change rule is iteratively applied to the graph and an…
Find out more »Atlantic Graph Theory Seminar
Some problems on graph sequences David Galvin, University of Notre Dame I'll talk about some problems concerning unimodality (or otherwise) of some graph sequences that come from enumeration. The focus will be on the matching sequence, the independent set sequence and the domination sequence of a graph. As well as mentioning some recent work (with Ball, Hyry, Taylor and Weingartner, and with Zhang), I'll describe some favorite open problems. Zoom link: https://us02web.zoom.us/j/86861499971?pwd=rTDAaju0TCu24asnaBGvkuNlT11KZ1.1 Meeting ID: 868 6149 9971 Passcode: 325258
Find out more »November 2024
Atlantic Graph Theory Seminar
On the two table case of the directed Oberwolfach problem Speaker: Alice Lacaze-Masmonteil, University of Regina A directed variant of the famous Oberwolfach problem, the directed Oberwolfach problem considers the following scenario. Given n people seated at t round tables of size m1,m2 . . . ,mt , respectively, such that m1+m2+· · ·+mt = n, does there exist a set of n−1 seating arrangements such that each person is seated to the right of every other person precisely once?…
Find out more »Atlantic Graph Theory Seminar
Speaker: Iain Beaton, Acadia University Title: Reconfiguring minimal dominating sets under a generalization of token sliding Abstract: A dominating set S in a graph is a subset of vertices such that every vertex is either in S or adjacent to a vertex in S. A minimal dominating set M is a dominating set such that M −v is not a dominating set for all v ∈ M. In this talk we introduce a reconfiguration graph R(G) for minimal dominating sets…
Find out more »University of New Brunswick Data Challenge 2024
The UNB Data Challenge 2024 will be the 9th iteration of the nationwide competition on Nov. 29, 2024, in a virtual format. Take up the challenge and demonstrate the power of data. Participants and teams will be able to showcase their ability to tell a story driven by data in unique competitive formats. It is an ideal setting for citizens to get engaged, meet leaders in academia, government, and private organizations, and explore the world of data science.
Find out more »December 2024
AARMS Doctoral Thesis Award Winner Seminar
A tangent category approach to operadic geometry Marcello Lanfranchi December 19, 2024 @ 1:30pm Abstract: A tangent category consists of a collection of abstract objects equipped with a structure, called a tangent structure, which makes those abstract objects into locally linear geometric spaces. In my thesis, I introduced and studied a list of geometric theories from the perspective of tangent category theory. In particular, I showed that each (opposite) category of algebras, such as associative, commutative, or Lie algebras, comes equipped with a tangent structure…
Find out more »January 2025
Atlantic Graph Theory Seminar
Speakers: Prangya Parida, U. Ottawa, and Kiara McDonald, U. Victoria Zoom link: https://us02web.zoom.us/j/86415230827?pwd=QUxLUnlMdWYzL05zSUJ4bnBCOUJnZz09 --------------------------------------------------- Prangya Parida: Title: Cover-free families on graphs Abstract: A family of subsets of a t-set is called a d-cover-free family if no subset is contained in the union of any d other subsets. We denote by t(d, n) the minimum t for which there exists a d-cover-free family of a t-set with n subsets. Cover-free families (CFF) have wide applications in combinatorial group testing, where a d-CFF(t, n) can be…
Find out more »Atlantic Graph Theory Seminar
Ramsey numbers of signed graphs Ben Seamone, Dawson College and Université de Montréal Abstract: Nathan Acheampong (Université de Montréal) Francis Clavette (Université de Montréal) Geˇna Hahn (Université de Montréal) Margaux Marseloo (Université Paris-Saclay) Viktor Paardekooper (Université de Montréal), and Ben Seamone* (Dawson College & Université de Montréal) A signed graph is a pair (G, σ) where G = (V,E) is a graph and σ : E(G) → {+, −} is a signature which assigns a sign to each edge of G. One well-studied operation on…
Find out more »Combinatorial Algebra meets Algebraic Combinatorics 22nd annual workshop
The Combinatorial Algebra meets Algebraic Combinatorics (CAAC) workshop is an annual meeting taking place in Canada since 2004, with a focus on the continuously evolving interactions between combinatorial algebra and algebraic combinatorics. These meetings provide a strong connection between the two communities and help with the development of these fields. Historically, the CAAC meetings provided opportunities for graduate students, postdoctoral fellows, and early career researchers to present their work, learn about new research directions in related fields, and establish future…
Find out more »Atlantic Graph Theory Seminar
Switching m-edge coloured graphs Speaker: Gary MacGillivray, University of Victoria Abstract: An m-edge-coloured graph consists of a set of vertices, any two of which are either joined by an edge of one of m colours or not joined at all. The operation of switching at a vertex v of an m-edge-coloured graph with respect to an element of a subgroup \Gamma of S_m permutes the colours of the edges incident with v. Switching defines an equivalence relation on the set…
Find out more »