我们将上述\mathcal{G}称为\mathcal{F}的一个覆盖(cover). 若\mathcal{G}还满足(ii), 则称其为\mathcal{F}的一个便宜的覆盖. 最近, Jinyoung Park和Huy Tuan Pham[PP22b]证明了定理1的精神对(狭义的)选择器过程也是对的, 即 定理2(Park--Pham/Talagrand选择器猜想, 2022+).存在L>0使得下述命题...
Jaesun Park, Kyuyon Park, Younghun Park, Hanbae Seo, Seunghyun Seo, Mihyun Sim, Gyubin Son, Matt Yeo, Kyung Hoon Yeom, Wonjoon Yoo, Myungin You, Doheon Ahn, Homin Ahn, Joohee Ahn, Seongmin Ahn, Chanwoo An, Hyeryun An, Junho An, Sang-Min An, Boram Byun, Eunbin Byun, Jon...