Past Events

Some polynomials are symmetric, some are not. Some count complicated things, some count easier things. Is Schubert a mathematician? Schur! This talk will attempt to bundle everything together and make

Let G be a graph on n vertices with maximum degree D. If we sample a list of (1+o(1)) ln(n) colors uniformly at random from {1,2,...,D+1}, independently for each vertex

Kauers and Koutschan recently performed an automated search of sequences in the OEIS that might satisfy previously unknown recurrences. Among many promising hits was a 2014 sequence about king-moves on

Topological Data Analysis (TDA) unfolds a rich tapestry of techniques rooted in algebraic topology, enabling a deep exploration of data's inherent shape and structure. Its versatility finds resonance across a

In this talk I'll briefly introduce percolation theory, which is in the intersection of probability theory, network theory and statistical mechanics. It's raised from this question: If we 2-color all

The joints problem asks to determine the maximum number of joints N lines can form, where a joint in a d-dimensional space is a point on d lines in linearly

Foundation models models trained on large datasets which can easily adapt to many tasks using few shot or zero shot learning are a major paradigm shift in AI A primary example are Large Language Models LLMs such as ChatGPT which through natural language prompting and interaction can already provide significant

We prove that there exists an online algorithm that for any sequence of vectors v_1, ..., v_T in R^n of Euclidean norm at most 1, arriving one at a time,

Sperner's Lemma tells us that any 'good' colouring of the vertices of a triangulated simplex admits a rainbow-coloured subsimplex. In this talk, we will understand what this theorem says, and

Announcement The CCICADA Fall Mixer will be held on October 13 2023 from 12 00 1 30 pm in the Lounge on the fourth floor of the CoRE Building on Busch Campus There will be short 2 minute presentations plus a short presentation by Fred Roberts CCICADA Director

Consider (say) three gamblers with initial capital A, B , C. Each time a pair of gamblers are picked (uniformly at random), a fair coin is flipped and $1 is

We develop a framework for efficiently transforming certain approximation algorithms into differentially-private variants, in a black-box manner. Specifically, our results focus on algorithms A that output an approximation to a

A Poisson random variable Y with parameter t has, for all n in N, probability(Y=n) = t^n / (n! e^t). The Brun sieve is a method in the Poisson Paradigm/Poisson

We discuss a new upper bound for the Heilbronn triangle problem, showing that for sufficiently large $n$ in every configuration of $n$ points chosen inside a unit square there exists

Previous work on user-level differential privacy (DP) [Ghazi et al., NeurIPS 2021; Bun et al., STOC 2023] obtained generic algorithms that work for various learning tasks. However, their focus was

How many edges can an n-vertex graph have if it contains no copy of a cycle on 4 vertices? A nice and simple argument shows that the answer is at

A real linear combination of products of minors which is nonnegative over all totally nonnegative (TN) matrices is called a determinantal inequality for these matrices. It is referred to as

Recent years have shown a rise in the number of discoveries in fields of mathematics that are being assisted by computer algorithms, primarily for exploring large parameter spaces that humans

In the strong form of the thin tree conjecture, formulated by Goddyn in 2004, we are given a k-edge-connected graph and wish to find a tree containing at most an

Undergrads think of all functions being defined on the reals, but combinatorists often prefer functions on the Boolean cube. Come hear about different correlation inequalities for functions and how local