# Graph Theory seminar

Thursday, October 10, 2013 — 3:30 PM to 4:30 PM EDT

## A Proof of the Manickam-Mikl\'{o}s-Singhi Conjecture for Vector Spaces

Speaker: Ameera Chowdhury Carnegie Melon University Mathematics and Computer Building (MC) 5158

### Abstract:

Let $V$ be an $n$-dimensional vector space over a finite field.
Assign a real-valued weight to each $1$-dimensional subspace in $V$ so
that the sum of all weights is zero. Define the weight of a subspace $S \subset V$ to be the sum of the weights of all the $1$-dimensional
subspaces it contains. We prove that if $n \geq 3k$, then the number of
$k$-dimensional subspaces in $V$ with nonnegative weight is at least the
number of $k$-dimensional subspaces in $V$ that contain a fixed
$1$-dimensional subspace. This result verifies a conjecture of Manickam
and Singhi from 1988.

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

Waterloo, ON N2L 3G1

### December 2019

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