2025-26 Department of Mathematics and Statistics Events |
|
|
November, 2025 |
|
Monday |
Ph.D. Dissertation Defense Speaker: Tran Ngo, Ph.D. Candidate, Florida Atlantic University Title: Post-Quantum Cryptology: New Constructions and Cryptanalysis Abstract: Classical cryptographic schemes, which are based on the hardness of factorization and discrete logarithmic problems, can be efficiently solved by the Shor algorithm on a quantum computer. This motivated the 2016 National Institute of Standards and Technology (NIST) call to identify efficient and secure cryptographic schemes that are resilient to potential attacks from both classical and quantum adversaries, a field referred to as post-quantum cryptography. In this work, we focus on designing efficient post-quantum cryptographic primitives based on code-based and lattice-based assumptions, and we analyze their underlying hardness using quantum cryptanalysis. On the construction side, we propose a ring signature scheme and an identity-based signature scheme based on the Code Equivalence Problem, leveraging the LESS identification scheme and the Calamari-Falaflframework. The proposed ring signature achieves small public keys (11.57 kB), and its signature size grows logarithmically with the number of users in the ring, outperforming existing code-based solutions while remaining competitive with other post-quantum schemes, particularly for large ring sizes. Furthermore, we introduce cryptographic schemes based on the Module v NTRU problem, a generalization of the NTRU problem that provides better flexibility in parameter selection. Building on this, we design compact encryption schemes that achieve a low decryption failure rate, with a proposed parameter set offering the smallest ciphertext size among NIST Level 3 security schemes. Additionally, we present the design of signature schemes, one of which achieves the smallest provably secure signature size in the Quantum Random Oracle Model (QROM). On the cryptanalysis side, we present a concrete quantum resource estimation for lattice enumeration based on Montanaro’s algorithm, together with a detailed implementation in the quantum circuit model, and show how to optimize the depth of the circuit through parallelized design components. The second contribution is a quasi-polynomial-time algorithm for the Extrapolated Dihedral Coset Problem (EDCP) over power-of-two moduli. Although our results on EDCP do not compromise the security of LWE with standard parameters, they offer insight into the complexity of LWE. All are welcome! A copy of Tran Ngo's dissertation can be found in SE 234 |
|
Wednesday |
Math Competition for High School Students (AMC 10/12A) The Mathematical Association of America hosts the annual AMC contests for middle and high school students. We began the AMC10-12 Contests in as early as 2007. Its purpose is to spur interest in mathematics and develop talent through the excitement of friendly competition at problem-solving in a timed format. |
|
Wednesday |
Riemannian manifolds reading group
Book: Lee. John M., Introduction to Riemannian Manifolds. ISBN: 978-3-319-91754-2 physical copy. Electronic access is available through the S.E. Wimberly Library. Join us for a weekly reading group! We will go through Lee's Introduction to Riemannian Manifolds. Anyone who's interested in joining us is welcome. For more information, please contact Prof. Parker Edwards . |
|
Thursday |
Analysis and Applications Seminar Speaker: Francesco Sica, Ph. D., Florida Atlantic University Title: History of the Bernstein Problem Abstract: Bernstein’s problem asks whether the graph of a function u, defined over all of ℝ^n, and satisfying the Euler-Lagrange equation for minimal surfaces, is a hyperplane. Bernstein himself gave in 1915 a positive answer when n=2. The problem was then solved for 3⩽n⩽7 only in the sixties, with the widely believed result being conjectured for all n. Then, in 1969 a remarkable paper by Bombieri, De Giorgi and Giusti showed that Bernstein’s problem has a negative answer for all n⩾8. I will present an elegant proof of the original Bernstein theorem and discuss its fascinating history. The only prerequisite is Calc 3 and Cauchy’s theory of holomorphic functions. |
|
Wednesday |
Master of Science in Teaching Mathematics (MST) Defense Speaker: Colette Chilton-Carr, MST candidate Title: Historical Contexts in Mathematics Education: Improving Student Engagement and Achievement Abstract: There are many informational gaps in contemporary mathematics education. Students see the mathematical topics they are being taught as facts and procedures unrelated to each other or to themselves as mathematicians. Many ancient developments in the realm of mathematics are still relevant today, showcasing the needs that motivated their longstanding evolution. By including the stories behind the formulas in mathematics classrooms, students from diverse backgrounds can feel seen and connected to their education. The inclusion of the holistic background of mathematics cannot be nurtured in the classroom without buy-in on the parts of both students and instructors, as well as the education of the instructors so that they are able to successfully teach mathematics in a way that showcases the true value of the material. |
|
Wednesday |
Riemannian manifolds reading group
Book: Lee. John M., Introduction to Riemannian Manifolds. ISBN: 978-3-319-91754-2 physical copy. Electronic access is available through the S.E. Wimberly Library. Join us for a weekly reading group! We will go through Lee's Introduction to Riemannian Manifolds. Anyone who's interested in joining us is welcome. For more information, please contact Prof. Parker Edwards . |
|
Thursday |
Analysis and Applications Seminar Speaker: Noah Corbett, Florida Atlantic University Title: Periodic orbits of state-dependent delay differential equations Abstract: The dynamics of delay differential equations (DDEs), systems whose state variable(s) depend on some previous state(s) of the system, pose a challenging and rich topic of study that has seen increased attention in recent years. In this talk, we introduce the concept of and methods for solving DDEs, as well as discuss the complexity of such systems when compared to their ODE counterparts. We then consider systems in which the delay term itself is state-dependent and introduce methods of both theoretically and numerically computing solutions to such systems using a modified Picard operator. We finish by constructing a shooting method to yield periodic orbits of state-dependent DDEs and illustrate examples of such orbits in the delayed Cubic Ikeda and Van der Pol systems. This talk will be given in fulfillment of the requirements for the speaker's preliminary exam, and thus a greater emphasis will be placed on background and introductory material as opposed to novel research on the subject. |
|
Thursday |
Math Competition for High School Students (AMC 10/12B) The Mathematical Association of America hosts the annual AMC contests for middle and high school students. We began the AMC10-12 Contests in as early as 2007. Its purpose is to spur interest in mathematics and develop talent through the excitement of friendly competition at problem-solving in a timed format. |
|
Friday |
Colloquium Speaker: Erik Lundberg, Florida Atlantic University Title: Counting smooth functions on the sphere (from topology to combinatorics to complex analysis) Abstract: Arthur Cayley posed (1859) the problem of studying possible configurations of level lines in contour maps. A precise modern formulation of this problem, promoted by V.I. Arnold, is to enumerate smooth functions on the sphere up to smooth change of coordinates. In other words, consider equivalence classes of generic smooth functions, where two functions are considered equivalent if one can be obtained from the other by pre- and post- composing with orientation-preserving diffeomorphisms of the domain and range, respectively. Arnold posed (2005) the problem of determining the asymptotic growth of the number of (equivalence classes of) smooth functions as the prescribed number of critical points increases. In this talk, I will present joint work with B. Dhakal, M. Epstein, and J.D. Mireles-James, providing precise asymptotics addressing Arnold’s problem. The proof uses methods of complex analysis applied to a generating function derived by Liviu Nicolaescu. A broad sketch of the proof will be given, reserving details for a seminar talk next week given by Prof. Mireles-James. The talk will be accessible to students and aimed at a broad audience, with the notions from topology, combinatorics, and complex analysis treated with an intuitive, visual approach. |
|
Wednesday |
Riemannian manifolds reading group Book: Lee. John M., Introduction to Riemannian Manifolds. ISBN: 978-3-319-91754-2 physical copy. Electronic access is available through the S.E. Wimberly Library. Join us for a weekly reading group! We will go through Lee's Introduction to Riemannian Manifolds. Anyone who's interested in joining us is welcome. For more information, please contact Prof. Parker Edwards . |
|
Thursday |
Analysis & Applications Seminar Speaker: Jason Mireles-James, Ph. D., Florida Atlantic University Title: Counting smooth functions on the sphere (from topology to combinatorics to complex analysis): details of the computer-assisted proof. Abstract: This talk continues the presentation given by Professor Lundberg last week, where he discussed ideas from our work on a counting problem from analytic combinatorics proposed by Arnold. I will focus on some of the details from the computer-assisted proof of the asymptotic bounds. This is joint work with B. Dhakal, M. Epstein, and Erik Lundberg. |
|
Friday |
Graduate Student Seminar Speaker: Hanraj Jangir, Ph.D. student, Florida Atlantic University Title: A Quasi-polynomial time algorithm for Extrapolated Dihedral Coset Poblem Abstract: The Learning With Errors (LWE) problem is a basic building block of many post-quantum cryptographic constructions since LWE, like most lattice problems, is believed to be hard for a quantum adversary. Regev showed that LWE can be reduced to the quantum Dihedral Coset Problem (DCP) (FOCS '02). Brakerski et al. later showed LWE is actually polynomial-time equivalent to a relaxation of DCP called the Extrapolated Dihedral Coset Problem (EDCP) (PKC '18), which they conjectured could be easier than DCP. In this talk we will present a new quasi-polynomial time quantum algorithm for EDCP and discuss its impact on LWE. In particular, we discuss why this algorithm still performs no better than classical algorithms for LWE. |
|
Monday |
Ph.D. Defense Speaker: Anae Myers, Ph.D. Candidate Advisor: Dr. Yoram Sagher, Professor of Mathematics Title: The Hardy-Littlewood Inequalities for Some Almost Periodic Functions Abstract: Click here |
|
Tuesday |
Speaker: Arindam Mukherjee, Assistant Professor in Mathematics at A.M. College, Jhalda, India
Title: The Representation Technique for Small Max-Norm LWE
FLYER
Bio: Arindam Mukherjee works in public-key cryptanalysis, with a focus on post-quantum hardness assumptions. He received his MSc and PhD in Mathematics from IIT Madras, Chennai, India. He is currently an Assistant Professor in Mathematics at A.M. College, Jhalda, India. |
|
|
January, 2026 |
|
Wed-Fri |
International Symposium on Artificial Intelligence and Mathematics (ISAIM, 2026) The International Symposium on Artificial Intelligence and Mathematics is a biennial meeting that fosters interactions between mathematics, theoretical computer science, and artificial intelligence. The series was started by Martin Golumbic, Peter L. Hammer, and Frederick Hoffman in 1990, and the editorial board of the Annals of Mathematics and Artificial Intelligence serves as the permanent Advisory Committee. Traditionally, the Symposium attracts participants from a variety of disciplines, thereby providing a unique forum for scientific exchange. The three-day symposium features invited speakers, technical paper presentations, and special topic sessions. If you have a question about ISAIM 2026, please email isaim-l@lists.ou.edu. Join the Google group of ISAIM to receive major announcements from the organizers of the symposium. |
|
Saturday |
Middle School Math Day Competition (AMC 8) The Department of Mathematics and Statistics hosts several middle schools in a combination of the American Mathematics Competition (AMC-8) and our traditional Math Day events. Beginning in 2010, this event combines a national competition, mathematical talks, and a team game. Students have a chance to interact with FAU Mathematics faculty while engaging in both national and local competitions. |
|
|
February, 2026 |
|
Saturday |
High School Math Day Beginning in 2005, this annual event provides a day of competitions and seminars designed to provide high school students and their teachers with an opportunity to share an appreciation of mathematics, to exchange ideas, and to interact with FAU Mathematics faculty. More Information about this event coming soon! |
|
Saturday |
Florida GeoGebra Florida GeoGebra Conference 2026, Integrating free mathematical software GeoGebra into STEM Education: A Mathematics Perspective Registration is Open! Click the Link now to register: https://fau.az1.qualtrics.com/jfe/form/SV_5bXnk1TOmDgsfD8 |
|
|
March, 2026 |
|
March
Grand |
57th Southeastern International Conference on Combinatorics, Graph Theory, and Computing Celebrating its 57th year, the Conference brings together mathematicians and others interested in combinatorics, graph theory, and computing, and their interactions. The Conference lectures and contributed papers, as well as the opportunities for informal conversations, have proven to be of great interest to other scientists and analysts employing these mathematical sciences in their professional work in business, industry, and government. The Conference continues to promote a better understanding of the roles of modern applied mathematics, combinatorics, and computer science, acquainting investigators in each of these areas with the various techniques and algorithms available to assist in their research. Each discipline has contributed significantly to the others, and the purpose of the Conference is to narrow the gaps between the fields even further. Regsiter Here! |
