We employ the density matrix renormalization group (DMRG) and the wave function factorization method for the numerical solution of large scale nuclear structure problems. The DMRG exhibits an improved convergence for problems with realistic interactions due to the implementation of the finite algorithm. The wave function factorization of fpg-shell nuclei yields rapidly converging approximations...

With the advent of social influence, social recommender systems have become an active research topic for making recommendations based on the ratings of the users that have close social relations with the given user. The underlying assumption is that a user’s taste is similar to his/her friends’ in social networking. In fact, users enjoy different groups of items with different preferences. A us...

We prove that the factorization of a saturated fusion system over discrete $p$-toral group as product indecomposable subsystems is unique up to normal automorphisms and permutations factors. In particular, if

We obtain several rigidity results regarding tensor product decompositions of factors. First, we show that any full factor with separable predual has at most countably many up to stable unitary conjugacy. use this the class factors countable fundamental group is under products. Next, new primeness and unique prime factorization for crossed products coming from compact actions higher rank lattic...

In this paper‎, ‎an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms‎. ‎We use different drop tolerance parameters to compute the preconditioners‎. ‎To study the effect of such a dropping on the quality of the ILU ...

The note is devoted to the factorization formula for matrix with generators of group GL(N, ℝ) in regular representation. helps evaluate these and Casimir operators case arbitrary N clarifies connection between quantum Toda chain.

The most popular public key cryptosystems are based on the problem of factorization of large integers and discrete logarithm problem in finite groups, in particular in the multiplicative group of finite field and the group of points on elliptic curve over finite field. Elliptic curves are of special interest since they at present alow much shorter keys, for the same level of security, compared ...

In this paper we give the definitions and calculate the orders of some subgroups of GL(m,Zn) similar to the classical linear subgroups of the general linear group over any field. Specifically, the special modular linear group SL(m,Zn), the orthogonal modular group O(m,Zn), the special orthogonal modular group SO(m,Zn) and finally the symplectic modular group Sp(2m,Zn). The technique used consis...

In 1979, two constructions for making partitionable graphs were introduced in (by Chv2 atal et al. (Ann. Discrete Math. 21 (1984) 197)). The graphs produced by the second construction are called CGPW graphs. A near-factorization (A; B) of a %nite group is roughly speaking a non-trivial factorization of G minus one element into two subsets A and B. Every CGPW graph with n vertices turns out to b...