Spectral Sufficient Conditions for Graph Factors

Kavli Affiliate: Ke Wang | First 5 Authors: Fengyun Ren, Shumin Zhang, Ke Wang, , | Summary: The ${K_{1,1}, K_{1,2},C_m: mgeq3}$-factor of a graph is a spanning subgraph whose each component is an element of ${K_{1,1}, K_{1,2},C_m: mgeq3}$. In this paper, through the graph spectral methods, we establish the lower bound of the signless Laplacian […]


Continue.. Spectral Sufficient Conditions for Graph Factors

Rigorous expansions of modular forms at CM points, I: Denominators

Kavli Affiliate: Chris Xu | First 5 Authors: Chris Xu, , , , | Summary: We describe an algorithm to rigorously compute the power series expansion at a CM point of a weight $2$ cusp form of level coprime to $6$. Our algorithm works by bounding the denominators that appear due to ramification, and without […]


Continue.. Rigorous expansions of modular forms at CM points, I: Denominators

MIM: Multi-modal Content Interest Modeling Paradigm for User Behavior Modeling

Kavli Affiliate: Xiang Zhang | First 5 Authors: Bencheng Yan, Si Chen, Shichang Jia, Jianyu Liu, Yueran Liu | Summary: Click-Through Rate (CTR) prediction is a crucial task in recommendation systems, online searches, and advertising platforms, where accurately capturing users’ real interests in content is essential for performance. However, existing methods heavily rely on ID […]


Continue.. MIM: Multi-modal Content Interest Modeling Paradigm for User Behavior Modeling