# Seminar - Hao Huang

Friday, January 24, 2014 — 9:30 AM EST

## The Minimum Number of Non-negative Edges in Hypergraphs

Speaker: Hao Huang Institute for Advanced Study and DIMACS Mathematics and Computer Building (MC) 5158

### Abstract:

Extremal combinatorics studies the maximum or minimum possible size of a combinatorial structure satisfying certain properties. In this talk I will briefly review some recent developments in this field and connections with other areas, and focus on the following extremal problem. A hypergraph H is said to have the MMS property if for every assignment of weights to its vertices with non-negative sum, the number of edges whose total weight is non-negative is at least the minimum degree of H. We show that all sufficiently large hypergraphs with equal codegrees have the MMS property. Our result resolves a long-standing conjecture by Manickam, Miklos, and Singhi, which states that for $n>4k$ and any weighting on the 1-dimensional subspaces of F_q^n with non-negative sum, the number of non-negative k-dimensional subspaces is at least n-1 k-1. Joint work with Benny Sudakov.

Location
MC - Mathematics & Computer Building
5158
200 University Avenue West

Waterloo, ON N2L 3G1

### February 2023

S M T W T F S
29
30
31
1
4
5
7
8
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
1
2
3
4
1. 2023 (13)
1. February (5)
2. January (8)
2. 2022 (150)
1. December (8)
2. November (18)
3. October (15)
4. September (11)
5. August (2)
6. July (17)
7. June (17)
8. May (10)
9. April (12)
10. March (18)
11. February (10)
12. January (13)
3. 2021 (103)
4. 2020 (119)
5. 2019 (167)
6. 2018 (136)
7. 2017 (103)
8. 2016 (137)
9. 2015 (136)
10. 2014 (88)
11. 2013 (48)
12. 2012 (39)
13. 2011 (36)
14. 2010 (40)
15. 2009 (40)
16. 2008 (39)
17. 2007 (15)