- 9th Annual Women in Math and Computing Day
- Join us for two amazing talks by women in scholars in mathematics and computer science followed by a free lunch out at Sangria Restaurant on Sutphin Blvd.
- What student featured employee featured student Women Center employee Math and Computer Science
- When Apr 27, 2018 from 10:30 AM to 03:30 PM (America/New_York / UTC-400)
- Where AC-3D01
- Contact Name Lidia Gonzalez
- Contact Phone 718-626-2551
- Add event to calendar iCal
All are welcomed. You do not need to be a math or computer science major to attend. Come to as much or as little of the event as you would like. This event (including lunch) is being funded through a generous grant by the Simons Foundation. So please, join us for some math, some cs, some food and some fun!
10:30 am - Introduction
11:00 am - Geometric Flows: What are they and why do we care?
Assistant Professor of Mathematics
Christine Breiner earned her B.A. in Mathematics from Kenyon College in 1999. After teaching high school for five years, she returned to school herself and earned her Ph.D. at Johns Hopkins University in 2009. She spent three years at MIT as a C.L.E. Moore Instructor before moving to Columbia University as an NSF Postdoctoral Fellow. She is currently an Assistant Professor of Mathematics at Fordham University.
Abstract: Geometric flows have recently been critical in the resolution of important questions in topology, geometry, and general relativity. In fact, the proof of the Poincare conjecture, the only Millennium Problem that has been resolved, relies critically on a geometric flow! In this talk, we first mention some of the major results that have been proven using geometric flows. We next define the curve shortening flow and present lots of examples to clarify our understanding. We then define a higher dimensional version of this flow and explain fundamental ways in which the flows differ. We conclude with a few hints as to why the Poincare conjecture can be resolved using a geometric flow.
12:00 pm - Fast Quantum Algorithm for Solving Multivariate Quadratic Equations
Doctoral Student, Computer Science Program
CUNY Graduate Center
Kelsey Horan graduated from Rutgers University with a Bachelor degree in Mathematics in 2015. Since then she held two visiting research positions: one at University of Michigan--Ann Arbor in the biomedical informatics lab lead by P.I. Prof. Kayvan Najarian and another at Sorbonne University in Paris, working on post-quantum cryptography. Her research interests are cryptography, quantum computation, group theory, machine learning, data science and computational biology. Ms. Horan works to create opportunities for others to learn about these areas. She is the student organizer of the Quantum and Post Quantum Computation Seminar, as well as a student co-organizer of the Mathematical Aspects of Cryptography Student Seminar.
Abstract: The NSA announced plans to transition to quantum-safe cryptographic constructions due to the increasing likelihood of quantum attacks. Towards evaluating the security of proposals for such a transition, this talk addresses the quantum bit security of solving a system of m equations in n unknowns - a classically NP-hard problem. We present a new algorithm which combines Gröbner Basis techniques with Grover’s quantum algorithm and achieves an advantage over brute force and all other algorithms for solving this problem. This Las Vegas quantum algorithm requires the evaluation of O(2^(0.462n)) quantum gates in expectation.
1:30 pm - Lunch
Lunch to follow at 1:30 pm at Sangría Restaurant: 9541 Sutphin Blvd. Jamaica, NY 11435
Conference Planning Committee
- Dr. Lidia Gonzalez
- Dr. Rishi Nath
- Dr. Virginia Thompson
- Dr. Radoslaw Wojciechowski (Simons Grant Recipient)
This event is made possible by a generous grant from The Simons Foundation