Past Events

Given a quadrangulation of a disc, suppose we know all the pairwise distances (measured by the graph metric) between vertices on the boundary of the disc. Somewhat surprisingly, a result

I have taught two courses at Brown University where students have used Lean: one in which formal verification is the subject of the class, and one (in progress) in which

I will report on my experience teaching with Lean in an early-undergraduate (1st and 2nd year students) mathematics course: an intro-to-proof course with an emphasis on concrete numeric examples. The

A finite set system is union-closed if for every pair of sets in the system their union is also in the system. Frankl in 1979 conjectured that for any such

Nokia Bell Labs will host the Spring 2023 DIMACS Mixer featuring an invited presentation by Professor Arian Maleki of Columbia University The event will also include a series of five minute talks and a reception to help people get to know each other and learn more about the breadth of

Suppose that a polynomial has a biased output distribution; does this information alone suffice to deduce that its arithmetic complexity is far from maximal? This question turns out to be

In this talk, we will review progress that has been made by seminar participants to formalize proofs of the Pythagorean theorem in Lean 4. We will discuss future work on

Let G be a bipartite graph on (L,R). Say G is a minimal Hall violator with defect D if |L| = |R|+1+D, and for all l in L, there is

We introduce a new notion of influence—called "convex influence"—for convex sets over Gaussian space which has many of the properties of influences of Boolean functions over the hypercube. Our main

In the graph steaming model, the edges of a graph are presented one by one in an arbitrary order and the algorithms can make one or a limited number of

Many surveys (and other types of databases) suffer from unit and item nonresponse. Typical practice accounts for unit nonresponse by inflating respondents’ survey weights, and accounts for item nonresponse using

Dirac proved that each n-vertex 2-connected graph with minimum degree at least k contains a cycle of length at least min{2k, n}. We prove a hypergraph version of this result:

In this talk, we will discuss the details of defining and using convex polygons in Lean 4. Topics will include how to define a triangulation and the foreseen challenges of

Given an iid binary string conditioned to not have 1001 as a substring, how many 1s and 0s does it typically have? More generally, given a finite set of 'forbidden'

You are invited to a unique workshop where 30 high profile international researchers from all subareas of robotics will highlight their interests and results in spotlight talks The workshop will be held 2 00 PM 5 30 PM The workshop is part of the Program Committee meeting of the 2023

We describe a unified framework for graph labeling problems based on the theory of functional directed graphs. We show that this approach sheds light on algebraic, enumerative and combinatorial design

Weitzman (1979) introduced Pandora's box problem as a mathematical model of sequential search with inspection costs, in which a searcher is allowed to select a prize from one of n

There are many classical constructions of graphs with arbitrarily large minimum degree and without big bicliques. A class of graphs is 𝛿-bounded if, essentially, it avoids all such constructions. We