Past Events

A "pattern" of length k in a permutation P in S_n is a permutation in S_k determined by choosing k elements from {1,2,...,n} and looking at the order of their

In this talk we consider Collatz polynomials. In particular, we bound the moduli of the roots of these polynomials using a determinantal approach, prove theorems on when these polynomials have

We consider a revenue-maximizing seller with n items facing a single buyer. We introduce the notion of symmetric menu complexity of a mechanism, which counts the number of distinct options

What do groups, semirings, lattices, and magmas all have in common? Well, if you squint hard enough, all of their definitions are essentially the same: they're sets with a bunch

Given an increasing family F of subsets of a finite set X, its measure according to \mu_p increases and often exhibits a threshold behavior, growing quickly as p increases from

The multivariate central limit theorem yields a solution to a question of Behrouzi-Far and Zeilberger concerning the average maximal number of balls in a bin. An overview of the classical

Interdependencies between firms that hold each other's shares (or other obligations) are a channel through which shocks to one firm can be transmitted to others. Thus, a small yet sufficient

I will give an expository talk on a nice paper by our own Prof. Bhargav Narayanan (joint with David Ellis). https://sites.math.rutgers.edu/~narayanan/pdf/symmetric_3_families.pdf . A family of sets is said to be

Let H be an infinite graph. In a two-coloring of the edges of the complete graph on the natural numbers, what is the densest monochromatic subgraph isomorphic to H that

Newton's method for polynomial root finding is one of mathematics' most well-known algorithms. The method also has its shortcomings: it is undefined at critical points, it could exhibit chaotic behavior

A partition P of a weighted graph G is (sigma, tau, Delta)-sparse if every cluster has diameter at most Delta, and every ball of radius Delta/sigma intersects at most tau

Consider a "game" involving two players Alice and Bob (as a team), who coordinate on a strategy beforehand. The following describes one round of the "game": 1. You sample a

What is the largest number of projections onto k coordinates guaranteed in every family of m binary vectors of length n? This fundamental question is intimately connected with important topics

An important family of incidence problems are discrete analogs of deep questions in geometric measure theory. Perhaps the most famous example of this is the finite field Kakeya conjecture, proved

The Geometric Complexity Theory (GCT) program is an algebro-geometric approach to the celebrated P vs NP problem. Connections between GCT and classical subject of invariant theory have been uncovered in

This workshop follows the seminar organized in December 2017 at the Université Paris Dauphine see www lamsade dauphine fr sra2017 The 2019 workshop is jointly organized by the LAMSADE DIMACS http dimacs rutgers edu the 3A Institute https 3ainstitute cecs anu edu au and a number of partners in CNRS

It is a known fact that the partial sums of some trigonometric series generate appealing patterns when plotted as points in the complex plane. The usual explanation is based on

I will describe a recent work that uses so-called “double-samplers” for list decoding. Double samplers are multi-layered graphs that are derived from high dimensional expanders, and whose existence is quite