Skip to content
# Events for 10/09/2019 from all calendars

## Quantum Symmetries Seminar

## Mathematical Physics and Harmonic Analysis Seminar

## Noncommutative Geometry Seminar

## Graduate Student Organization Seminar

**Time: ** 11:00AM - 12:00PM

**Location: ** BLOC 111

**Speaker: **Adam Deaton, Texas A&M University

**Title: ***Exercise 6*

**Time: ** 1:50PM - 2:50PM

**Location: ** BLOC 624

**Speaker: **Michael Levitin, University of Reading (UK)

**Title: ***Asymptotics of Steklov eigenvalues for curvilinear polygons (Unusual date and room!)*

**Abstract: **I will discuss sharp asymptotics of large Steklov eigenvalues for curvilinear polygons. The asymptotic expressions for eigenvalues are given in terms of roots of some trigonometric polynomials which depend explicitly on the side lengths and angles of the polygon.

The proofs involve some classical hydrodynamics results related to a sloping beach problem, and to a sloshing problem. I’ll also state some open questions. The talk will be based on joint works with Leonid Parnovski, Iosif Polterovich, and David Sher, see arXiv:1908.06455 and arXiv:1709.01891.

**Time: ** 2:00PM - 3:00PM

**Location: ** BLOC 628

**Speaker: **Chunlan Jiang, Hebei Normal University

**Title: ***Similarity invariants of essentially normal Cowen-Douglas operators and Chern polynomials*

**Abstract: **In this talk, I will discuss our resent work on a class of essentially normal operators by using the geometry method from the Cowen-Douglas theory and a Brown-Douglas-Fillmore theorem in the Cowen-Douglas theory. More precisely, the Chern polynomials and the second fundamental forms are
the similarity invariants (in the sense of Herrero) of this class of essentially normal operators.

**Time: ** 4:00PM - 5:00PM

**Location: ** BLOC 628

**Speaker: **Kristopher Watkins

**Title: ***An Exposition on Peter Shor's Polynomial-Time Factoring Algorithm*

**Abstract: **Shor's Algorithm utilizes a polynomial reduction given by Jeffrey Miller in 1975 to give the Discrete Logarithm Problem and the Factoring Problem membership in BQP. Doing so means that with a quantum computer of approximately 4000 stable qubits, we can break RSA, DHK, ElGamal, and their elliptic curve variants in polynomial time. The focus of the talk will be showing how Phase Estimation and the Quantum Fourier Transform work together to solve this problem, but Jeffrey Miller's reduction in 1975 will also be shown in a simpler way.