相关论文: Refined Factorizations of Solvable Potentials

A set of exactly solvable one-dimensional quantum mechanical potentials is described. It is defined by a finite-difference-differential equation generating in the limiting cases the Rosen-Morse, harmonic, and P\"oschl-Teller potentials.…

In this paper, we will extend the falling and rising factorial transforms \cite{ref. 1} which in this case every arbitrary function can be applied. Then, the properties of these transforms will be investigated and some corollaries will be…

We propose an alternative method to factorize an integer by using three harmonic oscillators. These oscillators are coupled together via specific Kerr nonlinear interactions. This method can be applied even if two harmonic oscillators are…

Matrix factorization exploits the idea that, in complex high-dimensional data, the actual signal typically lies in lower-dimensional structures. These lower dimensional objects provide useful insight, with interpretability favored by sparse…

In this paper we study the concept of radical factorization in the context of abstract ideal theory in order to obtain a unified approach to the theory of factorization into radical ideals and elements in the literature of commutative…

Factorization models express a statistical object of interest in terms of a collection of simpler objects. For example, a matrix or tensor can be expressed as a sum of rank-one components. However, in practice, it can be challenging to…

We consider the time-independent Wigner functions of phase-space quantum mechanics (a.k.a. deformation quantization) for a Morse potential. First, we find them by solving the $\ast$-eigenvalue equations, using a method that can be applied…

Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…

We study polytopes associated to factorisations of prime powers. These polytopes have explicit descriptions either in terms of their vertices or as intersections of closed halfspaces associated to their facets. We give formulae for their…

We discuss how matrix factorizations offer a practical method of computing the quiver and associated superpotential for a hypersurface singularity. This method also yields explicit geometrical interpretations of D-branes (i.e., quiver…

Factorization algebras are local-to-global objects living on manifolds, and they arise naturally in mathematics and physics. Their local structure encompasses examples like associative algebras and vertex algebras; in these examples, their…

For a bi-partite quantum system defined in a finite dimensional Hilbert space we investigate in what sense entanglement change and interactions imply each other. For this purpose we introduce an entanglement operator, which is then shown to…

The study of factorization in the linearized gravity is extended to the graviton scattering processes with a massive scalar particle, with a massless vector boson and also with a graviton. Every transition amplitude is shown to be…

We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function and then transforming the k-bit coupling ($k\geq 3$) terms to quadratic terms…

Parametric factorizations of linear partial operators on the plane are considered for operators of orders two, three and four. The operators are assumed to have a completely factorable symbol. It is proved that ``irreducible'' parametric…

A visualization scheme for quantum many-body wavefunctions is described, which we have termed qubism. Its main property is its recursivity: increasing the number of qubits reflects in an increase in the image resolution. Thus, the plots are…

The techniques for polynomial interpolation and Gaussian quadrature are generalized to matrix-valued functions. It is shown how the zeros and rootvectors of matrix orthonormal polynomials can be used to get a quadrature formula with the…

The fast assembling of stiffness and mass matrices is a key issue in isogeometric analysis, particularly if the spline degree is increased. We present two algorithms based on the idea of sum factorization, one for matrix assembling and one…

Let $k$ be a locally compact complete field with respect to a discrete valuation $v$. Let $\oo$ be the valuation ring, $\m$ the maximal ideal and $F(x)\in\oo[x]$ a monic separable polynomial of degree $n$. Let $\delta=v(\dsc(F))$. The…

Low rank matrix factorization is a fundamental building block in machine learning, used for instance to summarize gene expression profile data or word-document counts. To be robust to outliers and differences in scale across features, a…