Related papers: Inifnite hypercomplex number system factorization …
The problem of linear equivalence for a general class of nonlinear systems, is examined throughout this paper. A relevant algorithm is developed, based on a factorization procedure. This factorization is based on the star-product, an…
This paper addresses the factorization of polynomials of the form $F(x) = f_{0}(x) + f_{1}(x) x^{n} + \cdots + f_{r-1}(x) x^{(r-1)n} + f_{r}(x) x^{rn}$ where $r$ is a fixed positive integer and the $f_{j}(x)$ are fixed polynomials in…
We combine the parameterization method for invariant manifolds with the finite element method for elliptic PDEs,to obtain a new computational framework for high order approximation of invariant manifolds attached to unstable equilibrium…
We apply general difference calculus in order to obtain solutions to the functional equations of the second order. We show that factorization method can be successfully applied to the functional case. This method is equivariant under the…
Given any polynomial $p$ in $C[X]$, we show that the set of irreducible matrices satisfying $p(A)=0$ is finite. In the specific case $p(X)=X^2-nX$, we count the number of irreducible matrices in this set and analyze the arising sequences…
We develop first steps in the study of factorizations of elements in ultraproducts of commutative cancellative monoids into irreducible elements. A complete characterization of the (multi-)sets of lengths in such objects is given. As…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
A computable ring is a ring equipped with mechanical procedure to add and multiply elements. In most natural computable integral domains, there is a computational procedure to determine if a given element is prime/irreducible. However,…
Polynomial factorization over $ZZ$ is of great historical and practical importance. Currently, the standard technique is to factor the polynomial over finite fields first and then to lift to integers. Factorization over finite fields can be…
The problem of factorization of a nonextensive probability distribution is discussed. It is shown that, in general, the correlation energy between the correlated subsystems in the canonical composite system can not be neglected even in the…
Compact categories have lately seen renewed interest via applications to quantum physics. Being essentially finite-dimensional, they cannot accomodate (co)limit-based constructions. For example, they cannot capture protocols such as quantum…
Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion.…
Here the polynomial interpolation approach is used to introduce the main results on multivariate normal algebraic systems. Next we bring a construction which shows that any standard algebraic system, with finite set of solutions, can be…
We introduce a method which allows one to recover the equations of motion of a class of nonholonomic systems by finding instead an unconstrained Hamiltonian system on the full phase space, and to restrict the resulting canonical equations…
This work considers special types of interval linear systems - overdetermined systems. Simply said these systems have more equations than variables. The solution set of an interval linear system is a collection of all solutions of all…
We set new speed records for multiplying long polynomials over finite fields of characteristic two. Our multiplication algorithm is based on an additive FFT (Fast Fourier Transform) by Lin, Chung, and Huang in 2014 comparing to previously…
We construct meta-intransitive systems of independent random variables of any finite order from basic tuple of random variables which generalize intransitive dice. Under this construction, the equality of some linear functional is…
We consider various counting questions for irreducible binomials over finite fields. We use various results from analytic number theory to investigate these questions.
A class of bivariate infinite series solutions of the elliptic and hyperbolic Kepler equations is described, adding to the handful of 1-D series that have been found throughout the centuries. This result is based on an iterative procedure…
Non-trivial extensions of the three dimensional Poincar\'e algebra, beyond the supersymmetric one, are explicitly constructed. These algebraic structures are the natural three dimensional generalizations of fractional supersymmetry of order…