We give a simple proof of the equivalence of the matrix unit formulas for the symmetric group provided by Murphy’s construction and by the fusion procedure due to Cherednik. 1 Young basis Let us fix some notation and recall some well known facts about the representations of the symmetric group Sn; see e.g. [6]. We write a partition λ as a sequence λ = (λ1, . . . , λl) of integers such that λ1 >...

Ji et al. have conjectured that using the matrix form (to represent a basic solution) instead of the Simplex tableau in the dual Simplex method will lead to an algorithm with the time complexity comparable to the Hungarian algorithm for solving the Assignment Problem. In this note we show that both the time complexity and the CPU times of the Ji et al. algorithm are far away from being competit...

consider the linear system ax=b where the coefficient matrix a is an m-matrix. in the present work, it is proved that the rate of convergence of the gauss-seidel method is faster than the mixed-type splitting and aor (sor) iterative methods for solving m-matrix linear systems. furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a precondition...

consider the linear system ax=b where the coefficient matrix a is an m-matrix. in the present work, it is proved that the rate of convergence of the gauss-seidel method is faster than the mixed-type splitting and aor (sor) iterative methods for solving m-matrix linear systems. furthermore, we improve the rate of convergence of the mixed-type splitting iterative method by applying a precondition...

A combined two established techniques, namely the Quality Function Deployment (QFD) and the Analytic Network Process (ANP) use in product development process. In this paper shows the how to use ANP decision making tool in QFD matrix. Combine the QFD and ANP method to determine the overall priorities of ECs. The ANP is a multi criteria decision-making method used to derive relative priority from...

A matrix balancing problem and an eigenvalue problem are transformed into two minimumnorm point problems whose difference is only a norm. The matrix balancing problem is solved by scaling algorithms that are as simple as the power method of the eigenvalue problem. This study gives a proof of global convergence for scaling algorithms and applies the algorithm to Analytic Hierarchy process (AHP),...