Past Events

The New York Area Theory Day is a semi annual conference aimed to bring together people in the New York metropolitan area for one day of interaction and discussion about topics in CS theory The meeting is free and open to everyone in particular students are encouraged to attend The

In this talk, I will explain that there are (most likely) no other "modular" companions to certain mod-9 partition identities conjectured jointly with Matthew C. Russell. The experiments crucially hinge

In the $k$-cut problem, we are given an edge-weighted graph and want to find the least-weight set of edges whose deletion breaks the graph into $k$ connected components. Algorithms due

In this talk we will talk about dynamic programming and combinatorial game theory. Dynamic Programming is a method for solving a complex problem by breaking it down into a collection

Consider a k-partite k-uniform hypergraph on [n]^k. It is not difficult to see that any such hypergraph with more than (s-1)n^{k-1} edges contains a matching of size s. Aharoni and

In 2019 both DIMACS and the National Science Foundation s Science and Technology Centers program celebrate 30 years of operation and 30 years of defining and shaping modern research In today s dynamic research landscape 30 years is a remarkable milestone and one that we wish to celebrate in a

We consider an online vector balancing question where T vectors, chosen from an arbitrary distribution over [-1,1]^n, arrive one-by-one and must be immediately given a {+, -} sign. The goal

Roughly speaking, Arrow's theorem states that in an election with more than two candidates, there is no "reasonable" voting rule that gives a rational outcome. I will discuss this and

We consider quantitative aspects of a Ramsey theoretic result of Leeb. Leeb showed that any sufficiently large complete k-uniform hypergraph with ordered vertex set and ordered edge set must contain

A pattern is a list a = [a1, a2, . . . , ar] (r ≥ 1) of non-negative integers. We say a partition λ = (λ1, . . .

We consider a data analyst's problem of purchasing data from strategic agents to compute an unbiased estimate of a statistic of interest. Agents incur private costs to reveal their data

Helly's theorem states that if any d+1 or fewer elements of a finite family of convex sets in R^d have non-empty intersection then there is a point which is contained

In the theory of dense graph limits, a graphon is a symmetric measurable function W from [0,1]^2 to [0,1]. Each graphon gives rise naturally to a random graph distribution, denoted

We introduce and study new operations on lattices and directed graphs and use them to explain rational relationships among pseudo-roots of noncommutative polynomials. This is a joint work with Michael

For many large-scale optimization and machine learning problems, first-order methods and their accelerated variants based on momentum have been a leading approach for computing low-to-medium accuracy solutions because of their

TBD

There are many impressive results asserting that the chromatic number of G(n,p) is sharply concentrated. In 1987, Shamir and Spencer showed that for any function p=p(n), the chromatic number of

Physics folklore says that a classical point charge, when accelerated by some electromagnetic field, produces electromagnetic radiation through which it loses energy and momentum to the field degrees of freedom.