2026-27 Department of Mathematics and Statistics Events |
|
|
September 2026 |
|
Thurs. |
Analysis & Applications Seminar Speaker: J.D. Mireles James, Professor, Department of Mathematics & Statistics, Florida Atlantic University Title: Validated numerical computations with power series for analytic functions - Part 2 This week I'll continue the discussion we started last week, but will move into talking about power series computations for stable/unstable manifolds. (So, the talk should be mostly independent from last time... if you missed it there will still be a lot here for you 😄) I'll be especially interested in the role of the dircrete Fourer transform (DFT) when the map is given as a numerical "black box", i.e. where then is no explicit formula for it. Abstract: I will talk about a method for computing mathematically rigorous enclosures of power series. This task is important in many different kinds of computer assisted proofs in nonlinear analysis and dynamical systems theory. The idea is to use an interpolation scheme on the boundary of a disk in the complex plane, which turns out to be equivalent to the discrete Fourier transform (DFT) for Fourier series. This interpolation introduces errors, which can they be bound using ideas from complex analysis. Moreover, one can take advantage of fast algorithms such as the FFT for the numerical computations. I will focus on obtaining bounds on the so called "aliasing" errors (which are really just interpolation errors, i.e. the mistake you make when you interpolate when you wanted to project... all of this will be discussed!). In later talks I will explain how these ideas appear in computer assisted proofs. In particular, I want to show you some computer assisted proofs of the existence of chaotic motion in mathematical billiards. Of course, I will introduce these models when the time comes. NOTE: There is an open invitation to all faculty and graduate students to talk in the seminar. If you would like to speak this semester, please just contact me or Professor Lundberg and we will get you on the schedule! |
|
Tues. |
Crypto Reading Seminar |
|
Thurs. |
Analysis & Applications Seminar Speaker: J.D. Mireles James, Professor, Department of Mathematics & Statistics, Florida Atlantic University Title: Validated numerical computations with power series for analytic functions - Part 3 Abstract: I will talk about a method for computing mathematically rigorous enclosures of power series. This task is important in many different kinds of computer assisted proofs in nonlinear analysis and dynamical systems theory. The idea is to use an interpolation scheme on the boundary of a disk in the complex plane, which turns out to be equivalent to the discrete Fourier transform (DFT) for Fourier series. This interpolation introduces errors, which can they be bound using ideas from complex analysis. Moreover, one can take advantage of fast algorithms such as the FFT for the numerical computations. I will focus on obtaining bounds on the so called "aliasing" errors (which are really just interpolation errors, i.e. the mistake you make when you interpolate when you wanted to project... all of this will be discussed!). In later talks I will explain how these ideas appear in computer assisted proofs. In particular, I want to show you some computer assisted proofs of the existence of chaotic motion in mathematical billiards. Of course, I will introduce these models when the time comes. NOTE: There is an open invitation to all faculty and graduate students to talk in the seminar. If you would like to speak this semester, please just contact me or Professor Lundberg and we will get you on the schedule! |
|
Tues. |
Speaker: Hoai Nam Le Title: Optimal Bucket Set Construction for Multi-scalar Multiplication with Endomorphisms +Zoom (click here) Abstract: Multi-scalar multiplication (MSM), which computes a linear combination of elliptic-curve points of the form \sum_i a_iP_i, is a major computational bottleneck in many modern cryptographic protocols, particularly in proof systems. In 2023, Luo, Fu, and Gong (LFG) introduced a framework for accelerating MSM using a bucket set together with a multiplier set, allowing a trade-off between storage and online computation. In 2025, Fan, Sica, Kuchta, and Xu (FKSX) applied the LFG framework to efficient endomorphisms, exploiting units that can be applied essentially on the fly. This raises a natural optimization problem: Can we minimize the bucket size while still admitting an efficient Hamiltonian path for bucket accumulation? In this talk, I will present our construction from a geometric viewpoint over the Eisenstein integers. I will show how this viewpoint leads to an optimal hexagonal bucket set and also allows us to construct an efficient Hamiltonian path for the bucket accumulation step. Moreover, we generalize the construction to larger multiplier sets, providing further time-memory trade-offs when additional storage is available. This work will be presented at ASIACRYPT 2026 and is joint work with Professor Sica. Video recording |
|
Thurs. |
Analysis & Applications Seminar Speaker: J.D. Mireles James, Professor, Department of Mathematics & Statistics, Florida Atlantic University Title: Validated numerical computations with power series for analytic functions - Part 4 Abstract: I will talk about a method for computing mathematically rigorous enclosures of power series. This task is important in many different kinds of computer assisted proofs in nonlinear analysis and dynamical systems theory. The idea is to use an interpolation scheme on the boundary of a disk in the complex plane, which turns out to be equivalent to the discrete Fourier transform (DFT) for Fourier series. This interpolation introduces errors, which can they be bound using ideas from complex analysis. Moreover, one can take advantage of fast algorithms such as the FFT for the numerical computations. I will focus on obtaining bounds on the so called "aliasing" errors (which are really just interpolation errors, i.e. the mistake you make when you interpolate when you wanted to project... all of this will be discussed!). In later talks I will explain how these ideas appear in computer assisted proofs. In particular, I want to show you some computer assisted proofs of the existence of chaotic motion in mathematical billiards. Of course, I will introduce these models when the time comes. NOTE: There is an open invitation to all faculty and graduate students to talk in the seminar. If you would like to speak this semester, please just contact me or Professor Lundberg and we will get you on the schedule! |
|
Tues. |
Dissertation Defense Speaker: Samith Kuruppu, Ph.D. Candidate, Department of Mathematics & Statistics, Florida Atlantic University Title: Multivariate Zero Subtracted CM Poisson Model for Applications and A Study of Hurricane Track Forecasting in the North Atlantic Basin Abstract: Count data arise in a wide range of fields and often exhibit correlation along with either overdispersion or underdispersion. To address such data, in the first project, we introduce a extension of the multivariate zero subtracted Poisson distribution, refereed to as the multivariate zero subtracted Conway Maxwell Poisson (MZSCMP) distribution. We derive the main properties of the distribution and develop an associated regression framework for modeling correlated multivariate count data. The performance of the model is evaluated through two simulation studies and compared with alternative models using maximum likelihood estimations, Akaike Information Criterion (AIC) and Bayesian Information Criterion (BIC). A real data application is also presented to show the proposed model works in practice. Overall, the findings demonstrate that the MZSCMP model provides a effective approach for analyzing correlated overdispersed multivariate count data. The second research project presents a comparative evaluation of six data driven models for forecasting tropical cyclone (TC) tracks in the north Atlantic basin. Two forecasting approaches are developed and analyzed. The first approach is based on neural network architectures (NNAs), consisting of four configurations: NNA1-R+, NNA1-R-, NNA2-R+ and NNA2-R-. The second approach uses multiple linear regression (MLR). The models are trained using output data from the Advanced Dvorak Technique (ADT 9.0) archive, maintained by the Cooperative Institute for Meteorological Satellite Studies at the University of Wisconsin Madison (UW-CIMSS). Historical TC data from 2003 to 2024 are used for model development, while data from the 2025 hurricane season are reserved as an independent test set for model evaluation. Each model is trained using the most recent 3 h historical observations. To provide a baseline for model comparison, a climatology persistence method, referred to as the geodesic persistence model (GPM), is also developed. Forecast performance is evaluated using overall predication error (PE), mean absolute error (MAE), root mean square error (RMSE) and mean track error (in km) for forecast horizons of 6 h, 12 h, 24 h and 48 h. The results indicate that, among all proposed models, the NNA1-based models consistently produce lower errors and demonstrate relatively better performance in predicting TC tracks in North Atlantic basin. |
|
Thurs. |
Analysis & Applications Seminar Speaker: Erik Lundberg, Professor, Department of Mathematics & Statistics, Florida Atlantic University Title: Erdős Problem #1039 on the inradius of polynomial lemniscates Abstract: This talk will take a look at Erdos Problem labeled #1039 on the Erdos Problems Forum https://www.erdosproblems.com/1039 Erdős, Herzog, and Piranian asked in 1958 whether every monic polynomial p of degree n with all zeros in the unit disk has a disk of radius at least c/n on which its modulus is everywhere less than 1, where c > 0 is an absolute constant. In other words, the problem concerns the inradius (radius of the largest inscribed disk) of the polynomial lemniscate {z: |p(z)| \leq 1} and whether it admits a lower bound of order 1/n. This problem was recently resolved using AI. I’ll discuss the problem, previous progress, and my impression of the AI solution (and how it compares to other AI assisted preprints that have crossed my path). |
|
Tues. |
Speaker: Edoardo Persichetti, Professor in the Department of Mathematics and Statistics, Florida Atlantic University Title: A Brief Introduction to Code-Based Cryptography +Zoom (click here) Abstract: Code-based cryptography is one of the major players in the post-quantum landscape, providing solutions against attackers equipped with quantum capabilities. “In this talk, I will provide an overview of the history and main features of this area, starting with McEliece’s seminal work and progressing through modern day’s renditions and new cryptographic standards. Everyone welcome!" Bio: Edoardo Persichetti is Professor in the Department of Mathematics and Statistics at FAU. His work in code-based cryptography spans nearly two decades and has earned him considerable recognition. He is author of many published articles in main cryptographic venues, as well as an upcoming book on the topic; he has served on numerous program committees and editorial boards, and he currently sits on the IACR board of directors. He is author of two cryptographic standards, and his expertise is often sought after in various circumstances. |
|
|
October 2026 |
|
Thurs. |
Analysis & Applications Seminar Speaker: Erik Lundberg, Professor, Department of Mathematics & Statistics, Florida Atlantic University Title: Erdős Problem #1039 on the inradius of polynomial lemniscates (Part II) Abstract: This talk will take a look at Erdos Problem labeled #1039 on the Erdos Problems Forum https://www.erdosproblems.com/1039 Erdős, Herzog, and Piranian asked in 1958 whether every monic polynomial p of degree n with all zeros in the unit disk has a disk of radius at least c/n on which its modulus is everywhere less than 1, where c > 0 is an absolute constant. In other words, the problem concerns the inradius (radius of the largest inscribed disk) of the polynomial lemniscate {z: |p(z)| \leq 1} and whether it admits a lower bound of order 1/n. This problem was recently resolved using AI. I’ll discuss the problem, previous progress, and my impression of the AI solution (and how it compares to other AI assisted preprints that have crossed my path). |
|
Tues. |
Speaker: Yuhao Liu, Department of Mathematics & Statistics, Florida Atlantic University Title: Gröbner Basis and Relinearization Algorithm for Ring-LWE +Zoom (click here) Abstract: \textbf{Abstract.} We analyze the Gr\"obner basis attack on the Arora--Ge system \cite{AroraG11} arising from Ring-LWE samples over \[ \mathcal{R}_q = \mathbb{F}_q[X]/(X^n+1), \] with $n$ a power of two and errors bounded by $b$. We show that, with high probability over the sampled public polynomials, the highest-degree components of the resulting polynomial system span the full space of forms of degree $k$ (where $k = 2b + 1$), so that the system is semi-regular with degree of regularity $k$. Furthermore, we quantify the failure probability through a factorization of the degree-$k$ Macaulay determinant into $n$ blocks indexed by the frequencies of a negacyclic Fourier transform and permuted by Frobenius. We further show that this structure block-diagonalizes the dominant part of the linearized system and reduces the cost of the attack from \[ \Theta\!\left(n^{k\omega}\right) \] to \[ \Theta\!\left(n^{(k-1)\omega+1}\right) \] arithmetic operations in the splitting field of $X^n+1$, a saving of a factor $n^{\omega-1}$ over the corresponding unstructured computation. For ternary errors, this yields the complexity reduction \[ \Theta(n^{9}) \rightarrow \Theta(n^{7}) \] for $\omega = 3$. Bio: Yuhao Liu is a PhD student in the department of Mathematics and Statistics |
|
|
NOVEMBER 2026 |
|
Thurs. |
AMC 10/12A The event will be held in Phil Smith Hall, BU 109. |
|
Friday |
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. The event will be held in Phil Smith Hall, BU 109. |
