Past Events

The multi-armed bandits (MABs) model has been studied extensively in theoretical computer science and machine learning. Motivated by modern large-scale applications, a recent line of work has focused on streaming

Let denote the maximum number of edges in an -free subgraph of the random -uniform hypergraph . Following recent work of Conlon, Lee, and Sidorenko, we prove non-trivial lower bounds

Decision Processes are driven by information retrieved elaborated constructed in order to be helpful for the process itself Under what conditions can we trust and use such information when we need to make a decision In this context a key concept is meaningfulness The truth or falsity of a statement

What are all the ways to arrange N hard spheres into a rigid packing? And what can the solution tell us about how materials crystallize? I will introduce an algorithm

Continual counting is one of the fundamental problems studied in the literature of differential privacy with applications ranging from histogram estimation, graph analysis, matrix approximation, online optimization, and first provably

When developing mathematics collaboratively on a blackboard, it is easy and natural to draw things and to refer to them: "Which polynomial?" "This one!" (said while pointing at, or otherwise

I will talk about how to define the dimension of a poset and some results on dimensions of various posets. The main focus will be on "layers of the hypercube":

We prove that the multivariate independence polynomial of any hypergraph of maximum degree $\Delta$ has no zeroes on the complex polydisc of radius $\sim\frac{1}{e\Delta}$, centered at the origin. Up to

The edge space of a graph G is the vector space of functions from E(G) to F_2 (the two-element field) with members naturally identified with subgraphs of G, and the

Recent applications of Zeilberger's algorithm and the WZ method within areas such as numerical analysis and computer algebra are to be explored and discussed. Link to video: https://vimeo.com/887726060 Password: john211532

We consider the classic Correlation Clustering problem: Given a complete graph where edges are labelled either + or −, the goal is to find a partition of the vertices that

A configuration is a 0,1-matrix where rows are seen as points and columns as sets. Many problems in extremal combinatorics can be seen through the lens of configurations, such as

The topic is the Linear Algebra Game ( https://stavan-jain.github.io/linear_algebra_game/ ) by Colleen Robles (Duke University), her students Annapurna Bhattacharya, Stavan Jain, Ricardo Prado Cunha, Anoushka Sinha and the project manager

The frog model describes random activation and spread. Think combustion or an epidemic. I have studied these dynamics on d-ary trees for ten years. I will discuss our progress and

In this podcast, Vladimir Sedlacek discusses with André Hernández-Espiet, (Rutgers University), his work on formalizing Euclidean geometry, different communities around The Lean theorem prover and much more: https://www.mistoproblemu.cz/e/28-andre-hernandez-espiet-euclid-employment-and-education/ .

The problem of understanding the structure of transcendental objects has fascinated mathematicians for well over a century. Combinatorics provides an intuitive framework to study power series. A combinatorial family is

A recent line of work has shown a surprising connection between multicalibration, a multi-group fairness notion, and omniprediction, a learning paradigm that provides simultaneous loss minimization guarantees for a large

What is the probability the following graphs are isomorphic? Two random graphs random graphs on n verticies with probability p. Two random graphs random graphs on verticies with probability p.

For a given prime p and a dimension n, the Erdos-Ginzburg-Ziv problem asks about the smallest number s such that any subset in F_p^n of size s contains p vectors

Decentralized cryptocurrencies rely on aligning the incentives of users and miners to operate correctly and offer a high QoS to users. Recent literature studies the mechanism design problem of the