Related papers: Solving Equations Using Khovanskii Bases
A unified approach, for solving a wide class of single and many-body quantum problems, commonly encountered in literature is developed based on a recently proposed method for finding solutions of linear differential equations. Apart from…
The paper presents methods of eigenvalue localisation of regular matrix polynomials, in particular, stability of matrix polynomials is investigated. For this aim a stronger notion of hyperstability is introduced and widely discussed. Matrix…
In this paper we present an algebraic study concerning the general second order linear differential equation with polynomial coefficients. By means of Kovacic's algorithm and asymptotic iteration method we find a degree independent…
In this paper we describe an efficient involutive algorithm for constructing Groebner bases of polynomial ideals. The algorithm is based on the concept of involutive monomial division which restricts the conventional division in a certain…
The paper gives an overview of recent advances in structural equation modeling. A structural equation model is a multivariate statistical model that is determined by a mixed graph, also known as a path diagram. Our focus is on the…
This paper presents a program analysis method that generates program summaries involving polynomial arithmetic. Our approach builds on prior techniques that use solvable polynomial maps for summarizing loops. These techniques are able to…
A classification of ordinary differential equations and finite-difference equations in one variable having polynomial solutions (the generalized Bochner problem) is given. The method used is based on the spectral problem for a polynomial…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
The method reducing the solution of the Schroedinger equation for several types of power potentials to the solution of the eigenvalue problem for the infinite system of algebraic equations is developed. The finite truncation of this system…
We show that every affine or projective algebraic variety defined over the field of real or complex numbers is homeomorphic to a variety defined over the field of algebraic numbers. We construct such a homeomorphism by choosing a small…
A quadrature rule of a measure $\mu$ on the real line represents a convex combination of finitely many evaluations at points, called nodes, that agrees with integration against $\mu$ for all polynomials up to some fixed degree. In this…
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases. The objective of this study is to develop a quantum…
In this paper, we consider the operator properties of various phononic eigenvalue problems. We aim to answer some fundamental questions about the eigenvalues and eigenvectors of phononic operators. These include questions about the…
In this work we find a unifying scheme for the known explicit complex-valued eigenfunctions on the classical compact Riemannian symmetric spaces. For this we employ the well-known Cartan embedding for those spaces. This also leads to the…
Polynomial systems over the binary field have important applications, especially in symmetric and asymmetric cryptanalysis, multivariate-based post-quantum cryptography, coding theory, and computer algebra. In this work, we study the…
General revision. In particular the parts concerning involutive bases over rings have been significantly changed. In addition some proofs have been improved.
Using the minors in Hessian matrices, we introduce new graded algebras associated to a homogeneous polynomial. When the associated projective hypersurface has isolated singularities, these algebras are related to some new local algebras…
We develop a systematic procedure for constructing quantum many-body problems whose spectrum can be partially or totally computed by purely algebraic means. The exactly-solvable models include rational and hyperbolic potentials related to…
We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…
For associative algebras in many different categories, it is possible to develop the machinery of Gr\"obner bases. A Gr\"obner basis of defining relations for an algebra of such a category provides a "monomial replacement" of this algebra.…