Related papers: The factorization of the hypergeometric equation
Polynomial factorization in conventional sense is an ill-posed problem due to its discontinuity with respect to coefficient perturbations, making it a challenge for numerical computation using empirical data. As a regularization, this paper…
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
Localization properties for Schr\"odinger means are studied in dimension higher than one.
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
A hypergeometric type equation satisfying certain conditions defines either a finite or an infinite system of orthogonal polynomials. We present in a unified and explicit way all these systems of orthogonal polynomials, the associated…
Recursive formulas extending some known $_{2}F_{1}$ and $_{3}F_{2}$ summation formulas by using contiguous relations have been obtained. On the one hand, these recursive equations are quite suitable for symbolic and numerical evaluation by…
We introduce twisted matrix factorizations for quantum complete intersections of codimension two. For such an algebra, we show that in a given dimension, almost all the indecomposable modules with bounded minimal projective resolutions…
Based on a reduction processing, we rewrite a hypergeometric term as the sum of the difference of a hypergeometric term and a reduced hypergeometric term (the reduced part, in short). We show that when the initial hypergeometric term has a…
A Hilbert space in M dimensions is shown explicitly to accommodate representations that reflect the prime numbers decomposition of M. Representations that exhibit the factorization of M into two relatively prime numbers: the kq…
We discuss factorization of the hypergeometric-type difference equations on the uniform lattices and show how one can construct a dynamical algebra, which corresponds to each of these equations. Some examples are exhibited, in particular,…
The iteration procedure of supersymmetric transformations for the two-dimensional Schroedinger operator is implemented by means of the matrix form of factorization in terms of matrix 2x2 supercharges. Two different types of iterations are…
This is a chapter for a planned collective volume entitled "New spaces in mathematics and physics" (M. Anel, G. Catren Eds.). The first part contains a short formal exposition of supergeometry as it is understood by mathematicians. The…
This paper gives a new perspective on how to solve the second-order linear differential equation written in normal form. Extending the argument of the potential to a complex number leads to solving exactly the Schr\"odinger equation when…
The exceptional symmetries of supergravity have been reproduced from the Hamiltonian formulation of the classical mechanics of F-theory. We now find the Lagrangian formalism has even larger exceptional symmetries, simplifying its…
A comprehensive review of exactly solvable quantum mechanics is presented with the emphasis of the recently discovered multi-indexed orthogonal polynomials. The main subjects to be discussed are the factorised Hamiltonians, the general…
New estimates on the maximal function associated to the linear Schrodinger equation are established
We introduce the notion of quantum duplicates of an (associative, unital) algebra, motivated by the problem of constructing toy-models for quantizations of certain configuration spaces in quantum mechanics. The proposed (algebraic) model…
In this article, we express solutions of the Gauss hypergeometric equation as a series of the multiple polylogarithms by using iterated integral. This representation is the most simple case of a semisimple representation of solutions of the…
This chapter amalgamates some foundational developments and calculations in factorization homology.
We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…