Past Events

Event Calendar

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

All words

Any words

Exact phrase

Event Type

Oct 02 2019

Combinatorial Group Theory

Information: Wednesday, October 2, 2019; 12:15 PM - 1:15 PM; Type: Seminars | Graduate Combinatorics Seminar; Presenter(s): Corrine Yap - Rutgers University; Description
What do groups have to do with graphs? How can one use graph properties to say something about group structure? What do the words "combinatorial group theory" even mean? We

Oct 02 2019

DIMACS Council Meeting

Information: Wednesday, October 2, 2019; 12:45 PM - 2:15 PM; Type: Meetings

Sep 30 2019

On Some Properties of Graph Norms

Information: Monday, September 30, 2019; 2:00 PM - 3:00 PM; Type: Seminars | Rutgers Discrete Mathematics Seminar; Presenter(s): Joonkyung Lee - University of Hamburg; Description
For a graph H, its homomorphism density in graphs naturally extends to the space of two-variable sym-metric functions W in Lp, p ≥ e(H), denoted by tH(W). One may then

Sep 26 2019

Flexible Schemes for Pattern-Avoiding Permutations

Information: Thursday, September 26, 2019; 5:00 PM - 6:00 PM; Type: Seminars | Experimental Math Seminar; Presenter(s): Yonah Biers-Ariel - Rutgers University; Description
We present an extension of the enumeration schemes of Zeilberger and Vatter so that they can efficiently enumerate many new classes of pattern-avoiding permutations including all such classes with a

Sep 25 2019

A Quick Introduction to Entropy

Information: Wednesday, September 25, 2019; 12:15 PM - 1:15 PM; Type: Seminars | Graduate Combinatorics Seminar; Presenter(s): Jinyoung Park - Rutgers University; Description
We introduce the entropy of a discrete random variable and discuss some quick applications. This talk is mostly based on Galvin's lecture notes: https://arxiv.org/abs/1406.7872

Sep 23 2019

Exact Quantitative Versions of Helly's Theorem

Information: Monday, September 23, 2019; 2:00 PM - 3:00 PM; Type: Seminars | Rutgers Discrete Mathematics Seminar; Presenter(s): Pablo Soberon - Baruch College, City University of New York; Description
Helly’s theorem gives a characterization of families of convex sets in R^d with non-empty intersection. Its quantitative versions aim to characterize families of convex sets with “large” intersection, which can

Sep 19 2019

Contour Approximation of Data, with Applications

Information: Thursday, September 19, 2019; 5:00 PM - 6:00 PM; Type: Seminars | Experimental Math Seminar; Presenter(s): Adi Ben-Israel - Rutgers University; Description
Given a set of points S in Rn (the data), a contour approximation of S is a function that captures most points of S in its lower level sets, A

Sep 18 2019

On Multilinear Forms: Bias, Correlation, and Tensor Rank

Information: Wednesday, September 18, 2019; 11:00 AM - 12:00 PM; Type: Seminars | Theoretical Computer Science Seminar; Presenter(s): Abhishek Bhrushundi - Rutgers University; Description
In this paper, we prove new relations between the bias of multilinear forms, the correlation between multilinear forms and lower degree polynomials, and the rank of tensors over GF(2). Our

Sep 18 2019

A Spectral Proof of Katona's T-Intersection Theorem

Information: Wednesday, September 18, 2019; 12:15 PM - 1:15 PM; Type: Seminars | Graduate Combinatorics Seminar; Presenter(s): Aditya Potukuchi - Rutgers University; Description
Katona's theorem stated that a maximal t-intersecting family has size at most \binom{n}{\geq (n+t)/2}. The proof is by a tricky shifting argument. We will see a Fourier proof of the

Sep 16 2019

On the threshold for simple connectivity in random 2-complexes

Information: Monday, September 16, 2019; 2:00 PM - 3:00 PM; Type: Seminars | Rutgers Discrete Mathematics Seminar; Presenter(s): Yuval Peled - New York University (NYU); Description
Connectivity of random graphs is one of the classical and well-studied topics in random graph theory. We will talk about a topological 2-dimensional counterpart of this question. Consider a random

Sep 16 2019

DIMACS Workshop on Randomized Numerical Linear Algebra, Statistics, and Optimization

Information: Monday, September 16, 2019 - Wednesday, September 18, 2019; 8:30 AM - 5:00 PM; Type: Workshops; Organizer(s): Petros Drineas | Michael Mahoney | Aleksander MÄ…dry | David P. Woodruff; Description
Many tasks in machine learning statistics scientific computing and optimization ultimately boil down to numerical linear algebra Randomized numerical linear algebra RandNLA exploits randomness to improve matrix algorithms for fundamental problems like matrix multiplication and least squares using techniques such as random sampling and random projection RandNLA has received a

