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, ...

In this paper we define the shifted Schur process as a measure on sequences of strict partitions. This process is a generalization of the shifted Schur measure introduced in [TW] and [Mat] and is a shifted version of the Schur process introduced in [OR1]. We prove that the shifted Schur process defines a Pfaffian point process. We further apply this fact to compute the bulk scaling limit of the...

We study certain sequences of rational functions with poles outside the unit circle. Such kind of sequences are recursively constructed based on sequences of complex numbers with norm less than one. In fact, such sequences are closely related to the Schur-Nevanlinna algorithm for Schur functions on the one hand and on the other hand to orthogonal rational functions on the unit circle. We shall ...

Computing the partial Schur form of a matrix is a common kernel in widely used software for solving eigenvalues problems. Partial Schur forms and Schur vectors also arise naturally in deeation techniques. In this paper, error bounds are proposed which are based on the Schur form of a matrix. We show how the bounds derived for the general case simplify in special situations such as those of Herm...

We study the class C of symmetric functions whose coefficients in the Schur basis can be described by generating functions for sets of tableaux with fixed shape. Included in this class are the Hall-Littlewood polynomials, k-Schur functions, and Stanley symmetric functions; functions whose Schur coefficients encode combinatorial, representation theoretic and geometric information. While Schur fu...

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...

We introduce a new basis of the non-commutative symmetric functions whose elements have Schur functions as their commutative images. Dually, we build a basis of the quasi-symmetric functions which expand positively in the fundamental quasi-symmetric functions and decompose Schur functions according to a signed combinatorial formula. Résumé. Nous introduisons une nouvelle base des fonctions symé...

An experimental design is said to be Schur optimal, if it is optimal with respect to the class of all Schur isotonic criteria, which includesKiefer’s criteria of p-optimality, distance optimality criteria andmany others. In the paper we formulate an easily verifiable necessary and sufficient condition for Schur optimality in the set of all approximate designs of a linear regression experiment w...

The result on the Geršgorin disc separation from the origin for strictly diagonally dominant matrices and their Schur complements in (Liu and Zhang in SIAM J. Matrix Anal. Appl. 27(3):665-674, 2005) is extended to nonstrictly diagonally dominant matrices and their Schur complements, showing that under some conditions the separation of the Schur complement of a nonstrictly diagonally dominant ma...

Flagged Schur functions are generalizations of Schur functions. They appear in the work of Lascoux and Schutzenberger [2] in their study of Schubert polynomials. Gessel [ 1 ] has shown that flagged Schur functions can be expressed both as a determinant in the complete homogeneous symmetric functions and in terms of column-strict tableaux just as can ordinary Schur functions (Jacobi-Trudi identi...