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

Spectroscopy Signatures of Electron Correlations in a Trilayer Graphene/hBN Moiré Superlattice

Kavli Affiliate: Feng Wang | First 5 Authors: Jixiang Yang, Guorui Chen, Tianyi Han, Qihang Zhang, Ya-Hui Zhang | Summary: ABC-stacked trilayer graphene/hBN moir’e superlattice (TLG/hBN) has emerged as a playground for correlated electron physics. We report spectroscopy measurements of dual-gated TLG/hBN using Fourier transformed infrared photocurrent spectroscopy. We observed a strong optical transition between […]


Continue.. Spectroscopy Signatures of Electron Correlations in a Trilayer Graphene/hBN Moiré Superlattice

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

Face familiarity detection with complex synapses

Kavli Affiliate: Stefano Fusi | Authors: Li Ji-An, Fabio Stefanini, Marcus K Benna and Stefano Fusi | Summary: Synaptic plasticity is a complex phenomenon involving multiple biochemical processes that operate on different timescales. We recently showed that this complexity can greatly increase the memory capacity of neural networks when the variables that characterize the synaptic […]


Continue.. Face familiarity detection with complex synapses

Analysis method for 3D power spectrum of projected tensor field with fast estimator and window convolution modelling: an application to intrinsic alignments

Kavli Affiliate: Masahiro Takada | First 5 Authors: Toshiki Kurita, Masahiro Takada, , , | Summary: Rank-2 tensor fields of large-scale structure, e.g. a tensor field inferred from shapes of galaxies, open up a window to directly access 2 scalar, 2 vector and 2 tensor modes, where the scalar fields can be measured independently from […]


Continue.. Analysis method for 3D power spectrum of projected tensor field with fast estimator and window convolution modelling: an application to intrinsic alignments