Pomeranchuk Effect and Tunable Quantum Phase Transitions in 3L-MoTe2/WSe2

Kavli Affiliate: Zheng Zhu | First 5 Authors: Mingjie Zhang, Xuan Zhao, Kenji Watanabe, Takashi Taniguchi, Zheng Zhu | Summary: Many sought-after exotic states of matter are known to emerge close to quantum phase transitions, such as quantum spin liquids (QSL) and unconventional superconductivity. It is thus desirable to experimentally explore systems that can be […]


Continue.. Pomeranchuk Effect and Tunable Quantum Phase Transitions in 3L-MoTe2/WSe2

Symmetric Mass Generation in the 1+1 Dimensional Chiral Fermion 3-4-5-0 Model

Kavli Affiliate: Zheng Zhu | First 5 Authors: Meng Zeng, Zheng Zhu, Juven Wang, Yi-Zhuang You, | Summary: Lattice regularization of chiral fermions has been a long-standing problem in physics. In this work, we present the density matrix renormalization group (DMRG) simulation of the 3-4-5-0 model of (1+1)D chiral fermions with an anomaly-free chiral U(1) […]


Continue.. Symmetric Mass Generation in the 1+1 Dimensional Chiral Fermion 3-4-5-0 Model

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]


Continue.. A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]


Continue.. A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Kavli Affiliate: Yi Zhou | First 5 Authors: Xinyu Wu, Yi Zhou, Jin-Kao Hao, Zhang-Hua Fu, | Summary: The Steiner tree problem, which asks for a minimum weighted tree spanning a given set of terminal vertices in a given graph, is a classic problem arising in numerous practical applications. Many algorithms about this problem emerged […]


Continue.. A Partition-and-Merge Algorithm for Solving the Steiner Tree Problem in Large Graphs

Thermal Conductivity and Theory of Inelastic Scattering of Phonons by Collective Fluctuations

Kavli Affiliate: Leon Balents | First 5 Authors: Léo Mangeolle, Leon Balents, Lucile Savary, , | Summary: We study the intrinsic scattering of phonons by a general quantum degree of freedom, i.e. a fluctuating "field" $Q$, which may have completely general correlations, restricted only by unitarity and translational invariance. From the induced scattering rates, we […]


Continue.. Thermal Conductivity and Theory of Inelastic Scattering of Phonons by Collective Fluctuations

Desingularization and p-Curvature of Recurrence Operators

Kavli Affiliate: Yi Zhou | First 5 Authors: Yi Zhou, Mark van Hoeij, , , | Summary: Linear recurrence operators in characteristic $p$ are classified by their $p$-curvature. For a recurrence operator $L$, denote by $chi(L)$ the characteristic polynomial of its $p$-curvature. We can obtain information about the factorization of $L$ by factoring $chi(L)$. The […]


Continue.. Desingularization and p-Curvature of Recurrence Operators

Listing Maximal k-Plexes in Large Real-World Graphs

Kavli Affiliate: Yi Zhou | First 5 Authors: Zhengren Wang, Yi Zhou, Mingyu Xiao, Bakhadyr Khoussainov, | Summary: Listing dense subgraphs in large graphs plays a key task in varieties of network analysis applications like community detection. Clique, as the densest model, has been widely investigated. However, in practice, communities rarely form as cliques for […]


Continue.. Listing Maximal k-Plexes in Large Real-World Graphs

Weak Ergodicity Breaking in Non-Hermitian Many-body Systems

Kavli Affiliate: Zheng Zhu | First 5 Authors: Qianqian Chen, Shuai A. Chen, Zheng Zhu, , | Summary: The recent discovery of persistent revivals in the Rydberg-atom quantum simulator has revealed a weakly ergodicity-breaking mechanism dubbed quantum many-body scars, which are a set of nonthermal states embedded in otherwise thermal spectra. Until now, such a […]


Continue.. Weak Ergodicity Breaking in Non-Hermitian Many-body Systems

Selected Topics in Analytic Conformal Bootstrap: A Guided Journey

Kavli Affiliate: Xinan Zhou | First 5 Authors: Agnese Bissi, Aninda Sinha, Xinan Zhou, , | Summary: This review aims to offer a pedagogical introduction to the analytic conformal bootstrap program via a journey through selected topics. We review analytic methods which include the large spin perturbation theory, Mellin space methods and the Lorentzian inversion […]


Continue.. Selected Topics in Analytic Conformal Bootstrap: A Guided Journey