dimacs logo color

Event Calendar

« Previous Month

August 2026

Next Month »
Sun Mon Tue Wed Thu Fri Sat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

Events

Past Events

Oct 30 2019

An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices

Information
Wednesday, October 30, 2019
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Jarosław Błasiok - Columbia University
We give a short argument that yields a new lower bound on the number of subsampled rows from a bounded, orthonormal matrix necessary to form a matrix with the restricted
Oct 30 2019

DIMACS Executive Committee Meeting

Information
Wednesday, October 30, 2019
12:45 PM - 2:15 PM
Type: Meetings
Oct 28 2019

Graph Powering and Spectral Robustness

Information
Monday, October 28, 2019
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Peter Ralli - Princeton University
Given an original graph G and positive integer r, graph powering produces a graph connecting vertices from the original graph that are within distance r. I will discuss the use
Oct 24 2019

On the Parity of Restricted Partition Functions

Information
Thursday, October 24, 2019
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Amita Malik - Rutgers University
The ordinary partition function is believed to take even values approximately half the time. However, the best results known in this regard are far from confirming this belief. In fact,
Oct 23 2019

The Asymptotic Spectrum of Tensors and Barriers for Fast Matrix Multiplication

Information
Wednesday, October 23, 2019
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Jeroen Zuiddan - Institute for Advanced Study
The theory of asymptotic spectra describes asymptotic behavior of basic objects in mathematics like graphs and tensors. Example applications are the matrix multiplication problem, the cap set problem, the sunflower
Oct 23 2019

Burgess' Bound on Character Sums

Information
Wednesday, October 23, 2019
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Vishwas Bhargava - Rutgers University
Finding the least quadratic non-residue in a finite field is of great interest in number theory, Additive Combinatorics, and Theoretical computer science. We will look into a state-of-the-art bound for
Oct 21 2019

Improved Bounds for Sunflowers

Information
Monday, October 21, 2019
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Ryan Alweiss - Princeton University
An r-sunflower is a collection of r sets so that the intersection of any two are the same. Given a fixed constant r, how many sets of size w can
Oct 17 2019

The Ergonomics of Computer Algebra

Information
Thursday, October 17, 2019
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Robert Dougherty Bliss - Rutgers University
Popular computer algebra systems are rightly praised for automating away the "trivial" parts of mathematical life. These good deeds have, frankly, enabled them to coast along without much critical examination.
Oct 16 2019

Nullstellensatz Size-Degree Trade-offs from Reversible Pebbling

Information
Wednesday, October 16, 2019
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Robert Robere - DIMACS
We discuss recent work in which we establish a tight relationship between Nullstellensatz proofs of the so-called "pebbling" formulas --- which play an important role in a variety of results
Oct 16 2019

A Maximum Determinant Problem

Information
Wednesday, October 16, 2019
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Justin Semonsen - Rutgers University
Here we discuss a method for bounding the maximum determinant of a certain class of zero-one matrices. The methods are based on former Rutgers grad student Danny Scheinerman's recent thesis,
Oct 14 2019

Hypercontractivity, Sharp Thresholds and Extremal Combinatorics

Information
Monday, October 14, 2019
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Dor Minzer - Institute for Advanced Study
The classical hypercontractive inequality for the Boolean hypercube lies at the core of many results in analysis of Boolean functions. Though extensions of the inequality to different domains (e.g. the
Oct 10 2019

Old and New Problems from 55 Years of the OEIS

Information
Thursday, October 10, 2019
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Neil Sloane - OEIS Foundation
Some favorite old and new problems: Dissections; roots of theta series; the Recaman hypothesis; getting to zero by subtracting primes; van Eck's sequence; the Forest Fire sequence; a strange property
Oct 09 2019

Convex Set Disjointness, Distributed Learning of Halfspaces, and LP Feasibility

Information
Wednesday, October 9, 2019
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Shay Moran - Institute for Advanced Study
We study the Convex Set Disjointness (CSD) problem, where two players have input sets taken from an arbitrary fixed domain Usubset R^d of size | U| = n. Their mutual
Oct 09 2019

Correlation Inequalities for Permutations

Information
Wednesday, October 9, 2019
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Yonah Biers-Ariel - Rutgers University
I will present Harris' Inequality for subsets of the Boolean cube before discussing a new correlation inequality due to Johnson, Leader, and Long which applies to sets of permutations rather
Oct 07 2019

Extremal Configurations in Point-Line Arrangements

Information
Monday, October 7, 2019
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Mozhgan Mirzaei - University of California, San Diego
The famous Szemerédi-Trotter theorem states that any arrangement of n points and n lines in the plane determines O(n 4/3) incidences, and this bound is tight. Although there are several
Oct 07 2019

CRM/DIMACS Workshop on Mixed-Integer Nonlinear Programming

Information
Monday, October 7, 2019 - Thursday, October 10, 2019
8:50 AM - 11:00 PM
Type: Workshops
Organizer(s): Bruce Shepherd | Andrea Lodi

Mixed Integer Nonlinear Programming MINLP is the study of optimization models which combine discrete and or continuous variables with non linear constraints and objectives As special cases the fields of mixed integer linear programming MILP and purely continuous convex or local nonlinear optimization NLP are relatively well developed fields The

Oct 03 2019

Ethics and the Future of AI (Panel & Reception)

Information
Thursday, October 3, 2019
6:00 PM - 8:30 PM
Type: Seminars | DIMACS Special Seminar
Presenter(s): Lindsey Zuloaga - HireVue || Vivek Singh - Rutgers University || Susan Schneider - University of Connecticut || David Pennock - Microsoft Research
With the rapid rise of AI, a host of new ethical issues present themselves: biases in algorithms, effects on the future of work, whether we will someday have conscious robots,
Oct 03 2019

Patterns and Partitions

Information
Thursday, October 3, 2019
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Yotam Smilansky - Rutgers University
A colored partition of a set in Rd is its representation as a disjoint union of subsets, referred to as tiles, where each tile is also assigned a color. In
Oct 02 2019

How to Store a Random Walk

Information
Wednesday, October 2, 2019
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Thodoris Lykouris - Microsoft Research
Online learning is a canonical paradigm that sheds light on how to act effectively at the face of uncertainty. Classical results on non-stochastic online learning show robust worst-case guarantees on
Oct 02 2019

Implicit Regularization for Optimal Sparse Recovery

Information
Wednesday, October 2, 2019
9:45 AM - 10:45 AM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Varun Kanade - University of Oxford
We present an implicit regularization scheme for gradient descent methods applied to unpenalized least squares regression to solve the problem of reconstructing a sparse signal from an underdetermined system of