BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Hermie Monterde (University of Manitoba)
DTSTART;VALUE=DATE-TIME:20240916T211500Z
DTEND;VALUE=DATE-TIME:20240916T221500Z
DTSTAMP;VALUE=DATE-TIME:20241016T075835Z
UID:NumberTheoryandCombinatorics/1
DESCRIPTION:Title: Discrete mathematics in continuous quantum walks\
nby Hermie Monterde (University of Manitoba) as part of Number Theory and
Combinatorics Seminar (NTC)\n\nAbstract: TBA\n
LOCATION:https://researchseminars.org/talk/NumberTheoryandCombinatorics/1/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Emily Quesada-Herrera (University of Lethbridge)
DTSTART;VALUE=DATE-TIME:20241007T211500Z
DTEND;VALUE=DATE-TIME:20241007T221500Z
DTSTAMP;VALUE=DATE-TIME:20241016T075835Z
UID:NumberTheoryandCombinatorics/2
DESCRIPTION:Title: On the vertical distribution of the zeros of the Riem
ann zeta-function\nby Emily Quesada-Herrera (University of Lethbridge)
as part of Number Theory and Combinatorics Seminar (NTC)\n\nAbstract: TBA
\n
LOCATION:https://researchseminars.org/talk/NumberTheoryandCombinatorics/2/
END:VEVENT
BEGIN:VEVENT
SUMMARY:Alice Lacaze-Masmonteil (University of Regina)
DTSTART;VALUE=DATE-TIME:20241021T211500Z
DTEND;VALUE=DATE-TIME:20241021T221500Z
DTSTAMP;VALUE=DATE-TIME:20241016T075835Z
UID:NumberTheoryandCombinatorics/3
DESCRIPTION:Title: Recent advances on the directed Oberwolfach problem\nby Alice Lacaze-Masmonteil (University of Regina) as part of Number Th
eory and Combinatorics Seminar (NTC)\n\n\nAbstract\nA directed variant of
the famous Oberwolfach problem\, the directed Oberwolfach problem consider
s the following scenario. Given $n$ people seated at $t$ round tables of s
ize $m_1\, m_2 \\ldots\, m_t$\, respectively\, such that $m_1+m_2+\\cdots+
m_t=n$\, does there exist a set of $n-1$ seating arrangements such that ea
ch person is seated to the right of every other person precisely once? I w
ill first demonstrate how this problem can be formulated as a type of grap
h-theoretic problem known as a cycle decomposition problem. Then\, I will
discuss a particular style of construction that was first introduced by R.
~HÃ€ggkvist in 1985 to solve several cases of the original Oberwolfach pro
blem. Lastly\, I will show how this approach can be adapted to the directe
d Oberwolfach problem\, thereby allowing us to obtain solutions for previo
usly open cases. Results discussed in this talk arose from collaborations
with Andrea Burgess\, Peter Danziger\, and Daniel Horsley.\n
LOCATION:https://researchseminars.org/talk/NumberTheoryandCombinatorics/3/
END:VEVENT
END:VCALENDAR