DIMACS | Center for Discrete Mathematics and Theoretical Computer Science
In this talk, I will talk about applications of the entropy method and a tool that we call the mixture bound. To demonstrate how the mixture bound can be applied,
We'll discuss new uses of technology, including Lean and AI, to aid the research mathematician.
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
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
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
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
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.
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
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
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