If G is a connected graph with vertex set V (G), then the degree distance of G is defined as DD(G) = ∑ {u,v}∈V (G)(deg u + deg v)d(u, v), where deg u is the degree of vertex u, and d(u, v) denotes the distance between u and v. In the chemical literature, DD(G) is better known under ‡Corresponding author. If possible, send your correspondence via e-mail. the name Schultz index. In the class of p...

We incorporate the microscopic assumptions that lead to a certain generalization of Lieb-Schultz-Mattis (LSM) theorem for one-dimensional spin chains into conformal bootstrap. Our approach accounts ``LSM anomaly'' possessed by these through combination modular bootstrap and correlator symmetry defect operators. Specifically, we obtain universal bounds on local operator content $(1+1)d$ field th...