Past Events

I will present results on the exact and asymptotic enumeration of corner polyhedra, a special class of simple orthogonal polyhedra introduced by Eppstein and Mumford, whose enumeration can be considered

We show that every fractionally k-edge-connected weighted graph (i.e. every solution to the canonical k-edge-connectivity linear program) can be rounded to an integral (k-10)-edge-connected graph of no greater cost. This

In a landmark paper in 1992, Stanley developed the foundations of what is now known as the Kazhdan--Lusztig--Stanley (KLS) theory. To each kernel in a graded poset, he associates special

The Port of New York and New Jersey faces a complex landscape of cyber threats, posing significant risks to its critical infrastructure and operations. These threats include ransomware attacks targeting

The Sinkhorn limit of a positive square matrix is obtained by scaling the rows so each row sum is 1, then scaling the columns so each column sum is 1,

Error-correcting codes provide robust representations of data that can withstand corruption. Over the past 80 years, researchers have made significant strides in designing efficient codes and developing methods for encoding

Given a graph H, which we wish to exclude (maybe as a minor or as an induced subgraph), can we find some set of 'rules' (graph operations) so that we

The degeneracy of a graph is a measure of sparseness that gives important information about its Turán- and Ramsey-type properties. I will talk about the extension of this problem to

We prove that if G~G(n,1/2) then with high probability there exists a equipartition such that each vertex has more neighbors across the partition than within their own part. The proof

In this talk, we discuss combinatorial games where both players move randomly (each turn, independently selecting a legal move uniformly at random), and we will emphasize the "experimental math" approach

We are holding a Mixer event to discuss interdisciplinary research on an AI Mediated Society being conducted across the Rutgers University New Brunswick campus The event will be informal a series of one minute flash talks followed by a social gathering The event is in part to welcome new Rutgers

In this talk, we discuss the problem of learning a high-dimensional Gaussian subject to privacy and robustness constraints. We give efficient algorithms for privately estimating a Gaussian distribution in both

Classical parking functions are a central subject in combinatorics. There are three natural sub-families of parking functions: the increasing ones, the prime ones, and the prime increasing ones. In this

Broadly speaking, extremal combinatorics studies how \`\`large'' combinatorial objects can be, such as determining the maximum number of edges that a graph with a given set of properties can have.

The study of the distribution of statistics over the symmetric group is nearly a century old and has given us a lot of elegant theorems and beautiful bijections. These distributions

Entanglement is the crucial phenomenon that distinguishes quantum systems from classical ones. Specifically, we consider entanglement in many-body systems at thermal equilibrium as a function of the temperature. Systems at

The entropy of a random variable is a quantity that represents 'the average amount of surprise' in observing an outcome. Originally introduced by Claude Shannon as a tool for studying

We study large random matrices with i.i.d. entries conditioned to have prescribed row and column sums (margin). This problem has rich connections to relative entropy minimization, Schr"{o}dinger bridge, the enumeration

In The Theory of Partitions, p. 98, Ex. 2, George Andrews points out that any power series with constant term 1 has a unique factorization in the form 1 +

In the framework of "algorithms with predictions,'' algorithms are augmented with a machine-learned prediction and the goal is to obtain improved guarantees when the prediction is correct (consistency) while simultaneously