Related papers: Solving the quintic by iteration in three dimensio…
An extremely precise global symmetry is necessary in the Peccei--Quinn solution to the strong CP problem. Such symmetry arises when colored chiral fermions are localized in an internal space. We present a supersymmetric model that…
Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
One-dimensional sigma-models with N supersymmetries are considered. For conventional supersymmetries there must be N-1 complex structures satisfying a Clifford algebra and the constraints on the target space geometry can be formulated in…
Dynamical systems with quadratic or polynomial drift exhibit complex dynamics, yet compared to nonlinear systems in general form, are often easier to analyze, simulate, control, and learn. Results going back over a century have shown that…
The article presents the theoretical background of the algorithms for solving cyclic block tridiagonal and cyclic block penta-diagonal systems of linear algebraic equations present in ref [1] and [2]. The theory is based on the Woodbury…
We consider a one parameter family of a PT symmetric two dimensional system with quadratic non-linearities. Such systems are shown to perform periodic oscillations due to existing centers. We describe this systems by constructing a…
A quantum ${\mathbb P}^3$ is a noncommutative analogue of a polynomial ring on four variables, and, herein, it is taken to be a regular algebra of global dimension four. It is well known that if a generic quadratic quantum ${\mathbb P}^3$…
A general method of obtaining linear differential equations having polynomial solutions is proposed. The method is based on an equivalence of the spectral problem for an element of the universal enveloping algebra of some Lie algebra in the…
We propose a polynomially bounded, in time and space, method to decide whether a given 3-SAT formula is satisfiable or not. The tools we use here are, in fact, very simple. We first decide satisfiability for a particular 3-SAT formula,…
A way to construct and classify the three dimensional polynomially deformed algebras is given and the irreducible representations is presented. for the quadratic algebras 4 different algebras are obtained and for cubic algebras 12 different…
This paper introduces an algebraic combinatorial approach to simplicial cone decompositions, a key step in solving inhomogeneous linear Diophantine systems and counting lattice points in polytopes. We use constant term manipulation on the…
Long-term stability studies of nonlinear Hamiltonian systems require symplectic integration algorithms which are both fast and accurate. In this paper, we study a symplectic integration method wherein the symplectic map representing the…
We lift the constraint of a diagonal representation of the Hamiltonian by searching for square integrable bases that support a tridiagonal matrix representation of the wave operator. Doing so results in exactly solvable problems with a…
In this article we solve a class of two parameter polynomial-quintic equation. The solution follows if we consider the Jacobian elliptic function $sn$ and relate it with the coefficients of the equation. The solution is the elliptic…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Mixed-integer quadratic programming is the problem of optimizing a quadratic function over points in a polyhedral set where some of the components are restricted to be integral. In this paper, we prove that the decision version of…
The goal of this work is threefold. First, we give an expression of the most general five point integral on M_{0,n} in terms of Chebyshev polynomials. Second, we choose a special kinematics that transforms the polynomial form of the…
We explicate a procedure to solve general linear differential equations, which connects the desired solutions to monomials x^m of an appropriate degree m. In the process the underlying symmetry of the equations under study, as well as that…
The decomposition of the polynomials on the quaternionic unit sphere in $\Hd$ into irreducible modules under the action of the quaternionic unitary (symplectic) group and quaternionic scalar multiplication has been studied by several…