Sep 13 2019

Fall 2019 Mixer at Microsoft Research NYC

Information: Friday, September 13, 2019 - Friday, September 13, 2019; 2:00 PM - 5:00 PM; Type: Workshops; Organizer(s): Lazaros Gallos | David Pennock | Fred Roberts; Description
Microsoft Research NYC will host the Fall 2019 DIMACS Mixer The Mixer will give the DIMACS community a chance to learn about new things that are happening at DIMACS while meeting new people and reconnecting with others The event features an invited talk entitled A Calculus for Brain Computation by

Sep 12 2019

The Peaceable Queens Problem

Information: Thursday, September 12, 2019; 5:00 PM - 6:00 PM; Type: Seminars | Experimental Math Seminar; Presenter(s): Yukun Yao - Rutgers University; Description
We will talk about the peaceable queens problem, the protagonist of OEIS sequence A250000, and our partial progresses. Symbolically, we prove that Jubin’s construction of two pentagons is at least

Sep 11 2019

Improved Truthful Mechanisms for Combinatorial Auctions with Submodular Bidders

Information: Wednesday, September 11, 2019; 11:00 AM - 12:00 PM; Type: Seminars | Theoretical Computer Science Seminar; Presenter(s): Sepehr Assadi - Princeton University; Description
A longstanding open problem in Algorithmic Mechanism Design is to design computationally-efficient truthful mechanisms for (approximately) maximizing welfare in combinatorial auctions with submodular bidders. The first such mechanism was obtained

Sep 09 2019

The Number of Maximal Independent Sets in the Hamming Cube

Information: Monday, September 9, 2019; 2:00 PM - 3:00 PM; Type: Seminars | Rutgers Discrete Mathematics Seminar; Presenter(s): Jinyoung Park - Rutgers University; Description
Let Q_n be the n-dimensional Hamming cube (hypercube) and N = 2^n . We prove that the number of maximal independent sets in Q_n is asymptotically 2n2^(N/4), as was conjectured

Aug 19 2019

1st Workshop on Advanced Cryptography Standardization (ACS'19)

Information: Monday, August 19, 2019 - Monday, August 19, 2019; 9:00 AM - 5:30 PM; Type: Workshops; Description
This workshop is an affiliated event of the Crypto 2019 Conference It is presented under the auspices of the DIMACS Special Focus on Cryptography as part of the DIMACS Simons Collaboration in Cryptography The Crypto 2019 Conference will be preceded by several one day affiliated workshops and the Workshop on

Jul 19 2019

Computational Complexity Conference - CCC'19

Information: Friday, July 19, 2019 - Sunday, July 21, 2019; 8:30 AM - 5:35 PM; Type: Workshops; Organizer(s): Swastik Kopparty | Tamra Carpenter | Shubhangi Saraf | Eric Allender | Periklis Papakonstantinou | Mike Saks; Description
Link to the CCC 19 main page http computationalcomplexity org Scope CCC aims to foster research in all areas of computational complexity theory studying the absolute and relative power of computational models under resource constraints Typical models include deterministic nondeterministic randomized and quantum models uniform and nonuniform models Boolean algebraic

Jul 18 2019

DIMACS Day of Complexity Tutorials

Information: Thursday, July 18, 2019 - Thursday, July 18, 2019; 8:30 AM - 5:00 PM; Type: Workshops; Organizer(s): Eric Allender; Description
The annual Computational Complexity Conference CCC 19 will be held at Rutgers University on July 18 20 2019 The DIMACS Day of Complexity Tutorials immediately precedes the conference and will feature two half day tutorials on topics that are deemed to be especially exciting and relevant for the CCC community

Jul 16 2019

CoSP Workshop and School on Algorithms and Complexity

Information: Tuesday, July 16, 2019 - Wednesday, July 17, 2019; 9:00 AM - 4:00 PM; Type: Workshops; Organizer(s): Martin Loebl | Michal KouckÃ½; Description
The workshop will bring together students and researchers working in algorithms computational complexity and combinatorics It will consist of four tutorials on recent advances in those fields in mornings and will allow for work in smaller groups in the afternoon The tutorial speakers are Eric Allender Rutgers University Alexandr Andoni

Jul 09 2019

Model Theory and Combinatorics

Information: Tuesday, July 9, 2019; 2:00 PM - 3:00 PM; Type: Seminars | REU Seminar; Presenter(s): Sam Braunfeld - Rutgers University; Organizer(s): Lazaros Gallos; Description
I will discuss some interactions between model theory and combinatorics. Due to the facts that I will not be assuming model theory knowledge, that I plan to discuss several topics,

Event Calendar

August 2026

Events

Past Events