Past Events

I will discuss a curious property of graphs whose edge set is the solution set of (bilinear) equations, and how it turned out to be important in a recent resolution

Pablo Blanco's talk information: Title: Generating functions of sequences relating to spanning trees in certain graph families Generating functions of sequences relating to spanning trees in certain graph families Abstract:

Trading on decentralized exchanges has been one of the primary use cases for permissionless blockchains with daily trading volume exceeding billions of U.S. ‍dollars. In the status quo, users broadcast transactions

Consider shuffling a deck of $n$ cards, labeled $1$ through $n$, as follows: at each time step, pick one card uniformly with your right hand and another card, independently and

**Please note date change to April 25, 2025!** While resilience of infrastructure networks with fixed size and topology have been quantified using network science methods, the underlying mechanisms have not

A popular approach to speed up computations is to reduce the input modulo several relatively prime numbers, do arithmetic on the residues, then reconstruct the result at the end. This

Participatory budgeting (PB) is a form of citizen participation that allows citizens to decide how public funds are spent. Through an election, citizens express their preferences over various projects (spending

Motivated by a wide variety of applications arising in practice, such as computer capacity planning and business process management, we develop a mathematical framework for determining the optimal resource capacity

Khovanov homology is a combinatorially defined invariant for links which categorifies the Jones polynomial. Khovanov’s method has inspired other efforts to categorify classical invariants; in particular the chromatic polynomial for

Determining how many copies are necessary and sufficient to identify an unknown n-qubit mixed quantum state is a fundamental problem in quantum information. In the first part of this talk,

I present some (idealized) problems from condensed matter physics and cluster chemistry that lead to mathematical insights that seem to fly in the face of the scientists' intuition

Title TBA Guest Speaker Dr Erez Agmoni Co Founder and General Partner at Interwoven VC Time 12 00 1 30 pm About the Speaker The featured speaker will be Dr Erez Agmoni Co Founder and General Partner at Interwoven VC where he leverages 25 years of expertise in supply chain

The All-Pairs Max-Flow problem (APMF) asks to compute the maximum flow (or equivalently, the minimum cut) between all pairs of nodes in a graph. The naive solution of making n^2

We will offer one answer to the following question. Why would anyone want to solve for the formal variable in a generating function?

DIMACS visitor Professor Mingsheng Ying University of Technology Sydney will give a special tutorial on semantics of quantum program Tuesday April 15 2025 1 3 pm in CoRE 433 DIMACS conference room This will be in person but if you cannot make it we will broadcast the talk on zoom

DIMACS visitor Zhicheng Zhang from University of Technology, Sydney kindly agreed to give a mini course on quantum recursive programs. The mini course will run Tuesdays and Thursdays, from Thursday,

DIMACS visitor Zhicheng Zhang University of Technology Sydney kindly agreed to give a mini course on quantum recursive programs The mini course will begin Thursday April 10 2025 from 11 am to 12 30pm in CoRE 433 the conference room The course is intended to be a beginner s guide

DIMACS visitor Zhicheng Zhang from University of Technology, Sydney kindly agreed to give a mini course on quantum recursive programs. The mini course will run Tuesdays and Thursdays, from Thursday,

In the maximum coverage problem we are given d subsets from a universe [n], and the goal is to output k subsets such that their union covers the largest possible