2025-26 Department of Mathematics and Statistics Events |
|
|
September, 2025 |
|
Tuesday |
Speaker: Hansraj Jangir, Ph.D. student, Florida Atlantic University Title: A Quasi-polynomial time Quantum Algorithm for the Extrapolated Dihedral Coset Problem. FLYER Abstract: The Learning With Errors (LWE) problem, introduced by Regev (STOC’05), is one of the fundamental problems in lattice-based cryptography, believed to be hard even for quantum adversaries. Regev (FOCS’02) showed that LWE reduces to the quantum Dihedral Coset Problem (DCP) and later, Brakerski et al. (PKC 2018) extended this to the more general Extrapolated Dihedral Coset Problem (EDCP). In this talk, we present a quasi-polynomial time quantum algorithm for solving EDCP over power-of-two moduli, using a quasi-polynomial number of samples. We stress that our algorithm does not affect the security of LWE with standard parameters, as the reduction from standard LWE to EDCP limits the number of samples to be polynomial. Bio: Hansraj is a PhD student in the Department of Mathematics and Statistics at Florida Atlantic University, Boca Raton. Prior to starting his doctoral studies, he worked as a Junior Research Fellow at the Defense Research and Development Organization (DRDO), Delhi. His research interests include lattice based cryptography and quantum algorithms. |
|
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 Speaker: Lousi Merlin, Ph.D., Associate Professor, Florida Atlantic University, Department of Urban Planning Title: Finding the Right Formula for Land-Use Mix |
|
Friday |
Graduate Student Seminar Speaker: Addie Randolph, Florida Atlantic University Title: Invariant Circles of the Standard Map Abstract: Our goal with the following study is to lead to finding quasiperiodic orbits of the Circular Restricted Three Body Problem. A flow has quasiperiodic behavior if the associated Poincare map has quasiperiodic behavior. This encourages us to first look first at maps, and in this case, we look at a very well-known map, the standard map. An orbit exhibits Quasiperiodic behavior in a map if it is topologically conjugate to a rigid rotation of an irrational number. As given in the systematic recipe by Dr. Mireles James and David Blessing, we first compute the rotation number of the quasiperiodic orbit using the weighted Birkhoff averaging method. Then we use a Newton scheme to solve a conjugacy equation describing the circle resulting in the Fourier expansion of the quasiperiodic invariant circle. Finally, we observe the error of this method on multiple initial conditions. |
|
Tuesday |
Speaker: Nurdaulet Shynarbek, Mathematics Educational Program Coordinator (In-person) Title: Novel Representations of log 2 Through Polynomial Continued Fractions FLYER Abstract: This presentation explores new representations of the mathematical constant log 2 using polynomial continued fractions. Building on previous work in continued fraction theory, we investigate a conjecture by Zhu He which proposes a specific polynomial continued fraction for log 2. We will demonstrate the validity of this conjecture and introduce an infinite family of new polynomial continued fractions for log 2. |
|
Tuesday |
Speaker: Alibek Orynbassar, Senior Lecturer, Department of Pedagogy of Natural Sciences, SDU University Title: Complete Classification of Quadratic Irrationals with Period Two FLYER Abstract: This talk presents a full classification of quadratic irrationals whose continued fraction expansions have period length two. While it is known that the continued fraction of N is periodic, the distribution of period lengths is less understood. We establish precise conditions for the period-two case and illustrate the results with numerical examples. Bio: Alibek Orynbassar is a Senior Lecturer in the Department of Pedagogy of Natural Sciences at SDU University in Kaskelen, Kazakhstan, a position he has held since July 2023. He is currently pursuing a PhD in Mathematics and Natural Sciences at SDU. He earned both his Master’s (2017) and Bachelor’s (2014) degrees in Mathematics and Natural Sciences from SDU. From July 2022 to June 2023, he was a Visiting Scholar at Teachers College, Columbia University, where he expanded his expertise in mathematics education and research. Prior to his current role, he served as Mathematics Program Coordinator in the Department of Education at SDU (2020–2022) and as Senior Lecturer (2017–2022). Earlier in his career, he taught mathematics in secondary schools (2013–2017), where he prepared students for mathematics Olympiads. He has also contributed as a jury member for regional school mathematics Olympiads and scientific project competitions (2018–2020). |
|
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 . |
|
Tuesday |
Speaker: Dung Bui, LIP6, Sorbonne Université, France Title: FOLEAGE: F4OLE-Based Multi-Party Computation for Boolean Circuits FLYER Abstract: Secure Multi-party Computation (MPC) allows two or more parties to compute any public function over their privately-held inputs, without revealing any information beyond the result of the computation. Modern protocols for MPC generate a large amount of input-independent preprocessing material called multiplication triples, in an offline phase. This preprocessing can later be used by the parties to efficiently instantiate an input-dependent online phase computing the function. To date, the state-of-the-art secure multi-party computation protocols in the preprocessing model are tailored to secure computation of arithmetic circuits over large fields and require little communication in the preprocessing phase, typically O(N · m) to generate m triples among N parties. In contrast, when it comes to computing preprocessing for computations that are naturally represented as Boolean circuits, the state-of-the-art techniques have not evolved since the 1980s, and in particular, require every pair of parties to execute a large number of oblivious transfers before interacting to convert them to N-party triples, which induces an Ω(N^2 · m) communication overhead. In this paper, we introduce FOLEAGE, which addresses this gap by introducing an efficient preprocessing protocol tailored to Boolean circuits. FOLEAGE exhibits excellent performance: It generates m multiplication triples over F2 using only N · m + O(N^2 · log m) bits of communication for N-parties, and can concretely produce over 12 million triples per second in the 2-party setting on one core of a commodity machine. Our result builds upon an efficient Pseudorandom Correlation Generator (PCG) for multiplication triples over the field F4. Roughly speaking, a PCG enables parties to stretch a short seed into a large number of pseudorandom correlations non-interactively, which greatly improves the efficiency of the offline phase in MPC protocols. Our construction significantly outperforms the state-of-the-art, which we demonstrate via a prototype implementation. This is achieved by introducing a number of protocol-level, algorithmic-level, and implementation-level optimizations on the recent PCG construction of Bombar et al. (Crypto 2023) from the Quasi-Abelian Syndrome Decoding assumption. Bio: Dung Bui is a postdoctoral researcher at LIP6, Sorbonne Université, France. She completed her PhD at IRIF, Université Paris Cité. Her research interests are in various aspects of both practical and theoretical cryptography, including secure multiparty computation, zero-knowledge proofs, and post-quantum cryptography. Contact email: dung.bui@lip6.fr |
|
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: Dr. Ivan Sudakow Title: Modeling Critical Transitions in Complex Systems: From Local Interactions to Global Regime Shifts Abstract: When do local interactions trigger a global regime change, and how can we identify the mechanism? I present a Universal Dynamical Approximation (UDA) framework—parameterized universality for finite-dimensional, structurally stable dynamics—that places multiple model classes in a common normal form; in these coordinates, the bifurcation diagram yields reduced-order models. UDA is realized across reaction–diffusion systems, interfacial fluid flows, center–satellite network ODEs, and stochastic lattice spin models. Case studies include climate tipping points, ecosystem dynamics, evolutionary dynamics, and data-driven modeling supported by modern data analysis and interpretable machine learning. |
|
Friday |
Graduate Student Seminar (GSS) Speaker : Mr. Ali Ittayem Title : Computational Methods for Identifying Chaotic Dynamics in the Sakarya System Abstract : In this work, we investigate the onset of chaotic dynamics in the Sakarya system through the construction and analysis of Poincaré maps. By computing periodic orbits on a chosen cross-section and evaluating the associated monodromy matrices, we extract the stability properties of these orbits and characterize the eigenvalue structure of the corresponding Poincaré return maps. The stable and unstable manifolds of hyperbolic periodic points are approximated using parameterization methods and iterative schemes, allowing for the detection of transversal intersections that signal the presence of Smale horseshoe dynamics. These results provide strong evidence for the existence of chaotic behavior in the Sakarya system, linking local manifold geometry to global dynamical complexity. Beyond offering a framework for analyzing this particular system, our methodology demonstrates how Poincaré maps serve as a powerful tool for identifying and verifying chaotic structures in nonlinear dynamical systems. |
|
Tuesday |
Analysis and its Applications Seminar Speaker: Youngsuk Ko who is currently at the Department of Epidemiology of Microbial Diseases, Yale School of Public Health, New Haven, USA Title: From Real-World Data to Decision-Ready Models for Public Health: Mathematical and Statistical Approaches Abstract: How can mathematical and statistical modeling, grounded in real-world data, inform public health policy—and what should we do when the data are messy? This talk presents a pipeline that connects individual-level records to population-level decisions across diseases. First, using COVID-19 as a case study, I build an event-level likelihood directly from individual confirmed-case records (e.g., onset and report dates, demographics) and use maximum likelihood to estimate parameters of a mechanistic model. This enables head-to-head evaluation of vaccine-prioritization policies under limited supply—for example, prioritizing older adults versus the general adult population. Second, for dengue in Brazil, I use catalytic models to recover age- and state-specific forces of infection and immunity profiles, then embed these estimates in an age-structured transmission model to assess allocation strategies when supply is constrained. The result is state-level susceptibility maps and decision curves that clarify where—and to whom—doses should go first. Throughout, I emphasize identifiability, transparent assumptions, and uncertainty quantification so that conclusions remain interpretable and reproducible. I close with brief directions for extending the same pipeline to other vector-borne and respiratory pathogens and to additional data streams. youngsuk.ko@yale.edu |
|
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: Yu Xiang https://sites.google.com/site/yuxianghomepage/home Title: Robust Learning from Heterogeneous Data Abstract: The theme of my talk will be principled robust learning from heterogeneous data, where the heterogeneity arises naturally from either distribution shifts or decentralized settings. In the first part, I will focus on learning under distribution shifts from a causal perspective. Distribution shift is arguably the main challenge in today’s machine learning where one has to apply predictors learned from one dataset to a new dataset with a different distribution. One principled approach is to adopt the structural causal models (SCMs) by Pearl to describe training and test models, following the invariance principle which says that the conditional distribution of the response given its predictors remains the same across environments. However, this principle is often violated in practice when the response is perturbed in the unseen environment. We introduce invariant matching property, an explicit relation to capture interventions through an auxiliary feature, enabling a unified treatment of general perturbations on the response as well as the predictors. I will discuss its connection to self-supervised learning (SSL) and non-stationary time series settings. The second part of my talk will be centered around multiple testing via false discover rate (FDR), a rich line of work initiated by statisticians such as Turkey and later popularized by Benjamini and his coworkers. Naturally suitable for large-scale data and distribution-free guarantees, the notion of false discovery rate control has played a critical role in many recent developments such as variable selection and uncertainty quantification. I will discuss decentralized settings where each agent collects a large number of local measurements for efficient and accurate global decision-making, motivated by internet of things and mobile sensor applications. We have developed the state-of-the-art methodologies with provable FDR guarantees and strong empirical performance. I will also briefly cover robust variable selection with FDR control and my recent work on adversarial robustness of conformal novelty detection. Bio: Yu Xiang is an Assistant Professor in Electrical and Computer Engineering at the University of Utah. Prior to this, he was a postdoctoral fellow in the School of Engineering and Applied Sciences at Harvard University. He obtained his Ph.D. in Electrical and Computer Engineering from the University of California, San Diego. He received his B.E. with the highest distinction from the School of Telecommunications Engineering at Xidian University in China. His current research interests include learning under distribution shifts from a causal perspective and efficient multiple testing for novelty detection in networks. |
|
Friday |
Association for Women in Mathematics (AWM) Student Chapter Join Us for Tea Time! Sip tea, matcha, spill some tea! FLYER We look forward to seeing you there! |
|
Tuesday |
September 30, 2025, 10:00 am Science Building (SE-43), room 215 Speaker: Anil Kumar Pradhan, Founding Cryptographer and Cryptography Research Lead, Vaultree Title: Beyond Theory: Industry Challenges in Adopting Homomorphic Encryption Abstract: Fully Homomorphic Encryption (FHE) promises quantum-resilient, privacy-preserving computation for sensitive data across industries. However, despite academic breakthroughs, the leap from laboratory models to enterprise-scale adoption remains daunting. Industry faces formidable obstacles, including computational resource demands, implementation complexity, slow processing speeds, and high costs, aggravated by a shortage of FHE talent and lack of standardized practices. Integrating FHE into legacy and cloud systems requires extensive technical overhaul, often with questionable ROI. The disconnect between academic solutions and practical business needs, especially regarding scalability, cost, and integration continues to deter widespread implementation. Emerging technologies and optimization strategies, such as hardware acceleration and real-world application benchmarking, may help bridge the gap, but genuine adoption will require collaborative efforts and a shift in focus from theoretical promise to operational feasibility. Bio Anil Kumar Pradhan is a cryptographer specializing in practical privacy-enhancing technologies and their deployment in real-world systems. At Vaultree, he works at the intersection of advanced cryptography and industry adoption, focusing on fully homomorphic encryption (FHE), encrypted machine learning, and secure computation at scale. With a background spanning both academic research and enterprise engineering, he bridges the gap between theoretical innovation and operational feasibility. Anil has contributed to projects that bring cutting-edge cryptographic methods into production environments, with particular attention to performance optimization, compliance, and developer experience. He is passionate about making strong cryptography usable, scalable, and impactful across industries that handle sensitive data. Anil Kumar Pradhan is the Founding Cryptographer and Cryptography Research Lead at Vaultree Ireland, and has over a decade of experience in applied cryptography. He holds an M.Sc. in Mathematics from the Indian Institute of Technology, Delhi, and a B.Sc. (Hons) in Mathematics and Computing from the Institute of Mathematics and Applications, Bhubaneswar. |
|
|
October 2025 |
|
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 . |
|
Tuesday |
Reading Seminar on Quantum Algorithms This reading seminar is devoted to quantum algorithms, following Buchmann’s recently published book in the AMS series: <https://bookstore.ams.org/amstext-64> This seminar meets every other Tuesday, 10-10:50 AM in SE 215. If interested in participating, please email sicaf@fau.edu to subscribe to the crypto_math mailing list. * The schedule and topics of upcoming seminars can be found here: https://researchseminars.org/seminar/FAUcryptotopical |
|
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 . |
|
Tuesday |
Reading Seminar on Quantum Algorithms This reading seminar is devoted to quantum algorithms, following Buchmann’s recently published book in the AMS series: <https://bookstore.ams.org/amstext-64> This seminar meets every other Tuesday, 10-10:50 AM in SE 215. If interested in participating, please email sicaf@fau.edu to subscribe to the crypto_math mailing list. * The schedule and topics of upcoming seminars can be found here: https://researchseminars.org/seminar/FAUcryptotopical |
|
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 . |
|
Tuesday |
Reading Seminar on Quantum Algorithms This reading seminar is devoted to quantum algorithms, following Buchmann’s recently published book in the AMS series: <https://bookstore.ams.org/amstext-64> This seminar meets every other Tuesday, 10-10:50 AM in SE 215. If interested in participating, please email sicaf@fau.edu to subscribe to the crypto_math mailing list. * The schedule and topics of upcoming seminars can be found here: https://researchseminars.org/seminar/FAUcryptotopical |
|
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 . |
|
Tuesday |
Speaker: Dr. Sohyun Jeon, Ewha Womans University Title: LastRings: Lattice-based Scalable Threshold Ring Signatures FLYER
Abstract: This talk presents the first lattice-based threshold ring signature scheme with signature size scaling logarithmically in the size of the ring while supporting arbitrary thresholds. Our construction is also concretely efficient, achieving signature sizes of less than 150kB for ring sizes up to N=4096 (with threshold size T=N/2, say). This is substantially more compact than previous work. |
|
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 . |
|
|
November, 2025 |
|
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 . |
|
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 |
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. |
|
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 . |
|
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 |
|
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 competition. |
|
|
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 Regsitration is Open! Click the Link now to regsiter: 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 better understanding of the roles of modern applied mathematics, combinatorics, and computer science to acquaint the investigator in each of these areas with the various techniques and algorithms which are available to assist in his or her research. Each discipline has contributed greatly to the others, and the purpose of the Conference is to decrease even further the gaps between the fields. Regsiter Here! |
