相关论文: Refined Factorizations of Solvable Potentials

We use the factorization method to find the exact eigenvalues and eigenfunctions for a particle in a box with the delta function potential $V(x)=\lambda\delta(x-x_{0})$. We show that the presence of the potential results in the…

Factorization properties of one-loop gauge theory amplitudes have been used as checks on explicitly computed amplitudes and in the construction of ansatze for higher-point ones. In massless theories, such as QCD at high energies, infrared…

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

Based on the fact that the Hamiltonians of the Coulomb many-particle systems are always factorized we develop the two different approaches for analytical solution of the Schr\"{o}dinger equation written for arbitrary few- and many-particle…

There is developed a current algebra representation scheme for reconstructing algebraically factorized quantum Hamiltonian and symmetry operators in the Fock type space and its application to quantum Hamiltonian and symmetry operators in…

The generalization of the factorization method performed by Mielnik [J. Math. Phys. {\bf 25}, 3387 (1984)] opened new ways to generate exactly solvable potentials in quantum mechanics. We present an application of Mielnik's method to…

Truncated Fourier, Gauss, Kummer and exponential sums can be used to factorize numbers: for a factor these sums equal unity in absolute value, whereas they nearly vanish for any other number. We show how this factorization algorithm can…

First some old as well as new results about P.I. algebras, Ore extensions, and degrees are presented. Then quantized $n\times r$ matrices as well as quantized factor algebras of $M_q(n)$ are analyzed. The latter are the quantized function…

We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…

Matrix factorization methods are important tools in data mining and analysis. They can be used for many tasks, ranging from dimensionality reduction to visualization. In this paper we concentrate on the use of matrix factorizations for…

We present a general method for analytically factorizing the n-fold form factor integrals $f^{(n)}_{N,N}(t)$ for the correlation functions of the Ising model on the diagonal in terms of the hypergeometric functions…

In this work we present an introduction to Supersymmetry in the context of 1-dimensional Quantum Mechanics. For that purpose we develop the concept of hamiltonians factorization using the simple harmonic oscillator as an example, we…

In exploratory factor analysis, rotation techniques are employed to derive interpretable factor loading matrices. Factor rotations deal with equality-constrained optimization problems aimed at determining a loading matrix based on measure…

With the recent success of representation learning methods, which includes deep learning as a special case, there has been considerable interest in developing representation learning techniques that can incorporate known physical…

The article shows how the factorization of an arbitrary Lorentz transformation is performed. That is, representation of an arbitrary Lorentz transformation as a sequence of spatial rotation and boost or boost and spatial rotation. Relations…

We extend a factorization due to Krein to arbitrary analytic functions from the upper half-plane to itself. The factorization represents every such function as a product of fractional linear factors times a function which, generally, has…

We present the general ideas on SuperSymmetric Quantum Mechanics (SUSY-QM) using different representations for the operators in question, which are defined by the corresponding bosonic Hamiltonian as part of SUSY Hamiltonian and its…

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

In this paper we aim to generalize results obtained in the framework of fractional calculus by the way of reformulating them in terms of operator theory. In its own turn, the achieved generalization allows us to spread the obtained…

We demonstrate a method for general linear optical networks that allows one to factorize any SU($n$) matrix in terms of two SU($n-1)$ blocks coupled by an SU(2) entangling beam splitter. The process can be recursively continued in an…