Related papers: Solution of Matrix Dyson Equation for Random Matri…
We consider the {\em Deligne-Simpson problem (DSP) (resp. the weak DSP): Give necessary and sufficient conditions upon the choice of the $p+1$ conjugacy classes $c_j\subset gl(n,{\bf C})$ or $C_j\subset GL(n,{\bf C})$ so that there exist…
An algebraic soliton of the massive Thirring model (MTM) is expressed by the simplest rational solution of the MTM with the spatial decay of $\mathcal{O}(x^{-1})$. The corresponding potential is related to a simple embedded eigenvalue in…
We first confirm that Nishijima's method of the $\pi^0 \rightarrow \gamma +\gamma $ calculation can precisely reproduce the observed life time of $\pi^0$ decay. Then, we calculate, for the first time, the T-matrix of the $Z^0 \rightarrow…
We show that the straightforward application of the discriminant to some physical problems may yield a trivial useless result. If the symmetry of the model matrix does not change with variations of the model parameter the discriminant may…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
Factorization-based gradient descent is a scalable and efficient algorithm for solving low-rank matrix completion. Recent progress in structured non-convex optimization has offered global convergence guarantees for gradient descent under…
We formulate a linear difference equation which yields averaged semi-inclusive decay rates for arbitrary, not necessarily large, values of the masses. We show that the rates for decays $M \to m+\M'$ of typical heavy open strings are…
In quantum mechanics, the Rosen-Zener model represents a two-level quantum system. Its generalization to multiple degenerate sets of states leads to larger non-autonomous linear system of ordinary differential equations (ODEs). We propose a…
The Deligne-Simpson problem (DSP) (resp. the weak DSP) is formulated like this: {\em give necessary and sufficient conditions for the choice of the conjugacy classes $C_j\subset GL(n,{\bf C})$ or $c_j\subset gl(n,{\bf C})$ so that there…
Correspondence problems are often modelled as quadratic optimization problems over permutations. Common scalable methods for approximating solutions of these NP-hard problems are the spectral relaxation for non-convex energies and the…
We present a fast sparse matrix permutation algorithm tailored to linear systems arising from triangle meshes. Our approach produces nested-dissection-style permutations while significantly reducing permutation runtime overhead. Rather than…
In this work, we propose a machine learning-based approach to address a specific aspect of the Quantum Marginal Problem: reconstructing a global density matrix compatible with a given set of quantum marginals. Our method integrates a…
Matrix completion is the study of recovering an underlying matrix from a sparse subset of noisy observations. Traditionally, it is assumed that the entries of the matrix are "missing completely at random" (MCAR), i.e., each entry is…
We propose a new method for computing the eigenvalue decomposition of a dense real normal matrix $A$ through the decomposition of its skew-symmetric part. The method relies on algorithms that are known to be efficiently implemented, such as…
In this paper, we investigate the decay properties of axially symmetric solutions to the steady incompressible magnetohydrodynamic equations in $\mathbb{R}^3$ with finite Dirichlet integral. We first derive the decay rates of general…
We consider a sequence of Dirichlet problems in varying domains (or, more generally, of relaxed Dirichlet problems involving measures in M_0) for second order linear elliptic operators in divergence form with varying matrices of…
Motivated by the Matrix Spencer conjecture, we study the problem of finding signed sums of matrices with a small matrix norm. A well-known strategy to obtain these signs is to prove, given matrices $A_1, \dots, A_n \in \mathbb{R}^{m \times…
A general framework based on Gaussian models and a MAP-EM algorithm is introduced in this paper for solving matrix/table completion problems. The numerical experiments with the standard and challenging movie ratings data show that the…
In this paper, we introduce a powerful technique based on Leave-one-out analysis to the study of low-rank matrix completion problems. Using this technique, we develop a general approach for obtaining fine-grained, entrywise bounds for…
By a new orthogonal direct sum decomposition $E_{M} = Y \oplus Z$, which $Z$ is related to $\Delta u_i(i=1,2,3,....,M)$, and a new functional $I(u)$, the method in [2] is improved to obtain new multiple periodic solutions with negativity…