相关论文: A Formula for Type III Sums of Squares
We introduce a new invariant \mathcal{S}(M) for type III factors M with no almost-periodic weights. We compute this invariant for certain free Araki-Woods factors. We show that Connes' invariant \tau cannot distinguish all isomorphism…
In order to obtain the best-known guarantees, algorithms are traditionally tailored to the particular problem we want to solve. Two recent developments, the Unique Games Conjecture (UGC) and the Sum-of-Squares (SOS) method, surprisingly…
The paper introduces in a new although maybe unusual form the examples of types provided by J. von Neumann and F.J. Murray in their outstanding papers on algebraic factorization (1936-1943)pursuing three main aims: speculating about the…
A factor copula model is proposed in which factors are either simulable or estimable from exogenous information. Point estimation and inference are based on a simulated methods of moments (SMM) approach with non-overlapping simulation…
We consider the solution of finite-sum minimization problems, such as those appearing in nonlinear least-squares or general empirical risk minimization problems. We are motivated by problems in which the summand functions are…
A novel factorization for the sum of two single-pair matrices is established as product of lower-triangular, tridiagonal, and upper-triangular matrices, leading to semi-closed-form formulas for tridiagonal matrix inversion. Subsequent…
Many important questions about a model cannot be answered just by explaining how much each feature contributes to its output. To answer a broader set of questions, we generalize a popular, mathematically well-grounded explanation technique,…
A popular numerical method to compute SOS (sum of squares of polynomials) decompositions for polynomials is to transform the problem into semi-definite programming (SDP) problems and then solve them by SDP solvers. In this paper, we focus…
It is often the case in Statistics that one needs to compute sums of infinite series, especially in marginalising over discrete latent variables. This has become more relevant with the popularization of gradient-based techniques (e.g.…
The solution-space structure of the 3-Satisfiability Problem (3-SAT) is studied as a function of the control parameter alpha (ratio of number of clauses to the number of variables) using numerical simulations. For this purpose, one has to…
Let s(n) be the number of representations of n as the sum of three squares. We prove a remarkable new identity for s(p^2n)- ps(n) with p being an odd prime. This identity makes nontrivial use of ternary quadratic forms with discriminants…
Stochastic Barrier Functions (SBFs) certify the safety of stochastic systems by formulating a functional optimization problem, which state-of-the-art methods solve using Sum-of-Squares (SoS) polynomials. This work focuses on polynomial SBFs…
We show that explicit forms for certain polynomials~$\psi^{(a)}_m(n)$ with the property \[ \psi^{(a+1)}_m(n) = \sum_{\nu=1}^n \psi_m^{(a)}(\nu) \] can be found (here, $a,m,n\in\mathbb{N}_0$). We use these polynomials as a basis to express…
This paper provides a technique for evaluating some nonlinear Gaussian sums in closed forms. The evaluation is obtained from the known values of simpler exponential sums.
We introduce the \emph{Generalized Latin Square Graph} $\Gamma(S)$ of a finite semigroup $S$. Since we record global factorization multiplicities and local alternative counts, we define three counting invariants $N_S,N_R,N_C$. This gives…
We establish a general framework for developing, efficient energy stable numerical schemes for gradient flows and develop three classes of generalized scalar auxiliary variable approaches (G-SAV). Numerical schemes based on the G-SAV…
The main objective of this article is to study the exponential sums associated to Fourier coefficients of modular forms supported at numbers having a fixed set of prime factors. This is achieved by establishing an improvement on…
We establish several summation formulae for hypergeometric and basic hypergeometric series involving noncommutative parameters and argument. These results were inspired by a recent paper of J. A. Tirao [Proc. Nat. Acad. Sci. 100 (14)…
In this paper, we shall establish a rather general asymptotic formula in short intervals for a classe of arithmetic functions and announce two applications about the distribution of divisors of square-full numbers and integers representable…
The micro-local Gevrey regularity of a class of "sums of squares" with real analytic coefficients is studied in detail. Some partial regularity result is also given.