Past Events

Given a (finite) graph G, there is a natural finite abelian group we can associate to G, called its Jacobian group. There are different sources of motivation for studying these

A martingale is a sequence of random variables that maintain their future expected value conditioned on the past. A $[0,1]$-bounded martingale is said to polarize if it converges in the

A (uniform) hypergraph is c-colorable if its vertices can be assigned colors from 1,...,c so that no hyperedge is monochromatic. A hypergraph is r-rainbow colorable (or r-polychromatic) if its vertices

In this summary of my thesis research, I will explain how we used experimental mathematics methods to discover new results about random walks, simultaneous core partitions, and Boolean functions.

The main goal of these projects was utilizing experimental mathematics to further our knowledge of several areas in math. We begin by tweaking a proof of unimodality by O'Hara to

Nisan [Nis92] constructed a pseudorandom generator for length n, width n read-once branching programs (ROBPs) with error ε and seed length O(log^2(n) + log(n) · log(1/ε)). A major goal in

A strictly increasing sequence of positive integers (a_n) is said to be (weakly) complete if every sufficiently large positive integer is representable as a sum of distinct terms of (a_n).

The Univalent Foundations is a proposed foundation for mathematics in which the basic objects are spaces, rather than sets. I will introduce the basic ideas of the Univalent Foundations, explain

The notion of bounded VC dimension is a property at the intersection of combinatorics and probability. This family has been discovered repeatedly and studied from various perspectives - for instance,

An n×n matrix H with terms in {-1,1} is called an Hadamard matrix if HHT = HTH = nIn . A matrix W with terms in {-1,0,1} is called a

In a program dating back to the March 2015 Maritime Cyber Security Learning Seminar and Symposium held at CCICADA the center has been the research lead for a university Coast Guard initiative on maritime cyber security In this initiative the USCG poses research challenges and different members of the research

We will talk about parking functions and some related combinatorial structures, e.g., labelled forests, noncrossing partitions and Shi arrangements.

In this talk, we will discuss recent progress in the study of random functions with a focus on a general framework to prove some universality properties of the roots of

Two of Doron's favorite mathematicians are J. J. Sylvester and Major P. A. MacMahon. I will make Doron happy by using bijective ideas drawn from the work of the former

In this paper we study the identity testing problem of arithmetic read-once formulas (ROF) and some related models. A read-once formula is formula (a circuit whose underlying graph is a

First introduced in 1917 by Henry Dudeney, the No-Three-In-Line problem asks for the maximum number of points that can be placed in an N by N grid such that no

What is the maximum possible number of words in a binary code of length n so that there is no Hamming ball of radius (1/4+epsilon)n containing more than two words

After the announcement for the transition to post-quantum secure cryptographic constructions by the US National Security Agency the cryptography community has been working towards developing and evaluating standards. Of particular

In a sequence of extremely fundamental results in the 80's, Kaltofen showed that any factor of n-variate polynomial with degree and arithmetic circuit size poly(n) has an arithmetic circuit of