BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Drupal iCal API//EN
X-WR-CALNAME:Events items teaser
X-WR-TIMEZONE:America/Toronto
BEGIN:VTIMEZONE
TZID:America/Toronto
X-LIC-LOCATION:America/Toronto
BEGIN:DAYLIGHT
TZNAME:EDT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
DTSTART:20260308T070000
END:DAYLIGHT
BEGIN:STANDARD
TZNAME:EST
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
DTSTART:20251102T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:6ac1b07c2d7fa
DTSTART;TZID=America/Toronto:20261009T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261009T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-jake-doliskani-quantum-money-wiesner
SUMMARY:Tutte Colloquium | Jake Doliskani\, Quantum Money: From Wiesner to\
 nStandard Assumptions
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Jake Doliskani\n\nAFFILIATION:\n McMaster University
  \n\nLOCATION:\n MC 5501\n\nABSTRACT: Quantum money is one of the earlies
 t ideas in quantum\ncryptography: a banknote is represented by a quantum s
 tate that cannot\nsimply be copied. Wiesner’s original proposal required
  the bank to\nverify every transaction\, motivating the notion of public-k
 ey quantum\nmoney\, where anyone can verify a banknote while only the bank
  can\ncreate new ones.\n\nIn this talk\, I will trace the story of quantum
  money from Wiesner’s\nscheme\, through the hidden-subspace construction
  of Aaronson and\nChristiano\, to Zhandry’s recent construction from abe
 lian group\nactions. I will discuss why previous proposals were either bro
 ken or\nrelied on non-standard assumptions\, and then present recent work\
 nshowing that Zhandry’s construction can be based\, in the generic\ngrou
 p-action model\, on the standard group-action discrete logarithm\nassumpti
 on. I will conclude with the main idea behind the security\nproof.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c31161
DTSTART;TZID=America/Toronto:20261007T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261007T110000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/crypto-readi
 ng-group-quantum-computing-mojtaba-fadavi-and
SUMMARY:Crypto Reading Group on quantum computing | Mojtaba Fadavi and Taha
 \nHedayat\, Quantum Circuits
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Mojtaba Fadavi & Taha Hedayat\n\nAFFILIATION:\n Univ
 ersity of Waterloo\n\nROOM:\n MC 5501\n\nABSTRACT: Equipped with the know
 ledge of quantum information\, we\npresent how to use quantum states to bu
 ild a quantum algorithm. While\nclassical circuits represent how one makes
  algorithms using the bits 0\nand 1\, quantum circuits represent how one m
 akes algorithms using\nqubits $\\ket{\\alpha} = \\alpha_0 \\ket{0} + \\alp
 ha_1\\ket{1}$. In this\npresentation\, we will introduce the definition an
 d presentation of\nquantum gates. Starting with 1-qubit gates and expandin
 g to n-qubit\ngates. We also present the standard gates such as the Pauli 
 Gates\,\nCNOT\, CCNOT\, SWAP\, etc. Then we proceed to see the effects and
 \ninteractions of these gates along with some measurements.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c31eea
DTSTART;TZID=America/Toronto:20261008T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261008T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-jun-yan
SUMMARY:Algebraic and Enumerative Combinatorics Seminar | Jun Yan\, Exact\n
 enumeration of lozenge tilings of a triangular region
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Jun Yan\n\nAFFILIATION:\n University of Waterloo\n\n
 LOCATION:\n MC 5417\n\nABSTRACT: Tiling enumerations problems have fascin
 ating connections\nwith many other combinatorial problems involving perfec
 t matchings\,\nlattice paths\, and determinants. In this talk\, I will bri
 efly survey\nsome of the classical results and methods in this area. Then\
 , I will\npresent a new result enumerating lozenge tilings of a triangular
 \nregion. Interestingly\, the formula\, reminiscent of the famous\nKastele
 yn formula counting domino tilings of the rectangle\, contains\nroots of u
 nity and does not obviously output an integer.\n\nTHERE WILL BE A PRE-SEMI
 NAR PRESENTING RELEVANT BACKGROUND AT THE\nBEGINNING GRADUATE LEVEL START
 ING AT 1:30PM.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c32aab
DTSTART;TZID=America/Toronto:20261005T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261005T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-jun-yan-ramsey-numbers-trees
SUMMARY:Graphs and Matroids | Jun Yan\, Ramsey numbers of trees
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Jun Yan\n\nAFFILIATION:\n University of Waterloo\n\n
 ROOM:\n MC 6029\n\nABSTRACT: Let T be a tree with bipartition class sizes
  t_1>=t_2.\nMotivated by two simple lower bound constructions\, Burr conje
 ctured\nthat the Ramsey number of T\, denoted by R(T)\, is exactly\nmax{t_
 1+2t_2\,2t_1}-1. While this conjecture turns out to be false\, all\nknown 
 counterexamples have large maximum degrees. In a joint work with\nRichard 
 Montgomery and Matías Pavez-Signé\, we show that there exists\na constan
 t c>0\, such that Burr's conjecture does hold if T has maximum\ndegree at 
 most c(t_1+t_2). In particular\, this determines the exact\nRamsey numbers
  of a large family of trees. In this talk\, I will go\nover some backgroun
 d on tree embeddings\, and give an overview of our\nproof. 
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c335f7
DTSTART;TZID=America/Toronto:20260930T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260930T113000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoric
 s-and-optimization-reading-group-resolution-0
SUMMARY:Combinatorics and Optimization reading group | Resolution of Matroi
 d\nSecretary Conjecture - Day 2
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Kanstantsin Pashkovich\n\nAFFILIATION:\n University 
 of Waterloo\n\nROOM:\n MC 6029\n\nABSTRACT: I will go over the recent pap
 er by Sahil Singla proving\nMatroid Secretary Conjecture.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c340e1
