dimacs logo color

Events

Event Calendar

« Previous Month

August 2026

Next Month »
Sun Mon Tue Wed Thu Fri Sat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

Seminar Details

Cancellative Families

  • Start Date: February 16, 2022
  • Event Start Time: 12:15 PM
  • Event End Time: 1:15 PM
  • Seminar Series: Graduate Combinatorics Seminar
  • Presenter(s): Quentin Dubroff - Rutgers University
  • Event Location: Mathematics Graduate Student Lounge -- 7th Floor | Rutgers University | Hill Center | Mathematics Department
  • Event Additional Info: <p>This seminar is being held in person in The Hill Center, Mathematics Graduate Student Lounge - 7th Floor&nbsp;and online via a simultaneous broadcast on Zoom.</p> <p>Zoom Link: Zoom Link:&nbsp;<a href="https://rutgers.zoom.us/j/96132348862" target="_blank">https://rutgers.zoom.us/j/96132348862</a></p> <p>Password:&nbsp;062487</p>
  • Presentation Type: Stand Alone Presentation
  • 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.