Mar 18 2021

DIMACS Workshop on Forecasting: From Forecasts to Decisions

Information
Thursday, March 18, 2021 - Saturday, March 20, 2021
9:00 AM - 5:00 PM
Type: Workshops
Organizer(s): Bo Waggoner | David Pennock | Raf Frongillo
Playlist of workshop videos Following the successful EC 2017 Workshop on Forecasting we will hold the DIMACS Workshop on Forecasting in 2021 We welcome submissions describing recent research on crowd sourced data driven or hybrid approaches to forecasting We especially encourage contributions that leverage forecasts to improve decisions Please see
Mar 15 2021

Open Group Disucssion

Information
Monday, March 15, 2021
4:00 PM - 5:00 PM
Type: Seminars | DIMACS Matching Reading Group
This week's meeting will depart from the usual convention of discussing a specific paper or papers. The meeting will be structured in two parts. The first part will involve people
Mar 12 2021

Learning Sign Language with AI Driven Grammar Checking

Information
Friday, March 12, 2021
10:00 AM - 11:00 AM
Type: Seminars | DATA-INSPIRE TRIPODS Seminars
Presenter(s): YingLi Tian - City University of New York
American Sign Language (ASL) is a primary means of communication for over 500,000 people in the US, and a distinct language from English, conveyed through hands, facial expressions, and body
Mar 11 2021

A Maple-assisted study of a Schroedinger-Newton, a.k.a. Schroedinger-Poisson, a.k.a. Choquard, a.k.a. Pekar, a.k.a. ... equation

Information
Thursday, March 11, 2021
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Michael Kiessling - Rutgers University
In several different contexts (mathematical) physicists have proposed a nonlinear system of PDEs which can be recast into a single Schroedinger equation with a Schroedinger potential that is the solution
Mar 10 2021

The Chvátal-Rödl-Szemerédi-Trotter Theorem

Information
Wednesday, March 10, 2021
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Rashmika Goswami - Rutgers University

The Ramsey number r(G) of a graph G is the minimum number n such that any two-coloring of the edges of a complete graph on n vertices will contain a

Mar 10 2021

Learning Low-Rank Tensors and Depth-3 Multilinear Circuits

Information
Wednesday, March 10, 2021
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Vishwas Bhargava - Rutgers University
Abstract: We give new and efficient black-box reconstruction algorithms for some classes of depth-$3$ arithmetic circuits. As a consequence, we obtain the first randomized polynomial-time algorithm for computing the tensor
Mar 05 2021

Ethics Washing in AI

Information
Friday, March 5, 2021
10:00 AM - 11:00 AM
Type: Seminars | DATA-INSPIRE TRIPODS Seminars
Presenter(s): Moshe Vardi - Rice University
Over the past decade Artificial Intelligence, in general, and Machine Learning, in particular, have made impressive advancements, in image recognition, game playing, natural-language understanding and more. But there were also
Mar 04 2021

Padovan, Pascal, and Proofs Without Words

Information
Thursday, March 4, 2021
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): David Nacin - William Patterson University
What happens when we attempt to construct the Fibonacci spiral with triangles instead of squares? We get a new sequence, the Padovan sequence, which answers its own collection of unique
Mar 03 2021

Random Talks

Information
Wednesday, March 3, 2021
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Quentin Dubroff - Rutgers University
I will give an introduction to random walks on graphs, deriving some useful identities and touching upon the fruitful analogy to electric networks. I'll then apply what has been developed
Mar 03 2021

Approximating Edit Distance in Near-Linear Time

Information
Wednesday, March 3, 2021
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Alexandr Andoni - Columbia University
Edit distance is a classic measure of similarity between strings, with applications ranging from computational biology to coding. Computing edit distance is also a classic dynamic programming problem, with a
Mar 01 2021

Discussion of: A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings

Information
Monday, March 1, 2021
4:00 PM - 5:00 PM
Type: Seminars | DIMACS Matching Reading Group
The paper to be presented is: Title: A Simply Exponential Upper Bound on the Maximum Number of Stable Matchings Authors: Anna Karlin, Shayan Oveis Gharan, and Robbie Weber Paper Abstract:
Feb 26 2021

Integrated Inference Analyses to Dissect Tumor Mutational Profiles

Information
Friday, February 26, 2021
10:00 AM - 11:00 AM
Type: Seminars | DATA-INSPIRE TRIPODS Seminars
Presenter(s): Hossein Khiabanian - Cancer Institute of New Jersey
Recent advances in the use of clinical sequencing platforms in precision oncology settings have resulted in unprecedented access to the genomes of individual tumors. These assays aim to reliably identify
Feb 25 2021

Data Mining and Ramsey Theory

Information
Thursday, February 25, 2021
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Aaron Robertson - Colgate University
Ramsey theory concerns itself with the emergence of patterns in sufficiently large structures. Data miners search for patterns in extremely large data sets. This is a cautionary tale for data
Feb 19 2021

Throwing a Sofa Through the Window

Information
Friday, February 19, 2021
10:00 AM - 11:00 AM
Type: Seminars | DATA-INSPIRE TRIPODS Seminars
Presenter(s): Dan Halperin - Tel-Aviv University
Planning motion for robots and other artifacts toward desired goal positions while avoiding obstacles on the way becomes harder when the environment is tight or densely cluttered. Indeed, prevalent motion-planning
Feb 18 2021

Game Complexity: Between Geography and Santorini

Information
Thursday, February 18, 2021
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Nathan Fox - Canisius University
Santorini, a board game designed by mathematician Gordon Hamilton, is a two-player game of perfect information (a partizan combinatorial game) with simple rules and great depth of strategy. The structure
Feb 17 2021

Stopped Sequences and the Narayana-Zidek-Capell Numbers

Information
Wednesday, February 17, 2021
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Charles Kenney - Rutgers University
Let b=(b_1, b_2, b_3, ...) be a sequence of 0s and 1s. We say b is stopped at time T if, for every index t in (T/2, T], b_t =
Feb 15 2021

Discussion of: Need vs. Merit: The Large Core of College Admissions Markets

Information
Monday, February 15, 2021
4:00 PM - 5:00 PM
Type: Seminars | DIMACS Matching Reading Group
The paper to be presented is: Title: Need vs. Merit: The Large Core of College Admissions Markets Authors: Avinatan Hassidim, Assaf Romm, and Ran I. Shorrer Paper Abstract: We study
Feb 11 2021

Cumulants and Stack-Sorting

Information
Thursday, February 11, 2021
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Colin R Defant - Princeton University
Cumulant sequences are numerical sequences that play a fundamental role in noncommutative probability theory. West's stack-sorting map is a combinatorially-defined operator that acts on permutations. In this talk, we will
Feb 05 2021

Virtual Mixer for Postdocs & Newcomers

Information
Friday, February 5, 2021 - Friday, February 5, 2021
3:00 PM - 5:00 PM
Type: Workshops
Organizer(s): David Pennock | Lazaros Gallos
With most activities being conducted online it can be hard to connect with people when you join a new place or to meet new people who join your organization The goal of this virtual gathering is to introduce the participants to available research and career opportunities through Rutgers DIMACS and
Feb 04 2021

Cyclic Permutations, Shuffles, and Quasi-Symmetric Functions

Information
Thursday, February 4, 2021
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Ron Adin - Bar-Ilan University
Richard Stanley proved that the distribution of descent number over all the shuffles of two permutations depends only on the descent numbers of the permutations. We present an explicit cyclic