Related papers: A cluster version of the GGT sum rule
The Kramers-Kronig relations and various oscillator strength sum rules represent strong constraints on the physical response of materials. In this work, taking inspiration from the well-established equivalence between $f-$sum rules and…
We develop a unified approach to the problem of clustering in the three different fields of applications, as indicated in the title the paper. The approach is based on Khintchine's probabilistic method that grew out of the Darwin-Fawler…
Two new QCD sum rules for nucleon tensor charge are derived from a mixed correlator of spin-1/2 and spin-3/2 nucleon interpolating fields. These sum rules are analyzed along with a sum rule obtained from the usual correlator of a general…
Sum rules among superparticle masses are derived under the assumption that models beyond the MSSM are four-dimensional supersymmetric grand unified theories or five-dimensional supersymmetric orbifold grand unified theories. Sfermion sum…
All derivations of the GDH sum rule are presented and discussed in detail, focussing particularly on the validity of the underlying assumptions. Several tests of the sum rule within perturbative models are reviewed. Various possible sources…
The Drell-Hearn-Gerasimov (DHG) sum rule relates the helicity structure of the photoabsorption cross section to the anomalous magnetic moment of the nucleon. It is based on Lorentz and gauge invariance, crossing symmetry, causality and…
We derive an efficient method to perform clustering of nodes in Gaussian graphical models directly from sample data. Nodes are clustered based on the similarity of their network neighborhoods, with edge weights defined by partial…
An asymptotic formula with a square root error term is obtained for the number of elements with given trace and norm in a finite semisimple algebra over a finite field. This extends previous results from finite etale algebras (commutative…
Generative approaches to clustering provide information on geometric properties of clusters, whereas discriminative approaches provide boundaries between clusters. Ideas from both approaches are incorporated to present a fully unsupervised,…
The non energy-weighted Gamow-Teller(GT) sum rule is satisfied in relativistic models, when all nuclear density-dependent terms, including Pauli blocking terms from nucleon-antinucleon excitations, are taken into account in the RPA…
In [7], a cluster expansion method has been developed to study the fluctuations of the hard sphere dynamics around the Boltzmann equation. This method provides a precise control on the exponential moments of the empirical measure, from…
We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{\mu\le\lambda} g^{(k)}_{\mu}$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by…
A new symplectic-based shell-model approach to clustering in atomic nuclei is proposed by considering the simple system $^{20}$Ne. Its relation to the collective excitations of this system is mentioned as well. The construction of the Pauli…
In quantum scattering on networks there is a non-linear composition rule for on-shell scattering matrices which serves as a replacement for the multiplicative rule of transfer matrices valid in other physical contexts. In this article, we…
In \cite{JKS} we gave an (additive) categorification of Grassmannian cluster algebras, using the category $\CM(A)$ of Cohen-Macaulay modules for a certain Gorenstein order $A$. In this paper, using a cluster tilting object in the same…
In this article, the logic rule ensembles approach to supervised learning is applied to the unsupervised or semi-supervised clustering. Logic rules which were obtained by combining simple conjunctive rules are used to partition the input…
Quantum cluster approaches offer new perspectives to study the complexities of macroscopic correlated fermion systems. These approaches can be understood as generalized mean-field theories. Quantum cluster approaches are non-perturbative…
Sum-of-norms clustering is a clustering formulation based on convex optimization that automatically induces hierarchy. Multiple algorithms have been proposed to solve the optimization problem: subgradient descent by Hocking et al., ADMM and…
For positive integers $p_1,p_2,\ldots,p_k,q$ with $q>1$, we define the Euler $T$-sum $T_{p_1p_2\cdots p_k,q}$ as the sum of those terms of the usual infinite series for the classical Euler sum $S_{p_1p_2\cdots p_k,q}$ with odd denominators.…
In this contribution we review the algebraic cluster model (ACM) for $\alpha$-cluster nuclei with $A=4k$ nucleons and its extension to the cluster shell model (CSM) for $A=4k+x$ nuclei. Particular attention is paid to the question to what…