Classes of‎ ‎Abaffy-Broyden-Spedicato (ABS) methods have been introduced for‎ ‎solving linear systems of equations‎. ‎The algorithms are powerful methods for developing matrix‎ ‎factorizations and many fundamental numerical linear algebra processes‎. ‎Here‎, ‎we show how to apply the ABS algorithms to devise algorithms to compute the WZ and ZW‎ ‎factorizations of a nonsingular matrix as well as...

P2p -factorization of a complete bipartite graph for p, an integer was studied by Wang [1]. Further, Beiling [2] extended the work of Wang[1], and studied the P2k -factorization of complete bipartite multigraphs. For even value of k in Pk -factorization the spectrum problem is completely solved [1, 2, 3]. However for odd value of k i.e. P3 , P5 and P7 , the path factorization have been studied ...

This note deals with the computation of the factorization number F2(G) of a finite group G. By using the Möbius inversion formula, explicit expressions of F2(G) are obtained for two classes of finite abelian groups, improving the results of Factorization numbers of some finite groups, Glasgow Math. J. (2012). MSC (2010): Primary 20D40; Secondary 20D60.

We present a new combinatorial structure in a string: a canonical factorization for any two squares that occur at the same position and satisfy some size restrictions. We believe that this canonical factorization will have application to related problems such as the New Periodicity Lemma, Crochemore-Rytter Three Squares Lemma, and ultimately the maximum-number-of-runs conjecture.

It is commonly assumed that Shor's quantum algorithm for the efficient factorization of a large number N requires a pure initial state. Here we demonstrate that a single pure qubit, together with a collection of log 2N qubits in an arbitrary mixed state, is sufficient to implement Shor's factorization algorithm efficiently.

We used QCD factorization for the hadronic matrix elements to show that the existing data, in particular the branching ratios BR ( ?J/?K) and BR ( ?J/??), can be accounted for this approach. We analyzed the decay within the framework of QCD factorization. We have complete calculation of the relevant hard-scattering kernels for twist-2 and twist-3. We calculated this decays in a special scale ...

We present the LU decomposition with panel rank revealing pivoting (LU PRRP), an LU factorization algorithm based on strong rank revealing QR panel factorization. LU PRRP is more stable than Gaussian elimination with partial pivoting (GEPP), with a theoretical upper bound of the growth factor of (1+ τb) n b , where b is the size of the panel used during the block factorization, τ is a parameter...

Let K be a number field and OK be the ring of algebraic integers. We discuss the unique factorization of elements of OK into irreducibles and its use in solving Diophantine equations. We then proceed to prove the existence of the unique factorization of ideals of OK into prime ideals.