Nov 27 2018

The Wright Stuff: Celebrating Rebecca Wright and Her Initiatives at DIMACS

Information
Tuesday, November 27, 2018 - Tuesday, November 27, 2018
9:00 AM - 8:00 PM
Type: Workshops
Organizer(s): Anand Sarwate | Tamra Carpenter | Fred Roberts

Rebecca Wright joined Rutgers as DIMACS s first Deputy Director and a faculty member in the Department of Computer Science in 2007 She went on to assume her current position as Director of DIMACS at the start of the 2011 12 academic year During her time at DIMACS first as

Nov 26 2018

Powers of Hamiltonian Cycles in Randomly Augmented Graphs

Information
Monday, November 26, 2018
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Mathias Schacht - Yale University
We study the existence of powers of Hamiltonian cycles in graphs with large minimum degree to which some additional edges have been added in a random manner. It follows from
Nov 19 2018

The Chromatic Index of Random Multigraphs

Information
Monday, November 19, 2018
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Gal Kronenberg - Tel-Aviv University
For a (multi)graph G=(V,E), we denote by χ'(G) the minimum number of colors needed to color the edges of G properly. Clearly, Δ≤χ'(G). Vizing proved that χ'(G)≤ Δ(G)+μ(G), where μ(G)
Nov 15 2018

Machine Learning and Ballistics: a Data Analytics Project in Partnership with the New Jersey State Police

Information
Thursday, November 15, 2018
12:00 PM - 1:00 PM
Type: Seminars | CCICADA Seminar Series in Homeland Security
Presenter(s): Christie Nelson - DIMACS
Christie Nelson and students in the Professional Masters program in Business and Science have partnered with the NJ State Police Forensics Lab on a ballistics data analysis project, utilizing machine
Nov 14 2018

Keith Hopefully Finally Talks About Containers

Information
Wednesday, November 14, 2018
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Keith Frankston - Rutgers University
I might actually talk about the method of containers. This is a powerful technique that was only developed in the last decade and has been used to prove some long
Nov 14 2018

Online Bipartite Matching with Amortized O(log^2 N) Replacements

Information
Wednesday, November 14, 2018
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Aaron Bernstein - Harvard University
In the online bipartite matching problem with replacements, all the vertices on one side of the bipartition are given, and the vertices on the other side arrive one by one
Nov 12 2018

Local Limit Theorems on Random Graphs

Information
Monday, November 12, 2018
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Ross Berkowitz - Rutgers University
What is the probability that a random graph has exactly the average number of copies of $K_5$? We will discuss a new technique developed since our last talk at Rutgers
Nov 08 2018

Factoring Random Polynomials

Information
Thursday, November 8, 2018
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Phil Wood - University of Wisconsin, Madison
Can you factor a random polynomial with integer coefficients into smaller factors also with integer coefficients? Work on this simple question goes back more than 80 years, and there is
Nov 07 2018

The Important Graphs are Indeed Important

Information
Wednesday, November 7, 2018
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Jinyoung Park - Rutgers University
Earlier this semester, Aditya showed a construction of "important graphs." In this talk, we will see these graphs are indeed important. Based on Noga Alon's talk at https://www.renyi.hu/conferences/ll70/ .
Nov 07 2018

Efficient Algorithms for Tensor Scaline, Quantum Marginals, and Moment Polytopes

Information
Wednesday, November 7, 2018
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Cole Franks - Rutgers University
In many cases, a group action on a manifold can be associated with a map called a moment map. Surprisingly, the image of the manifold under this map is always
Nov 05 2018

The Upper Tail for Triangles in Sparse Random Graphs

Information
Monday, November 5, 2018
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Wojtek Samotij - Tel-Aviv University
Let X denote the number of triangles in the random graph G(n, p). The problem of determining the asymptotics of the rate of the upper tail of X, that is,
Nov 01 2018

Schemes for Words

Information
Thursday, November 1, 2018
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Yonah Biers-Ariel - Rutgers University
We build schemes to count the number of words avoiding a certain (finite) set of patterns. We can handle (at least in principle) infinitely many such sets of patterns.
Oct 31 2018

Faculty Research Talks (in conjunction with Graduate Algebra and Representation Theory Seminar (GARTS))

Information
Wednesday, October 31, 2018
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): Vladimir Retakh - Rutgers University
Introduction to Noncommutative Birational Geometry I will discuss several phenomena related to noncommutative triangulations of surfaces.
Oct 30 2018

DIMACS Executive Committee Meeting

Information
Tuesday, October 30, 2018
12:30 PM - 2:15 PM
Type: Meetings
Oct 29 2018

Bootstrap Percolation on Uniform Attachment Graphs

Information
Monday, October 29, 2018
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Huseyin Acan - Rutgers University
Bootstrap percolation is a process defined on a graph, which starts with a set S of initially infected vertices. Afterward, at each step, an uninfected vertex with at least r
Oct 25 2018

Using Number Theory and Combinatorial Optimization to Solve a Problem in Statistics

Information
Thursday, October 25, 2018
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Andrew Sills - Georgia Southern University
Using Number Theory and Combinatorial Optimization to Solve a Problem in Statistics
Oct 24 2018

Probing Algorithms for Combinatorial Optimization Under Uncertainty

Information
Wednesday, October 24, 2018
11:00 AM - 12:00 PM
Type: Seminars | Theoretical Computer Science Seminar
Presenter(s): Sahil Singla - Princeton University
Combinatorial optimization is important because it captures many natural problems, e.g., spanning tree, bipartite matching, set cover, network design, clustering, and submodular/subadditive optimization. Classically, these problems have been studied in
Oct 24 2018

It's Hard to Find a Stable Marriage: Strategic Exploitation of the Gale-Shapley Algorithm

Information
Wednesday, October 24, 2018
12:15 PM - 1:15 PM
Type: Seminars | Graduate Combinatorics Seminar
Presenter(s): John Chiarelli - Rutgers University
The stable marriage problem is a classic one in the library of discrete math. The best-known results on the problem stem from the work of David Gale and Lloyd Shapley,
Oct 22 2018

Limiting Eigenvalue Distribution for the Non-Backtracking Matrix of an Erdos-Renyi Random Graph

Information
Monday, October 22, 2018
2:00 PM - 3:00 PM
Type: Seminars | Rutgers Discrete Mathematics Seminar
Presenter(s): Phil Wood - University of Wisconsin, Madison
A non-backtracking random walk on a graph is a directed walk with the constraint that the last edge crossed may not be immediately crossed again in the opposite direction. This
Oct 18 2018

Applying Representation Theory to Random Walks

Information
Thursday, October 18, 2018
5:00 PM - 6:00 PM
Type: Seminars | Experimental Math Seminar
Presenter(s): Angela Hicks - Lehigh University
We'll talk about how representation theory can be used to determine fundamental questions about the rate of convergence of random walks on groups, and how the approach benefits from computer