Logo

EGFs - Shared screen with speaker view
espen slettnes
04:27
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
04:55
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
05:23
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
05:31
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
05:46
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
06:03
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
06:24
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
06:42
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
07:35
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
espen slettnes
09:06
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
Ryan Fu
10:51
|x|<1/2?
Ryan Fu
11:14
1/(1-2x)?
espen slettnes
11:26
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
Ryan Fu
12:37
n! Will eventually become greater than 1
Ryan Fu
12:46
*just gets bigger
espen slettnes
17:32
https://espen.slett.net/BMC_lectures/Exponential_Generating_Functions/2021-09-15.pdf
Ryan Fu
19:18
2^n
Jayanth Sadhasivan
26:21
m1+m2 choose m2
Ryan Fu
37:23
Wait what do you mean putting an A-structure on everything?
Andrew Sylvester
45:58
set fo smaller graphs?
Ryan Fu
46:07
Subset + graphs
Ryan Fu
48:18
3
Ryan Fu
48:26
2
Andrew Sylvester
50:52
ln2
Jayanth Sadhasivan
52:33
can we do the rooted label trees problem
Ryan Fu
58:20
3 rooted trees
Ryan Fu
01:01:49
Wait aren’t you recursively defining the rooted trees thing, as the forests is based off of trees?
Ian McLellan
01:23:05
Oh, that looks familiar...
Jayanth Sadhasivan
01:24:14
-1
Jayanth Sadhasivan
01:30:58
ln(1+x/(1-x))
Jayanth Sadhasivan
01:32:53
binomial theorem
Jayanth Sadhasivan
01:32:55
kind've
Jayanth Sadhasivan
01:41:40
-1^n
Andrew Sylvester
01:43:58
2*n!
Andrew Sylvester
01:44:07
2^n * n!
Jayanth Sadhasivan
01:45:55
2n choose n
Jayanth Sadhasivan
01:52:44
we can root the 1 and delete it to get two smaller alternating permutations
Jayanth Sadhasivan
01:57:17
take an alternating permutation and add 1 between a decrease and subsequent increase
Ian McLellan
02:04:04
sectan and sec^2?
Ian McLellan
02:04:09
Ok yeah
Emma Lynch
02:06:06
thank you so much!!
Ryan Fu
02:06:11
Thank you!
Chang Yu
02:06:11
thank you!
Mingyang Cen
02:06:12
Thank. you
Jayanth Sadhasivan
02:06:13
thank you
Neha Ravikumar
02:06:13
Thank you!
Teresa Marin
02:06:13
Thank you!
Jade Feria
02:06:13
thank you
isaac Salemme
02:06:14
Thanks!
Vinci Ho
02:06:16
thank you!