Contact Info
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
Title: Some matrix problems in quantum information science
Speaker: | Chi-Kwong Li |
Affiliation: | College of William and Mary, IQC |
Room: | MC 5501 |
Abstract:
In this talk, we present some matrix results and techniques in solving certain optimization problems arising in quantum information science.
No quantum mechanics background is required.
Title: Progress on Continuous Quantum Walks
Speaker: | Chris Godsil |
Affiliation: | University of Waterloo |
Roon: | MC 6486 |
Abstract:
I will discuss the progress we’ve made in our work on continuous walks. I will start with old stuff (last November) and continue on to current stuff (this week).
Title: Extended odd holes and their blockers
Speaker: |
Ahmad Abdi |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
Title: Coordinate Descent Algorithms
Speaker: | Julian Romero |
Affiliation: | University of Waterloo |
Room: | MC 5479 |
Abstract:
We will be discussing the survey of Stephen J. Wright on coordinate descent algorithms. Coordinate descent algorithms solve optimization problems by successively performing approximate minimization along coordinate directions or coordinate hyperplanes. They have been used in applications for many years, and their popularity continues to grow because of their usefulness in data analysis, machine learning, and other areas of current interest.
Title: The Paulsen problem, continuous operator scaling, and smoothed analysis
Speaker: | Tsz Chiu Kwok |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
The Paulsen problem is a basic open problem in operator theory: Given vectors u1, ..., un in Rd that are eps-nearly satisfying the Parseval's condition and the equal norm condition, is it close to a set of vectors v1, ..., vn in Rd that exactly satisfy the Parseval's condition and the
equal norm condition? Given u1,..., un, we consider the squared distance to the set of exact solutions.
Title: Sequences: random, structured or something in between?
Speaker: | Fan Chung Graham |
Affiliation: |
University of California, San Diego |
Room: | MC 5501 |
Abstract:
There are many fundamental problems concerning sequences that arise in many areas of mathematics and computation. Typical problems include finding or avoiding patterns; testing or validating various `random-like’ behavior; analyzing or comparing different statistics, etc.
Title: A Short Introduction to Projective Geometry
Speaker: | Chris Godsil |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract:
Basically, see the title. I will be considering the real and complex cases mainly, because that is
what is needed in quantum physics.
Title: Enumeration in quantum algebras
Speaker: | Jason Bell |
Affiliation: | University of Waterloo |
Room: | MC 5501 |
Abstract:
Many of the classical algebras that occur in algebraic geometry and other mathematical fields have natural quantizations; that is, one can deform the multiplication rule using a parameter q, which has the property that when we specialize q at 1 we recover the classical object. As part of the general goal of understanding the representation theory of these rings, one often wants to understand the prime spectra of these algebras, that is, the collection of prime ideals in these rigs.
Title: RSKy Business
Speaker: | Nathan Lindzey |
Affiliation: | University of Waterloo |
Room: | MC 6486 |
Abstract:
We sketch the Robinson-Schensted-Knuth algorithm, then use it to glimpse into the representation theory of some classical combinatorial objects.
Title: The 8-connected excluded minors for the class of quasi-graphic matroids
Speaker: | Rong Chen |
Affiliation: | Fuzhou University |
Room: | MC 5479 |
Abstract:
The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle, is minor closed and contains both lifted-graphic matroids and frame matroids, each of which generalises the class of graphic matroids.
Title: I'll prove the Fundamental Theorem of Algebra
Speaker: | Sam Kim |
Affiliation: | Department of Pure Math, University of Waterloo |
Room: | MC 5501 |
Abstract:
Gauss proved that complex polynomials always admit a root. I'll explain how he came to that conclusion and present a proof that rigorizes his argument in a nice way. You will only need to know a little vector calculus and the intermediate value theorem.
Combinatorics & Optimization
University of Waterloo
Waterloo, Ontario
Canada N2L 3G1
Phone: 519-888-4567, ext 33038
PDF files require Adobe Acrobat Reader.
The University of Waterloo acknowledges that much of our work takes place on the traditional territory of the Neutral, Anishinaabeg and Haudenosaunee peoples. Our main campus is situated on the Haldimand Tract, the land granted to the Six Nations that includes six miles on each side of the Grand River. Our active work toward reconciliation takes place across our campuses through research, learning, teaching, and community building, and is centralized within our Office of Indigenous Relations.