Let k be an algebraically closed field of characteristic p > 0, let m, r be integers with m ≥ 1, r ≥ 0 and m ≥ r and let S0(2m, r) be the symplectic Schur algebra over k as introduced by the first author. We introduce the symplectic Schur functor, derive some basic properties of it and relate this to work of Hartmann and Paget. We do the same for the orthogonal Schur algebra. We give a modified...

insisting that the equality sign holds when k = n. Here, x[X] > • • • > x[n] are the xt arranged in decreasing order and, similarly, y[X] > • • • > y[n]. If (1) is only required for the increasing (decreasing) convex functions on R then one speaks of weak sub-majorization x >, respectively). The first is equivalent to (2). Let & be an open convex subset of R...

In a recent article [8], Gowda and Sznajder studied the concept of Schur complement in Euclidean Jordan algebras and described Schur determinantal and Haynsworth inertia formulas. In this article, we establish some more results on the Schur complement. Specifically, we prove, in the setting of Euclidean Jordan algebras, an analogue of the Crabtree-Haynsworth quotient formula and show that any S...

In the Hopf algebra of symmetric functions, Sym, the basis of Schur functions is distinguished since every Schur function is isomorphic to an irreducible character of a symmetric group under the Frobenius characteristic map. In this note we show that in the Hopf algebra of noncommutative symmetric functions, NSym, of which Sym is a quotient, the recently discovered basis of noncommutative Schur...

The Schur-positivity order on skew shapes is defined by B ≤ A if the difference sA − sB is Schur-positive. It is an open problem to determine those connected skew shapes that are maximal with respect to this ordering. A strong necessary condition for the Schur-positivity of sA−sB is that the support of B is contained in that of A, where the support of B is defined to be the set of partitions λ ...

We introduce an analogue of the q-Schur algebra associated to Coxeter systems of type A n−1. We give two constructions of this algebra. The first construction realizes the algebra as a certain endomorphism algebra arising from an affine Hecke algebra of type A r−1 , where n ≥ r. This generalizes the original q-Schur algebra as defined by Dipper and James, and the new algebra contains the ordina...

Schur duality decomposes many copies of a quantum state into subspaces labeled by partitions, a decomposition with applications throughout quantum information theory. Here we consider applying Schur duality to the problem of distinguishing coset states in the standard approach to the hidden subgroup problem. We observe that simply measuring the partition (a procedure we call weak Schur sampling...

In this paper we classify all Schur functions and skew Schur functions that are multiplicity free when expanded in the basis of fundamental quasisymmetric functions, termed F-multiplicity free. Combinatorially, this is equivalent to classifying all skew shapes whose standard Young tableaux have distinct descent sets. We then generalize our setting, and classify all F-multiplicity free quasisymm...

This paper presents a parallel mixed direct/iterative method for solving linear systems Ax = b arising from circuit simulation. The systems are solved by a block LU factorization with an iterative method for the Schur complement. The Schur complement is a small and rather dense matrix. Direct LU decomposition of the Schur complement takes too much time in order to achieve reasonable speedup res...

Several Schur complement-based preconditioners have been proposed for solving (generalized) saddlepoint problems. We consider probing-based methods for approximating those Schur complements in the preconditioners of the type proposed by [Murphy, Golub and Wathen ’00], [de Sturler and Liesen ’03] and [Siefert and de Sturler ’04]. This approach can be applied in similar preconditioners as well. W...