2026-27 Department of Mathematics and Statistics Events

October 2026

Thurs.
Oct. 1
11 am
SE 215

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.
Oct. 13
10 am
SE 215
ZOOM

Crypto Café

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.
Nov. 5
3-5:30p

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. 

The event will be held in Phil Smith Hall, BU 109.

Friday
Nov. 13
3-5:30p

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.

March 2027

Mar.
8-12
8a-6p
Student Union

58th Southeastern International Conference on Combinatorics, Graph Theory and Comptuing

The Fifty-eighth Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) will be held March 8-12, 2027 in the Student Union at Florida Atlantic University in Boca Raton, FL.  

Invited Speakers for the SEICCGTC 58:

Ricardo Gomez, Universidad Nacional Autónoma de México
Ken Ono, University of Virginia
Bryan Shader, University of Wyoming
Ann Trenk, Wellesley College
Peter Winkler, Dartmouth College

Special Sessions:

Topic:  Graph Polynomials and Invariants; Organizers:; Aihua Li (Montclair State University, New Jersey), Sarita Nemani  (Georgian Court University, New Jersey)

Topic: Graphs and Matrices Organizer: Mark Hunnell (Winston Salem State University); hunnellm@wssu.edu ;

Topic:  Algorithmic Graph Theory: Structured Families and Applications  OrganizerMartin Golumbic, University of Haifa

FOR STUDENTS: Fireside Chats (anyone can join!)
Description: An opportunity to gain helpful information you need as a graduate student!

• Join fellow students and faculty to discuss career opportunities  (round tables of 6-8 people (3-5 students with 2-3 mentors, i.e., faculty or mathematical sciences researchers in business, industry, or government).
• Meet and “establish meaningful connections” with other students and faculty!
• Hear helpful advice from faculty or mathematical sciences researchers in business, industry, or government!
• Learn from faculty “what they wished they had known as a graduate student (but didn't)!”
• Learn from faculty “what they would have done differently if they were to “redo” their time as a grad student?”

Date: Monday, March 8, 2027

Time:  12:00 pm- 1:50 pm (Lunch will be served!)