Past Events

WZ Theory is a powerful method to automatically conjecture and prove identities involving hypergeometric series. I will give an overview of the method and important results

(1) A set D of natural numbers is called t-intersective if every positive upper density subset A of natural numbers contains a (t+1)-length arithmetic progression (AP) whose common differences is

This talk will discuss minimal length representations of the Natural numbers under elements from a pre-defined symbol library O. We will mostly focus on symbol libraries consisting of 1 and

This work studies distributed learning in the spirit of Yao's model of communication complexity: consider a two-party setting, where each of the players gets a list of labelled examples and

Tuza's Conjecture states that the triangle cover number is at most 2 times the triangle matching number for every graph G (don't worry, I will define what those two numbers

For two fixed graphs $T$ and $H$, a positive integer $n$ and a real number $p \in [0,1]$ let $ex(G(n,p),T,H)$ be the random variable counting the maximum number of copies

In recent years, Sun proposed several sophisticated conjectures on congruences for finite sums with terms involving combinatorial sequences such as central trinomial coefficients, Domb numbers and Franel numbers. These sums

Let $Q_d$ be the $d$-dimensional Hamming cube (hypercube) and $N=2^d$. We discuss the number of proper (vertex) colorings of $Q_d$ given $q$ colors. It is easy to see that there

In this talk, we will talk about the concepts and properties of parking functions, the bijection between parking functions and rooted labelled forests, and the area statistic of parking functions.

I will describe the construction of an explicit (family of) graph(s) due to Alon, which has many interesting and seemingly different extremal properties. Two of these that I will try

The Graham-Pollak theorem states that, if we wish to decompose the complete graph on n vertices into complete bipartite subgraphs, we need at least n-1. What happens for hypergraphs? We

Relative entropy of a probability measure, relative to a given a priori measure, is a well-defined and extremely useful notion in probability, statistics, and statistical mechanics. A question by Alice

What is a proof? What is a proof to a computer? In this talk, we will develop a number of ways to prove whether two graphs are isomorphic or not,

While every (nice enough) even function f : [−π, π] → C may be uniquely expressed as a cosine series f(θ) = X r∈Z Cr cos(rθ), the relationship between the

The classical Tamari lattice Yn is defined as the set of binary trees with n internal nodes, with the partial ordering induced by the (right) rotation operation. It is not

Data Science Technology and the Intelligence Community An Examination of Successful Strategies Learn how data science and emerging technologies can support the development of actionable intelligence through an examination of successful strategies and case studies This program is ideal for Intelligence Community professionals federal state and local law enforcement and

My main goal in this talk is to present an interesting algebraic proof of Sperner's theorem on the size of anti-chains. This proof can also be understood using the representation

For which graphs H is it true that there is an epsilon > 0 such that for all n > 1, and for every n-vertex graph G that does not