نتایج جستجو برای: schur product
تعداد نتایج: 284056 فیلتر نتایج به سال:
Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict tableaux that generate Schur functions. We introduce a modification known as Young row-strict quasisymmetric Schur functions, which are generated by row-strict You...
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which employs reordered Schur decompositions to perform restarts and deflations in a numerically reliable manner. This paper describes a variant of the Krylov-Schur algorithm suitable for addressing eigenvalue problems associated with products of large and sparse matrices. It per...
This paper introduces a generalized Schur algorithm in the Krein space with an indefinite inner product. Concepts such as Caratheodory classes and Schur classes used in the classical Schur algorithm cannot be applied in the Krein space since the positivedefiniteness corresponds merely to the nonsingularity in the Krein space. We note also that these problems appear when fast algorithms for subo...
We prove a Murnaghan-Nakayama rule for noncommutative Schur functions introduced by Bessenrodt, Luoto and van Willigenburg. In other words, we give an explicit combinatorial formula for expanding the product of a noncommutative power sum symmetric function and a noncommutative Schur function in terms of noncommutative Schur functions. In direct analogy to the classical Murnaghan-Nakayama rule, ...
Stewart’s recently introduced Krylov-Schur algorithm is a modification of the implicitly restarted Arnoldi algorithm which employs reordered Schur decompositions to perform restarts and deflations in a numerically reliable manner. This paper describes a variant of the Krylov-Schur algorithm suitable for addressing eigenvalue problems associated with products of large and sparse matrices. It per...
The expansion in Schur functions of the product ∏
We establish several properties of an algorithm defined by Mason and Remmel (2010) which inserts a positive integer into a row-strict composition tableau. These properties lead to a Littlewood-Richardson type rule for expanding the product of a row-strict quasisymmetric Schur function and a symmetric Schur function in terms of row-strict quasisymmetric Schur functions. Résumé. Nous établissons ...
The product of any finite number of factorial Schur functions can be expanded as a Z[y]-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the Molev-Sagan rule, which in turn generalizes the classical Littlewood-Richardson rule.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید