Past Events

This workshop is being held online from 2 00 4 00 pm As business and government agencies increasingly rely on AI tools to make predictions and allocate resources policy experts have become increasingly concerned that automated decisions lack the accountability and participatory input we expect in a representative democracy In

We introduce and prove the n-dimensional Pizza Theorem. This is joint work with Sophie Morel and Margaret Readdy. longer abstract Link to video: https://vimeo.com/696353782

This paper proposes a new and effective simulation-based approach, called the Repro Sampling method, to conduct statistical inference in high dimensional linear models. The Repro method creates and studies the

We initiate a systematic study of algorithms that are both differentially private and run in sublinear time for several problems in which the goal is to estimate natural graph parameters.

Ring-Ring is a pencil and paper logic puzzle. In addition to solving puzzles together, we will see how to count possible solutions using finite state machines (and linear algebra).

A graph property is first order expressible if it can be written as a formal sentence using the universal and existential quantifiers with variables ranging over the vertices of the

In the study of flat origami, each crease pattern has an associated set of valid mountain-valley assignments - ones that will allow it to fold flat. We study how these

While magnetic resonance imaging (MRI) studies are critical for the diagnosis, monitoring, and study for a wide variety of diseases, their use in quantitative analysis can be complex. An increasingly

Streaming computation plays an important role in large-scale data analysis. The sliding window model is a model of streaming computation which also captures the recency of the data. In this

Given a 3-bedroom apartment, is it possible to find a rent distribution so that all 3 roommates get their first-choice room? This problem can be solved by coloring triangles and

The celebrated Erdős-Hajnal Conjecture says that in any proper hereditary class of finite graphs we are guaranteed to have a clique or anti-clique of size $n^c$, which is a much

The DATA INSPIRE TRIPODS Institute at Rutgers in collaboration with the TRIPODS Duke Institute and the TRIAD Institute at Georgia Tech will host a one day graduate student workshop on March 11 2022 from 2pm to 5pm EST The goal of this virtual event is to bring together graduate students

Combinatorial structures are ubiquitous throughout mathematics. Graphs, permutations, words, and other such families of combinatorial objects often play a central role in work from many different fields. The study of

An array of length n has a pi-appearance for a permutation pi: [k] --> [k] if there are k indices x_1 < x_2 < .. < x_k such that the

A commuting graph of a ring is a graph whose vertices are non-central elements of the ring. 2 distinct vertices x and y are said to be adjacent if and

Given a polygon P in the triangular grid, we define a rigid billiards system by allowing beams of light to bounce around inside of P so that each beam always

Sorting probability for a partially ordered set P is defined as the min |Pr[x < y] - Pr[y < x]| going over all pairs of elements x,y in P, where

Multipoint evaluation is the computational task of evaluating a polynomial given as a list of coefficients at a given set of inputs. Besides being a natural and fundamental question in

For multi - source data, blocks of variable information from certain sources are likely missing. Most existing methods for handling missing data do not take structures of block-wise missing data

In this well prepared talk about material specifically chosen for a GCS audience, I will cover results that I could (hypothetically) have covered with my 461 students. These include various