Past Events

The axiom of choice says "every set of non-empty sets has a choice function". This has some well known, slightly problematic consequences. However, abandoning AC can result in much much

For a probability measure $\mu$ on the discrete hypercube, we are interested in finding sufficient conditions under which $\mu$ either (a) Exhibits concentration (either in the sense of Lipschitz functions,

Works of Carlitz gave an inspiration to many researchers to develop different generalizations of the Eulerian polynomials and numbers. Many of those generalizations have a pure analytical character. It is

There are many graph problems of the following form: Given a graph G, construct a graph H that preserves some information about G, while optimizing some property of H. Some

A binary code of positive rate is a subset of {0,1}^n with size exponentially large in n. In any binary code of positive rate, one can find twocodewords sharing the

Consider a setting in which inputs to and outputs from a computational problem are so large, that there is not time to read them in their entirety. However, if one

We show that if a permutation statistic can be written as a linear combination of bivincular patterns, then its moments can be expressed as a linear combination of factorials with

Over the past two decades there has been a growing interest in estimating various graph parameters, such as the size of maximum matching (MM) and minimum vertex cover (MVC), in

We prove that for every graph with maximum degree Delta, if we sample O(log n) colors independently and uniformly at random for each vertex from colors {1,...,Delta+1}, then with high

The Riemann hypothesis is a question regarding the solutions of the transcendental equation ζ(s)=0, that is the zeros of the Riemann zeta function. The starting point of our talk is

We study structured systems of linear equations (or linear systems) and structured linear programs, commonly arising from combinatorial optimization, operations research, and so on. Many of them can be solved

The divide between traditional and experimental combinatorialists is at a breaking point. In a recent talk, it was claimed that linear algebra is useful because of set systems and discrete

The classical Turán problem asks: given a graph H, how many edges can an n-vertex graph have while containing no isomorphic copy of H? By viewing (k+1)-uniform hypergraphs as k-dimensional

Over the past few decades, piecewise-continuous differential equations have become increasingly popular in scientific models. In particular, conceptual climate models often take this form. These nonsmooth systems are typically reframed

In a beautiful new "coffee table book", "Do not Erase", by the very talented artistic photographer Jessica Wynne, there are pictures of more than one hundred blackboards by a very

Textbook hardness-to-randomness converts circuit lower bounds into PRGs. But is this black-box approach really necessary for derandomization? In this talk I'll show how to revamp the classical hardness-to-randomness framework, converting

The workshop is held annually as part of the NSF National Research Traineeship SOCRATES Socially Cognizant Robotics for a Technology Enhanced Society co sponsored by DATA INSPIRE DATA science for INtelligent Systems and People Interaction an NSF TRIPODS Institute based at Rutgers University http robotics cs rutgers edu data inspire

What is the minimum number of colors required in a coloring of all k-subsets of an n-set so that every color class is r-wise intersecting? We suggest a conjectured answer

In computational complexity it is often easier to prove hardness results for a colored version of a combinatorial or graph theoretic problem than its uncolored counterpart. Moreover, one can typically

Social choice has a rich history tracing back to the work of Borda Condorcet Laplace and others in the 18th century and the work of Kenneth Arrow in the 1950s that led to the Nobel Prize in Economics A current working definition might say that social choice theory studies how