No abstract uploaded!

No abstract uploaded!

We prove that energy minimizing Yang–Mills connections on compact homogeneous 4-manifolds are either instantons or split into a sum of instantons on passage to the adjoint bundle. We prove related results for Calabi–Yau 3-folds and for 3−dimensional manifolds of nonnegative Ricci curvature.

Single-cell (sc)RNA-seq, together with RNA velocity and metabolic labeling, reveals cellular states and transitions at unprecedented resolution. Fully exploiting these data, however, requires kinetic models capable of unveiling governing regulatory functions. Here, we introduce an analytical framework dynamo (https://github.com/aristoteleo/dynamo-release), which infers absolute RNA velocity, reconstructs continuous vector fields that predict cell fates, employs differential geometry to extract underlying regulations, and ultimately predicts optimal reprogramming paths and perturbation outcomes. We highlight dynamo’s power to overcome fundamental limitations of conventional splicing-based RNA velocity analyses to enable accurate velocity estimations on a metabolically labeled human hematopoiesis scRNA-seq dataset. Furthermore, differential geometry analyses reveal mechanisms driving early megakaryocyte appearance and elucidate asymmetrical regulation within the PU.1-GATA1 circuit. Leveraging the least-action-path method, dynamo accurately predicts drivers of numerous hematopoietic transitions. Finally, in silico perturbations predict cell-fate diversions induced by gene perturbations. Dynamo, thus, represents an important step in advancing quantitative and predictive theories of cell-state transitions.

This investigation studies nonemptiness problems of plane edge coloring with three colors. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges that have one of p colors are arranged side by side such that the touching edges of the adjacent tiles have the same colors. Given a basic set B of Wang tiles, the nonemptiness problem is to determine whether or not Σ(B) 6= ∅, where Σ(B) is the set of all global patterns on Z2 that can be constructed from the Wang tiles in B. Wang’s conjecture is that for any B of Wang tiles, Σ(B) 6= ∅ if and only if P(B) 6= ∅, where P(B) is the set of all periodic patterns on Z2 that can be generated by the tiles in B. When p ≥ 5, Wang’s conjecture is known to be wrong. When p = 2, theconjecture is true. This study proves that when p = 3, the conjecture is also true. If P(B) 6= ∅, then B has a subset B′ of minimal cycle generators such that P(B′) 6= ∅ and P(B′′) = ∅ for B′′ $ B′. This study demonstrates that the set C(3) of all minimal cycle generators contains 787, 605 members that can be classified into 2, 906 equivalence classes. N(3) is the set of all maximal non-cycle generators : if B ∈ N(3), then P(B) = ∅ and P(B ˜) 6= ∅ for B ˜ % B. Wang’s conjecture is shown to be true by proving that B ∈ N(3) implies Σ(B) = ∅.