Seminars and Colloquia by Series

Unit fraction representation using shifted Golomb primes

Series
Additional Talks and Lectures
Time
Thursday, October 22, 2026 - 16:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Rishika Agrawal – University of Georgia

A unit fraction representation of a positive rational number writes it as a sum of finitely many unit fractions $\frac{1}{n}$ with distinct positive integers $n$. In 1202, Fibonacci showed that every positive rational number has such a representation. Since then, people have been interested in representations with special properties. In this spirit, Bloom asked: which sets $A \subseteq \mathbb{N}$ can represent every positive rational number, subject to some local conditions, using only denominators from $A$? Croot proved in 2003 that for any finite colouring of $\mathbb{N}$, $1$ can be written as sum of unit fractions with denominators in a single-color class. Bloom showed that any $A$ with positive upper logarithmic density works, and Liu and Sawhney improved this to sets with upper logarithmic density $(\log N)^{-1/5 + o(1)}$. Bloom also showed that the shifted primes $p-1$ have this property.

 

To characterize all sets $A$ with this special property, we need to understand which arithmetic properties make this possible. One way to do that is to study thinner sets that still have this special property. In this talk we show that the shifted Golomb primes have this property. The Golomb primes are a subset of primes defined by $q_1 = 3$ and, once $q_1, \dots, q_k$ are known, $q_{k+1}$ is the smallest prime $p$ with $p \not\equiv 1 \pmod{q_i}$ for all $i \le k$. They are a natural generalization of the primes, and their relative density in the primes is about $1/(loglogx)$, which goes to $0$.

What are the Odds? (The Math of Sports)

Series
Additional Talks and Lectures
Time
Saturday, March 14, 2026 - 18:00 for 3 hours
Location
Wild Heaven Brewery, West End Garden Room
Speaker
various – Mathematics in Motion, Inc., and Georgia Tech –

Please Note: What are the Odds? is this year's math-themed event of the Atlanta Science Festival. This year the focus is on the math of sports. Tickets can be purchased through the Atlanta Science Festival for $10, which wilo entitle the ticket holder to a beer or soft drink.

What are the odds your team will win, and what will the spread be? Our statisticians and mathematicians will help you understand the odds in sports events and how we calculate them. Try out the hands-on demos our team has developed! Sports stats are only one of the many ways math connects with sports. Find out how the wave moves through the audience in a stadium, how math helps perfect sports equipment, how to determine how much a team is worth, and more! We will finish up the night with a round of mathy sports trivia.

Please note your ticket price includes a beer or soft drink!

Computer Algebra club/seminar

Series
Additional Talks and Lectures
Time
Wednesday, February 25, 2026 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Alex Dunbar

Exploring Parametrized Systems of Real Polynomial Equations with Neural Networks

We investigate the use of machine learning techniques to assist in the solution of parametrized systems of real polynomial equations. In particular, we discuss the problem of jointly predicting the number of real solutions to a problem and approximating the paramter-to-solution map. Throughout, we emphasize interactions between the algebraic geometry of the underlying problem and considerations in deep learning.
This is based on ongoing work with Julianne Barnhart, Jonathan Hauenstein, Ikenna Nometa, Margaret Regan, Trong-Thuc Trang, and Charles Wampler.

Computer Algebra club/seminar

Series
Additional Talks and Lectures
Time
Wednesday, February 4, 2026 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Rickey Huang – Georgia Tech

From a 3-body problem (CR3BP)
to modeling periodic trajectories with algebraic curves
to minimal problems (related to liaison navigation)
solved via computer algebra (python, Macaulay2).
 

A Lovász-Kneser theorem for triangulations

Series
Additional Talks and Lectures
Time
Friday, January 23, 2026 - 11:00 for 1 hour (actually 50 minutes)
Location
Skiles 249
Speaker
Michael Zheng – Emory University

In a highly influential paper from 1978, Lovász used topological methods to determine the chromatic number of the Kneser graph of the set of k-element subsets of a set with n elements. In this talk, we will discuss the Kneser graph of the set of triangulations of a convex n-gon and a recent proof that the chromatic number of this graph is n-2. The geometry of the associahedron will play a particularly important role in the argument. Based on a joint work with Anton Molnar, Cosmin Pohoata and Daniel Zhu.

Computer Algebra club/seminar

Series
Additional Talks and Lectures
Time
Wednesday, January 21, 2026 - 13:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Anton Leykin – Georgia Tech

Let us discuss how to use generative AI to help with math and coding.

My presentation features two scenarios:

Coding in LaTeX. Suppose you have a raw draft of what potentially could be a math paper. We will consider and apply simple AI tools that may help realizing the potential.

Coding in CAS. Suppose you have a raw idea for a package in a Computer Algebra System; your raw idea may be limited to a rough description of the input/output of a method you would like to implement. How far can an AI assistant take you? Can it autonomously code a working software package?   

 

Computer Algebra club/seminar

Series
Additional Talks and Lectures
Time
Thursday, December 4, 2025 - 14:00 for 1 hour (actually 50 minutes)
Location
Skiles 006
Speaker
Daniel Hwang and Juliet Whidden – Georgia Tech

Please Note: We will start with a presentation by Daniel Hwang and Juliet Whidden and continue with a free discussion.

Pages