Apr 22 2026

In Defense of Defensive Forecasting

Information
Wednesday, April 22, 2026
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Juan Carlos Perdomo - New York University (NYU)

From sports to politics, from the stock market to prediction markets, from cancer detection to sequence completion, prediction is a big business. Proven track records of accurate predictions support claims

Apr 22 2026

Permutation Groups, Partition Lattices and Block Structures

Information
Wednesday, April 22, 2026
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Marina Anagnostopoulou-Merkouri - University of Bristol

Let G<= Sym(\Omega) be a finite transitive permutation group. We say that G is primitive if it preserves no nontrivial partition of \Omega, and imprimitive otherwise. Primitive groups are essential

Apr 20 2026

Vanishing First Homology Groups of Clique Complexes of Strongly Regular Graphs

Information
Monday, April 20, 2026
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Mutasim Mim - The City College and Graduate Center / CUNY

We classify the strongly regular graphs for which the first clique homology group can fail to vanish over some field. Using Neumaier's classification of strongly regular graphs with fixed smallest

Apr 16 2026

Computational and Experimental Methods in Permutation Patterns

Information
Thursday, April 16, 2026
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Jay  Pantone - Marquette University
For most of its existence, a hallmark of permutation patterns research has been the use of computers. Our research is regularly made possible by the ability to write a simple
Apr 15 2026

Bridging High-Dimensional Robust Statistics and Non-Convex Optimization

Information
Wednesday, April 15, 2026
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Yu Cheng - Brown University

In this talk, we will explore the intersection between robust high-dimensional statistics and non-convex optimization. We will show that standard optimization methods such as gradient descent can efficiently solve various

Apr 15 2026

Necklaces and Subset Sums

Information
Wednesday, April 15, 2026
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Natasha Ter-Saakov - Rutgers University

I will talk about necklaces, subset sums and some proven and theoretical relations between them. This will be a combination of basics and new discoveries.

Apr 09 2026

Sparse and Scalable Residue Number Systems from Polynomial Point of View

Information
Thursday, April 9, 2026
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Eugene Zima - Wilfrid Laurier University

Residue number systems (RNS) based on pairwise relatively prime moduli are a powerful tool for accelerating integer computations via the Chinese Remainder Theorem. We study families of sparse moduli exhibiting

Apr 08 2026

Ultraproducts of Graphs

Information
Wednesday, April 8, 2026
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Danae Rupp - Rutgers University

Ultraproducts are a very important tool in model theory, and are one of the most common model theoretic tools for proving non-model theory results. In this talk I will prove

Apr 08 2026

Quasipolynomial Bounds for the Corners Theorem

Information
Wednesday, April 8, 2026
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Mehtaab Sawhney - Columbia University
We discuss recent bounds on corners free sets in [N] x [N] and discuss the implications for the complexity of the NOF problem. Regarding the proof we focus in on
Apr 03 2026

Diversity Preserving Filter Pruning: A Fast Optimization Approach for Practical Neural Network Compression

Information
Friday, April 3, 2026
1:00 PM - 2:00 PM
Type: Seminars | CCICADA Seminar Series in Homeland Security
Presenter(s): Weiwei Chen - Rutgers Business School, Rutgers University
Modern AI applications increasingly rely on deep neural networks, yet their growing size and computational demands can hinder deployment in resource‑constrained or real‑time environments. This challenge appears across domains such
Apr 02 2026

Summing a Challenging Series

Information
Thursday, April 2, 2026
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Victor Miller - Anduril Industries
On the math-fun list, Neil Sloane posed the following problem: Let V(n) denote the integer formed by using the base 10 digits of n in base 11. It is classical
Apr 01 2026

A Polynomial Space Lower Bound for Diameter Estimations in Dynamic Streams

Information
Wednesday, April 1, 2026
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Erik Waingarten - University of Pennsylvania
We study the space complexity of estimating the diameter of a subset of points in an arbitrary metric space in the dynamic (turnstile) streaming model. The input is given as
Apr 01 2026

A Brief Intro to Discrete Fourier Analysis.

Information
Wednesday, April 1, 2026
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Max Aires - Rutgers University
I open my potion-brewing kit and try my hand at some arcane arcane sorcery known as the Fourier transform. Okay, maybe it's not so arcane, but we shall focus on
Mar 30 2026

Workshop on AI Powered Automation at Ports

Information
Monday, March 30, 2026 - Wednesday, April 1, 2026
Type:
DIMACS Center

The DIMACS and CCICADA Centers at Rutgers University, with funding from the National Science Foundation, will sponsor a workshop March 30 to April 1, 2026 to examine the opportunities and potential risks associated with the increasing use of Artificial Intelligence to enhance the process of automation and its applications to port logistics, supply chains, and increasingly many aspects of port operations.

Mar 30 2026

Partial Associativity in Latin Squares

Information
Monday, March 30, 2026
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Jason Long - Squarepoint Capital
Suppose that a binary operation * on a finite set X is injective in each coordinate and is also associative. It is easily shown that (X,*) is a group. But
Mar 30 2026

DIMACS/CCICADA Workshop on AI Powered Automation at Ports

Information
Monday, March 30, 2026 - Wednesday, April 1, 2026
8:00 AM - 5:00 PM
Type: Workshops
Organizer(s): Alok Baveja | Elsayed A. Elsayed | Aman Goswami | Fred Roberts | Andrew Tucci | Erez Agmoni | Kostas Bekris | Michael Santoro

Workshop on AI Powered Automation at Ports sponsored by the DIMACS and CCICADA Centers The DIMACS and CCICADA Centers at Rutgers University with funding from the National Science Foundation will sponsor a workshop March 30 to April 1 2026 to examine the opportunities and potential risks associated with the increasing

Mar 25 2026

Locality Sensitive Hashing in Hyperbolic Space

Information
Wednesday, March 25, 2026
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Chengyuan Deng - Rutgers University
Locality Sensitive Hashing (LSH) is one of the most popular techniques for the problem of approximate nearest neighbor search in high-dimensional spaces. The quality of LSH is characterized by how
Mar 25 2026

The State of Fox's Trapezoidal Conjecture

Information
Wednesday, March 25, 2026
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Timothy Bates - Rutgers University
In this talk, I will go over everything I know about the current progress on Fox's trapezoidal conjecture on alternating links. The conjecture states that the sequence of coefficients in
Mar 23 2026

Generalized Tur\'an Problems for Trees and More

Information
Monday, March 23, 2026
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Sam Spiro - Georgia State University
Given a graph $H$ and a family of graphs $\mathcal{F}$, we define the generalized Tur\'an number $\mathrm{ex}(n,H,\mathcal{F})$ to be the maximum number of copies of $H$ in an $\mathcal{F}$-free graph
Mar 17 2026

Dimacs Workshop on AI-Powered Automation in Ports

Information
Tuesday, March 17, 2026 - Thursday, March 19, 2026
9:00 AM - 9:00 AM
Type: Workshops
Organizer(s): Elsayed A. Elsayed | Michael Santoro | Fred Roberts | Alok Baveja | Andrew Tucci | Erez Agmoni | Kostas Bekris
The complex issues associated with AI powered automation in ports call for contributions and collaborations among many disciplines This workshop will bring together a cross disciplinary group of participants from academia industry and government including industrial engineers mechanical engineers roboticists mathematical modelers supply chain experts economists decision and risk experts