Related papers: Cluster Convergence Theorem
Two BPHZ convergence theorems are proved directly in Euclidean position space, without exponentiating the propagators, making use of the Cluster Convergence Theorem presented previously. The first theorem proves the absolute convergence of…
We prove a compactness theorem for pseudopower operations of the form $pp_{\Gamma(\mu,\sigma)}(\mu)$ where $\aleph_0<\sigma=cf(\sigma)\leq cf(\mu)$. Our main tool is a result that has Shelah's cov vs. pp Theorem as a consequence. We also…
Even though the abundance and evolution of clusters have been used to study the cosmological parameters including the properties of dark energy owing to their pure dependence on the geometry of the Universe and the power spectrum, it is…
Cluster number counts offer sensitive probes of the dark energy if and only if the_evolution_ of the cluster mass versus observable relation(s) is well calibrated. We investigate the potential for internal calibration by demanding…
The influences on the cluster number counts from the coupling between dark energy and dark matter with momentum transfer are investigated. We find that the extrapolated linear density contrast computed from the spherical collapse model is…
We study the renormalizability in theories of a self-interacting Lifshitz scalar field. We show that although the statement of power-counting is true at one-loop order, in generic cases where the scalar field is dimensionless, an infinite…
Comparing phase plots of truncated series solutions of Kepler's equation by Lagrange's power series with those by Bessel's Kapteyn series strongly suggest that a Jentzsch-type theorem holds true not only for the former but also for the…
A size-extensive, converging, black-box, ab initio coupled-cluster ($\Delta$CC) ansatz is introduced that computes the energies and wave functions of stationary states from any degenerate or nondegenerate Slater-determinant references with…
We prove several theorems on sigma-bounded and sigma-compact pointsets. We start with a known theorem by Kechris, saying that any lightface \Sigma^1_1 set of the Baire space either is effectively sigma-bounded (that is, covered by a…
The appropriate power counting for the effective field theory of NN interactions is reviewed. It is more subtle than in most effective field theories since in the limit that the S-wave NN scattering lengths go to infinity it is governed by…
Bochner's theorem gives the necessary and sufficient conditions on a function such that its Fourier transform corresponds to a true probability density function. In the Wigner phase space picture, quantum Bochner's theorem gives the…
Many applications in data analysis begin with a set of points in a Euclidean space that is partitioned into clusters. Common tasks then are to devise a classifier deciding which of the clusters a new point is associated to, finding outliers…
Cluster number counts can constrain the properties of dark energy if and only if the evolution in the relationship between observable quantities and the cluster mass can be calibrated. Next generation surveys with ~10000 clusters will have…
Effective field theory is applied to finite-density systems with an unnaturally large scattering length, such as neutron matter. A new organizational scheme is identified and connected with an expansion in inverse powers of the number of…
A version of Arzel\`a-Ascoli theorem for $X$ being $\sigma$-locally compact Hausdorff space is proved. The result is used in proving compactness of Fredholm, Hammerstein and Urysohn operators. Two fixed point theorems, for Hammerstein and…
Two natural and widely used representations for the community structure of networks are clusterings, which partition the vertex set into disjoint subsets, and layouts, which assign the vertices to positions in a metric space. This paper…
A method of calculating Feynman diagrams from their small momentum expansion [1] is extended to diagrams with zero mass thresholds. We start from the asymptotic expansion in large masses [2] (applied to the case when all $M_i^2$ are large…
The clustering of a data set is one of the core tasks in data analytics. Many clustering algorithms exhibit a strong contrast between a favorable performance in practice and bad theoretical worst-cases. Prime examples are least-squares…
It is a classical fact that domains of convergence of power series of several complex variables are characterized as logarithmically convex complete Reinhardt domains; let $D \subsetneq \mathbb{C}^N$ be such a domain. We show that a…
The Cluster Variation Method known in statistical mechanics and condensed matter is revived for weighted bipartite networks. The decomposition of a Hamiltonian through a finite number of components, whence serving to define variable…