131 citations · 733 across the 42 of their papers we have counts for
8 papers · 1 filter
Dynamical evolution of Population III stellar systems and the resulting binary statistics
Boyuan Liu, Georges Meynet, Volker Bromm
We use N-body simulations to study the dynamical evolution of Population III (Pop III) stellar systems and the resulting binary statistics. We design a physically-motivated framewo…
The Population III origin of GW190521
Boyuan Liu, Volker Bromm
We explore the possibility that the recently detected black hole binary (BHB) merger event GW190521 originates from the first generation of massive, metal-free, so-called Populatio…
The Turán number for the edge blow-up of trees
Anyao Wang, Xinmin Hou, Boyuan Liu +1
The edge blow-up of a graph is the graph obtained from replacing each edge in by a clique of the same size where the new vertices of the cliques are all different. In this…
When did Population III star formation end?
Boyuan Liu, Volker Bromm
We construct a theoretical framework to study Population III (Pop III) star formation in the post-reionization epoch () by combining cosmological simulation data with…
Lessons on early structure formation from a mature galaxy cluster observed at cosmic noon
Boyuan Liu, Anna T. P. Schauer, Volker Bromm
We demonstrate a new approach of indirectly constraining both early star and structure formation via mature galaxy clusters at cosmic noon (z~2), using the cluster XLSSC 122 as an…
Gravitational waves from Population III binary black holes formed by dynamical capture
Boyuan Liu, Volker Bromm
We use cosmological hydrodynamic simulations to study the gravitational wave (GW) signals from high-redshift binary black holes (BBHs) formed by dynamical capture (ex-situ formatio…
Maximizing the number of independent sets of fixed size in -covered graphs
Anyao Wang, Xinmin Hou, Boyuan Liu +1
A graph is -covered by some given graph if each vertex in is contained in a copy of . In this note, we give the maximum number of independent sets of size $t\ge 3…
Exact minimum codegree thresholds for -covering and -covering
Lei Yu, Xinmin Hou, Boyuan Liu +1
Given two -graphs and , an -covering of is a collection of copies of in such that each vertex of is contained in at least one copy of them. Let {$c_2(n…