Quentin Dubroff, Rutgers University

Abstract

A family of subsets is cancellative if A U B = A U C implies B = C for any A,B,C in the family. Frankl and Furedi proved an upper bound on the size of cancellative families using a very short probabilistic argument. Surprisingly, this upper bound is essentially exact, and the example is another quick(ish) application of the probabilistic method. After presenting these two nice results, I'll mention some related questions which remain unsolved.

This seminar is being held in person in The Hill Center, Mathematics Graduate Student Lounge - 7th Floor and online via a simultaneous broadcast on Zoom.

Zoom Link: Zoom Link: https://rutgers.zoom.us/j/96132348862

Password: 062487