Related papers: Inifnite hypercomplex number system factorization …
Building of some isomorphic classes for noncanonical hypercomplex number systems o dimension 2 is described. In general case, such systems with specific constraints to structural constants can be isomorphic to complex, dual or double number…
This article generalizes a recently introduced procedure to solve nonlinear systems of equations, radically departing from the conventional Newton-Raphson scheme. The original nonlinear system is first unfolded into three simpler…
An infinite-dimensional family of exact solutions of a three-dimensional biharmonic equation was constructed by the hypercomplex method.
In this article we will apply the first- and second-order supersymmetric quantum mechanics to obtain new exactly-solvable real potentials departing from the inverted oscillator potential. This system has some special properties; in…
A new kind of numbers called Hyper Space Complex Numbers and its algebras are defined and proved. It is with good properties as the classic Complex Numbers, such as expressed in coordinates, triangular and exponent forms and following the…
Since the beginning of the quest of hypercomplex numbers in the late eighteenth century, many hypercomplex number systems have been proposed but none of them succeeded in extending the concept of complex numbers to higher dimensions. This…
We obtain closed-form solutions of several inhomogeneous Lienard equations by the factorization method. The two factorization conditions involved in the method are turned into a system of first-order differential equations containing the…
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
The class of non-commutative hypercomplex number systems (HNS) of 4-dimension constructed by using of non-commutative procedure of Grassman-Clifford doubling of 2-dimensional systems is investigated in the article. All HNS of this class are…
A method is presented that reduces the number of terms of systems of linear equations (algebraic, ordinary and partial differential equations). As a byproduct these systems have a tendency to become partially decoupled and are more likely…
We offer multiplication method for factoring big natural numbers which extends the group of the Fermat's and Lehman's factorization algorithms and has run-time complexity $O(n^{1/3})$. This paper is argued the finiteness of proposed…
In this note we describe a new method of counting the number of unordered factorizations of a natural number by means of a generating function and a recurrence relation arising from it, which improves an earlier result in this direction.
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
The nonlinear supersymmetry of one-dimensional systems is investigated in the context of the quantum anomaly problem. Any classical supersymmetric system characterized by the nonlinear in the Hamiltonian superalgebra is symplectomorphic to…
For any polynomial $P \in \mathbb{C}[X_1,X_2,...,X_n]$, we describe a $\mathbb{C}$-vector space $F(P)$ of solutions of a linear system of equations coming from some algebraic partial differential equations such that the dimension of $F(P)$…
This paper presents a novel numerical optimisation method for infinite dimensional optimisation. The functional optimisation makes minimal assumptions about the functional and without any specific knowledge on the derivative of the…
The new method for obtaining a variety of extensions of Hermite polynomials is given. As a first example a family of orthogonal polynomial systems which includes the generalized Hermite polynomials is considered. Apparently, either these…
We construct complete sets of invariant quantities that are integrals of motion for two Hamiltonian systems obtained through a reduction procedure, thus proving that these systems are maximally superintegrable. We also discuss the reduction…
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…
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…