Tuan Tran, Anti-concentration phenomena
Let $X$ be a real random variable; a typical anti-concentration inequality asserts that (under certain assumptions) if an interval $I$ has small length, then $\mathbb{P}(X\in I)$ is small, regardless the …
10 events found.
Discrete Math Seminar
Events
-
-
Room B232 IBS (기초과학연구원)
-
Ben Lund, Point-plane incidence bounds
Room B232 IBS (기초과학연구원)In the early 1980s, Beck proved that, if P is a set of n points in the real plane, and no more than g points of P lie on any …
-
Junguk Lee (이정욱), A quick introduction to stability and NIP: Part I. Basic first order logic
Room B232 IBS (기초과학연구원)I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. …
-
Junguk Lee (이정욱), A quick introduction to stability and NIP: Part II. Stability
Room B232 IBS (기초과학연구원)I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. …
-
-
Junguk Lee (이정욱), A quick introduction to stability and NIP: Part III. NIP
Room B232 IBS (기초과학연구원)I give a quick survey on stability and NIP(Non-Independent Property). We first review basic facts on the first order logic and give some historical remarks on classification theory in model theory. …
-
Rutger Campbell, Disasters in abstracting combinatorial properties of linear dependence
Room B232 IBS (기초과학연구원)Let E be a finite set and I be a collection of subsets of E. When is there a set of real vectors indexed by E such that I correspond to its linearly independent subsets? In 1935, …
-
Debsoumya Chakraborti, Maximum number of cliques in a graph with bounded maximum degree
Room B232 IBS (기초과학연구원)Generalized extremal problems have been one of the central topics of study in extremal combinatorics throughout the last few decades. One such simple-looking problem, maximizing the number of cliques of …
-
Jinha Kim (김진하), Collapsibility of Non-Cover Complexes of Graphs
Room B232 IBS (기초과학연구원)Let $G$ be a graph on the vertex set $V$. A vertex subset $W \subset V$ is a cover of $G$ if $V \setminus W$ is an independent set of …
-
Minki Kim (김민기), Complexes of graphs with bounded independence number
Room B232 IBS (기초과학연구원)Let $G$ be a graph on $V$ and $n$ a positive integer. Let $I_n(G)$ be the abstract simplicial complex whose faces are the subsets of $V$ that do not contain …
-
-
Joonkyung Lee (이준경), On graph norms for complex-valued functions
Room B232 IBS (기초과학연구원)For any given graph $H$, one may define a natural corresponding functional $\|.\|_H$ for real-valued functions by using homomorphism density. One may also extend this to complex-valued functions, once $H$ …