Related papers: Constraint polynomial approach -- an alternative t…
In sphere of research of discrete optimization algorithms efficiency the important place occupies a method of polynomial reducibility of some problems to others with use of special purpose components. In this paper a novel method of compact…
The recently introduced scheme [20,21] is extended to propose an algebraic non-perturbative approach for the analytical treatment of Schr\"odinger equations with non-solvable potentials involving an exactly solvable potential form together…
Integration operational matrix methods based on Zernike polynomials are used to determine approximate solutions of a class of non-homogeneous partial differential equations (PDEs) of first and second order. Due to the nature of the Zernike…
We consider the solution of the Bethe-Salpeter equation in Euclidean metric for a qbar-q vector meson in the circumstance where the dressed quark propagators have time-like complex conjugate mass poles. This approximates features…
Classical A-polynomials $A(\ell,m)$ define constraints on coordinates $\ell$ and $m$ in $SL(2,\mathbb{C})$ (a complexification of $SU(2)$) character varieties associated to knot complements $S^3\setminus K$. Quantum A-polynomials $\hat…
We propose a new method for constructing the quasi-exactly solvable (QES) potentials with two known eigenstates using supersymmetric quantum mechanics. General expression for QES potentials with explicitly known energy levels and wave…
Entropy-based (M_N) moment closures for kinetic equations are defined by a constrained optimization problem that must be solved at every point in a space-time mesh, making it important to solve these optimization problems accurately and…
We construct a general algorithm generating the analytic eigenfunctions as well as eigenvalues of one-dimensional stationary Schroedinger Hamiltonians. Both exact and quasi-exact Hamiltonians enter our formalism but we focus on quasi-exact…
A transformation method is applied to the second order ordinary differential equation satisfied by orthogonal polynomials to construct a family of exactly solvable quantum systems in any arbitrary dimensional space. Using the properties of…
From black hole perturbation theory, quasi-normal modes (QNMs) in spherically symmetric AdS black hole spacetimes are usually studied with the Horowitz and Hubeny methods [1] by imposing the Dirichlet or vanishing energy flux boundary…
We study a class of projective transformations of spectraplexes associated with self-dual cones and, on this basis, propose a polynomial-time algorithm for convex feasibility problems with positive definite constraints. At each iteration of…
We describe three different methods for generating quasi-exactly solvable potentials, for which a finite number of eigenstates are analytically known. The three methods are respectively based on (i) a polynomial ansatz for wave functions;…
We consider approximating analytic functions on the interval $[-1,1]$ from their values at a set of $m+1$ equispaced nodes. A result of Platte, Trefethen \& Kuijlaars states that fast and stable approximation from equispaced samples is…
We give a sharp lower bound on the capacity of a real stable polynomial, depending only on the value of its gradient at $x = 1$. This result implies a sharp improvement to a similar inequality proved by Linial-Samorodnitsky-Wigderson in…
We make quantitative improvements to recently obtained results on the structure of the image of a large difference set under certain quadratic forms and other homogeneous polynomials. Previous proofs used deep results of Benoist-Quint on…
We consider chance-constrained binary knapsack problems, where the weights of items are independent random variables with the means and standard deviations known. The chance constraint can be reformulated as a second-order cone constraint…
It was shown recently that the constraints on the initial data for Einstein's equations may be posed as an evolutionary problem [9]. In one of the proposed two methods the constraints can be replaced by a first order symmetrizable…
In this work, we consider a ``reverse-engineering'' approach to construct confining potentials that support exact, constant density kovaton solutions to the classical Gross-Pitaevskii equation (GPE) also known as the nonlinear Schr\"odinger…
The quantum adversary method is a versatile method for proving lower bounds on quantum algorithms. It yields tight bounds for many computational problems, is robust in having many equivalent formulations, and has natural connections to…
It is shown that using the similarity transformations, a set of three-dimensional p-q nonlinear Schrodinger (NLS) equations with inhomogeneous coefficients can be reduced to one-dimensional stationary NLS equation with constant or varying…