Virtual Discrete Math Colloquium

Name: Cosmin Pohoata, Convex polytopes from fewer points
Start: 2022-12-01T10:00:00+09:00
End: 2022-12-01T11:00:00+09:00
Location: Zoom ID: 224 221 2686 (ibsecopro)

S	M	T	W	T	F	S
		1 0 events, 1	2 0 events, 2	3 0 events, 3	4 0 events, 4	5 0 events, 5
6 0 events, 6	7 0 events, 7	8 0 events, 8	9 1 event, 9 4:30 PM - 5:30 PM Hugo Jacob, On the parameterized complexity of computing tree-partitions Wednesday, November 9, 2022 @ 4:30 PM - 5:30 PM KST Hugo Jacob, On the parameterized complexity of computing tree-partitions Following some recent FPT algorithms parameterized by the width of a given tree-partition due to Bodlaender, Cornelissen, and van der Wegen, we consider the parameterized problem of computing a decomposition. We prove that computing an optimal tree-partition is XALP-complete, which is likely to exclude FPT algorithms. However, we prove that computing a tree-partition of approximate … Continue Reading	10 0 events, 10	11 0 events, 11	12 0 events, 12
13 0 events, 13	14 0 events, 14	15 0 events, 15	16 0 events, 16	17 1 event, 17 10:00 AM - 11:00 AM Chong Shangguan (上官冲), On the sparse hypergraph problem of Brown, Erdős and Sós Thursday, November 17, 2022 @ 10:00 AM - 11:00 AM KST Chong Shangguan (上官冲), On the sparse hypergraph problem of Brown, Erdős and Sós For fixed integers r≥3,e≥3, and v≥r+1, let fr(n,v,e) denote the maximum number of edges in an n-vertex r-uniform hypergraph in which the union of arbitrary e distinct edges contains at least v+1 vertices. In 1973, Brown, Erdős and Sós initiated the study of the function fr(n,v,e) and they proved that Ω(ner−ve−1)=fr(n,v,e)=O(n⌈er−ve−1⌉). … Continue Reading	18 0 events, 18	19 0 events, 19
20 0 events, 20	21 0 events, 21	22 0 events, 22	23 0 events, 23	24 0 events, 24	25 0 events, 25	26 0 events, 26
27 0 events, 27	28 0 events, 28	29 0 events, 29	30 0 events, 30