DTSTART;TZID=America/Toronto:20260928T110000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260928T123000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/combinatoric
 s-and-optimization-reading-group-resolution
SUMMARY:Combinatorics and Optimization reading group | Resolution of Matroi
 d\nSecretary Conjecture - Day 1
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Kanstantsin Pashkovich\n\nAFFILIATION:\n University 
 of Waterloo\n\nROOM:\n MC 5501\n\nABSTRACT: I will go over the recent pap
 er by Sahil Singla proving\nMatroid Secretary Conjecture.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c34bcc
DTSTART;TZID=America/Toronto:20260930T100000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260930T110000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/crypto-readi
 ng-group-quantum-computing-quantum-information
SUMMARY:Crypto Reading Group on quantum computing | Quantum Information The
 ory
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Elnaz Hessami Pilehrood & Owen Waldon \n\nAFFILIATI
 ON:\n University of Waterloo\n\nROOM:\n MC 5501\n\nABSTRACT: Pure quantum
  states describe systems whose preparation is\nknown exactly\, but realist
 ic quantum information often involves\nuncertainty\, inaccessible subsyste
 ms\, and interactions with the\nenvironment. In this talk\, we introduce d
 ensity operators as a general\nframework encompassing both pure and mixed 
 states. We then discuss\nquantum channels\, which model physical transform
 ations and common\nforms of noise affecting quantum systems. Finally\, we 
 introduce\nclassical and quantum entropy as measures of uncertainty and\ni
 nformation\, and explain how these ideas provide basic intuition for\nquan
 tum cryptographic security.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c3571b
DTSTART;TZID=America/Toronto:20261001T143000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261001T153000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/algebraic-an
 d-enumerative-combinatorics-seminar-theta
SUMMARY:Algebraic and Enumerative Combinatorics Seminar | Theta operators a
 nd\nLLT positivity
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Vasu Tewari\n\nAFFILIATION:\n University of Toronto\
 n\nLOCATION:\n MC 5417\n\nABSTRACT: I will introduce a family of commutin
 g derivations on the\nring of symmetric polynomials. Using this family I w
 ill then define an\napparently-novel family of symmetric functions that is
  vertical-strip\nLLT positive and relates directly to the Theta operators 
 of\nD'Adderio–Iraci–Vanden Wyngaerd. Finally I'll discuss some\nconseq
 uences for the \"higher order\" Macdonald positivity conjecture of\nDołę
 ga. This is joint work with Jim Haglund.\n\nTHERE WILL BE A PRE-SEMINAR PR
 ESENTING RELEVANT BACKGROUND AT THE\nBEGINNING GRADUATE LEVEL STARTING AT
  1:30PM.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c361a4
DTSTART;TZID=America/Toronto:20261002T153000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20261002T163000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/tutte-colloq
 uium-recent-progress-erdos-rogers-function
SUMMARY:Tutte Colloquium | Recent Progress on Erdos-Rogers Function
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Jacques Verstraete\n\nAFFILIATION:\n University of C
 alifornia\n\nLOCATION:\n MC 5501\n\nABSTRACT: For positive integers $s$ a
 nd $n$\, let $f_{s}(n)$ denote\nthe maximum $k$ such that every $n$-vertex
  $K_{s+1}$-free graph\ncontains an induced $K_s$-free subgraph with $k$ ve
 rtices. These are\nthe Erd\\H{o}s-Rogers functions\, introduced by Erd\\H{
 o}s and Rogers in\n1962\, and are generalizations of Ramsey numbers.\n\nIn
  this talk we survey recent progress\, culminating with the recent\nresult
  of Morris\, Saharasbudhe which finally determines the order of\nmagnitude
  of the Erd\\H{o}s-Rogers functions.\n\nJoint work with Rob Morris and Jul
 ian Saharasbudhe.
DTSTAMP:20261004T014844Z
END:VEVENT
BEGIN:VEVENT
UID:6ac1b07c36c86
DTSTART;TZID=America/Toronto:20260928T150000
SEQUENCE:0
TRANSP:TRANSPARENT
DTEND;TZID=America/Toronto:20260928T160000
URL:https://uwaterloo.ca/combinatorics-and-optimization/events/graphs-and-m
 atroids-kaioke-begay-finitary-and-cofinitary
SUMMARY:Graphs and Matroids | Kaioke Begay- Finitary and Cofinitary Oriente
 d\nMatroids
CLASS:PUBLIC
DESCRIPTION:SPEAKER:\n Kaioke Begay\n\nAFFILIATION:\n University of Waterlo
 o\n\nROOM:\n MC 6029\n\nABSTRACT: Much like matroids\, oriented matroids 
 can be defined on\nfinite ground sets using a set of circuit axioms. Orien
 ted matroid\nduality is an important property which is difficult to mainta
 in in the\ninfinite setting. One way to define infinite oriented matroids 
 in a\nway that preserves duality is using signed set orthogonality. This\n
 allows for the notion of finitary and cofinitary oriented matroids. An\nor
 iented matroid is called finitary if all of its circuits have finite\nsupp
 ort\, and cofinitary if it is the dual of a finitary oriented\nmatroid. It
  has recently been shown that cofinitary oriented matroids\ndo not necessa
 rily satisfy the circuit axioms. In the finite setting\,\nthere are many w
 ays to define oriented matroids which are equivalent\nto the circuit axiom
 s. Here\, we prove that some of these definitions\nstill hold for cofinita
 ry oriented matroids\, even when the circuit\naxioms fail.
DTSTAMP:20261004T014844Z
END:VEVENT
END:VCALENDAR