Related papers: Sum rules in multiphoton coincidence rates
Boson-sampling has attracted much interest as a simplified approach to implementing a subset of optical quantum computing. Boson-sampling requires indistinguishable photons, but far fewer of them than universal optical quantum computing…
In order to find the outcome probabilities of quantum mechanical systems like the optical networks underlying Boson sampling, it is necessary to be able to compute the permanents of unitary matrices, a computationally hard task. Here we…
The use of multiple modalities (e.g., face and fingerprint) or multiple algorithms (e.g., three face comparators) has shown to improve the recognition accuracy of an operational biometric system. Over time a biometric system may evolve to…
We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.
The amplitude of zero angle scattering of electron on photon in the 3-rd QED order of fine structure constant with $\gamma^*\gamma$ intermediate state converting into quark--antiquark is considered. Utilizing analytic properties of elastic…
This paper presents a quantum generalization of the multinomial distribution for the transition probabilities of $m$ identical photons in a $k$-port linear optical interferometer: two multinomial coefficients (one for the input…
In this note, we give a simple method for computing the column sums of the Sonnenschein summability matrices.
Small discrete family symmetries such as S4, A4 or A5 may lead to simple leading-order predictions for the neutrino mixing matrix such as the bimaximal, tribimaximal or golden ratio mixing patterns, which may be brought into agreement with…
A generic physical situation is considered where Im $\Pi$, the imaginary part of polarization operator (generalized susceptibility), can be measured on a finite interval and the high frequency asymptotics (up to a few orders) of $\Pi$ can…
Data sets in the form of binary matrices are ubiquitous across scientific domains, and researchers are often interested in identifying and quantifying noteworthy structure. One approach is to compare the observed data to that which might be…
We continue our investigations of bilinear sums with modular square roots and the large sieve for square moduli in our recent article "On bilinear sums with modular square roots and applications II", arXiv:2603.00768. In the present…
We show that within the Standard Model any system of hadronic weak charm decays related by $U$-spin satisfies the following rate sum rule: (sum of CF and DCS CKM-free rates) divided by (sum of SCS CKM-free rates) = 1, which holds up to…
Sums-of-squares formulas over the integers have been studied extensively using their equivalence to consistently signed intercalate matrices. This representation, combined with combinatorial arguments, has been used to produce…
We generalize Sylvester single sums to multisets (sets with repeated elements), and show that these sums compute subresultants of two univariate polyomials as a function of their roots independently of their multiplicity structure. This is…
We provide a brief summary of the observed sum rule anomalies in the high-T$_c$ cuprate materials. A recent issue has been the impact of a non-infinite frequency cutoff in the experiment. In the normal state, the observed anomalously high…
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
We continue to explore the connections between large deviations for objects coming from random matrix theory and sum rules. This connection was established in [17] for spectral measures of classical ensembles (Gauss-Hermite, Laguerre,…
This paper describes algorithms to deal with nested symbolic sums over combinations of harmonic series, binomial coefficients and denominators. In addition it treats Mellin transforms and the inverse Mellin transformation for functions that…
The concept of QCD sum rules is extended to bound states composed of particles with finite mass such as scalar quarks or strange quarks. It turns out that mass corrections become important in this context. The number of relevant corrections…
We compute spectra of symmetric random matrices defined on graphs exhibiting a modular structure. Modules are initially introduced as fully connected sub-units of a graph. By contrast, inter-module connectivity is taken to be incomplete.…