Organizer包承龙Speaker刘歆中国科学院数学与系统科学研究院研究员TimeThursday, 11:00am - 12:00pmApr. 24, 2025VenueC548, Shuangqing Complex BuildingCan Tensor Product Functions Represent High-Dimensional Problems with Antisymmetry Constraints in Polynomial Complexity?Tensor product function (TPF) approximations are widely used to solve high-dimensional problems, such as partial differential equatio...
AbstractRdl and Rucinski have extended Ramseys Theorem to random graphs, showing that there is aconstant C' such that with high probability, any two-colouring of the edges of G(n, p) with edgeprobability p= C'n?/(t+1) contains a monochromatic copy of Kt (the complete t-vertex graph). Weinvestigate how this statement extends to arbitrary colourings of G(n,p). Namely, when noassumptions are made ...