The Schur algorithm and coefficient characterizations for generalized Schur functions

In this paper we analyze the existence of a Schur algorithm and obtain coefficient characterizations for the functions in a generalized Schur class. An application to an interpolation problem of Carathéodory type raised by M.G. Krein and H. Langer is indicated.

     

The Schur Algorithm for Generalized Schur Functions II: Jordan Chains and Transformations of Characteristic Functions

 In the first paper of this series (Daniel Alpay, Tomas Azizov, Aad Dijksma, and Heinz Langer: The Schur algorithm for generalized Schur functions I: coisometric realizations, Operator Theory: Advances and Applications 129 (2001), pp. 1–36) it was shown that for a generalized Schur function s(z), which is the characteristic function of a coisometric colligation V with state space being a Pontryagin space, the Schur transformation corresponds to a finite-dimensional reduction of the state space, and a finite-dimensional perturbation and compression of its main operator. In the present paper we show that these formulas can be explained using simple relations between V and the colligation of the reciprocal s(z)⁻¹ of the characteristic function s(z) and general factorization results for characteristic functions. Received October 31, 2001; in revised form August 21, 2002 RID="a" ID="a" Dedicated to Professor Edmund Hlawka on the occasion of his 85th birthday     

Multiplicity Free Schur, Skew Schur, and Quasisymmetric Schur Functions

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 quasisymmetric Schur functions with one or two terms in the expansion, or one or two parts in the indexing composition. This identifies composition shapes such that all standard composition tableaux of that shape have distinct descent sets. We conclude by providing such a classification for quasisymmetric Schur function families, giving a classification of Schur functions that are in some sense almost F-multiplicity free.     

Equality of Schur and Skew Schur Functions

We determine the precise conditions under which any skew Schur function is equal to a Schur function over both infinitely and finitely many variables. Received May 29, 2004     

The Schur algorithm and its applications

The Schur algorithm and its time-domain counterpart, the fast Cholseky recursions, are some efficient signal processing algorithms which are well adapted to the study of inverse scattering problems. These algorithms use a layer stripping approach to reconstruct a lossless scattering medium described by symmetric two-component wave equations which model the interaction of right and left propagating waves. In this paper, the Schur and fast Chokesky recursions are presented and are used to study several inverse problems such as the reconstruction of nonuniform lossless transmission lines, the inverse problem for a layered acoustic medium, and the linear least-squares estimation of stationary stochastic processes. The inverse scattering problem for asymmetric two-component wave equations corresponding to lossy media is also examined and solved by using two coupled sets of Schur recursions. This procedure is then applied to the inverse problem for lossy transmission lines.The work of this author was supported by the Exxon Education FoundationThe work of this author was supported by the Air Force Office of Scientific Research under Grant AFOSR-82-0135A.     

The Schur property for subgroup lattices of groups

A classical theorem of Schur states that if the centre of a group G has finite index, then the commutator subgroup G′ of G is finite. A lattice analogue of this result is proved in this paper: if a group G contains a modularly embedded subgroup of finite index, then there exists a finite normal subgroup N of G such that G/N has modular subgroup lattice. Here a subgroup M of a group G is said to be modularly embedded in G if the lattice is modular for each element x of G. Some consequences of this theorem are also obtained; in particular, the behaviour of groups covered by finitely many subgroups with modular subgroup lattice is described. Received: 16 October 2007, Final version received: 22 February 2008     

George Peacock and the British origins of symbolical algebra

This paper studies the background to and content of George Peacock's work on symbolical algebra. It argues that, in response to the problem of the negative numbers, Peacock, an inveterate reformer, elaborated a system of algebra which admitted essentially “arbitrary” symbols, signs, and laws. Although he recognized that the symbolical algebraist was free to assign somewhat arbitrarily the laws of symbolical algebra, Peacock himself did not exercise the freedom of algebra which he proclaimed. The paper ends with a discussion of Sir William Rowan Hamilton's criticism of symbolical algebra.     

Symmetrizers for Schur superalgebras

For the Schur superalgebra $S=S(m|n,r)$ over a ground field K of characteristic zero, we define the symmetrizer $T^{\lambda }[i:j]$ of the ordered pairs of tableaux $(T_i,T_j)$ of the shape λ. We show that the K-span $A_{\lambda ,K}$ of all symmetrizers $T^{\lambda }[i:j]$ has a basis consisting of $T^{\lambda }[i:j]$ for $T_i$ and $T_j$ semistandard. In particular, $A_{\lambda ,K}\ne 0$ if and only if λ is an $(m|n)$-hook partition. In this case, the S-superbimodule $A_{\lambda ,K}$ is identified as $D_{\lambda }{?}_K{D}_{\lambda }^o$, where $D_{\lambda }$ and $D_{\lambda }^o$ are left and right irreducible S-supermodules of the highest weight λ.We define modified symmetrizers $T^{\lambda }\{i:j\}$ and show that their $\mathbb{Z}$-span forms a $\mathbb{Z}$-form $A_{\lambda ,\mathbb{Z}}$ of $A_{\lambda ,\mathbb{Q}}$. We show that every modified symmetrizer $T^{\lambda }\{i:j\}$ is a $\mathbb{Z}$-linear combination of modified symmetrizers $T^{\lambda }\{i:j\}$ for $T_i,T_j$ semistandard. Using modular reduction to a field K of characteristic $p>2$, we obtain that $A_{\lambda ,K}$ has a basis consisting of modified symmetrizers $T^{\lambda }\{i:j\}$ for $T_i$ and $T_j$ semistandard.     

Skew quasisymmetric Schur functions and noncommutative Schur functions

Recently a new basis for the Hopf algebra of quasisymmetric functions QSym, called quasisymmetric Schur functions, has been introduced by Haglund, Luoto, Mason, van Willigenburg. In this paper we extend the definition of quasisymmetric Schur functions to introduce skew quasisymmetric Schur functions. These functions include both classical skew Schur functions and quasisymmetric Schur functions as examples, and give rise to a new poset LC that is analogous to Young's lattice. We also introduce a new basis for the Hopf algebra of noncommutative symmetric functions NSym. This basis of NSym is dual to the basis of quasisymmetric Schur functions and its elements are the pre-image of the Schur functions under the forgetful map χ:NSym→Sym. We prove that the multiplicative structure constants of the noncommutative Schur functions, equivalently the coefficients of the skew quasisymmetric Schur functions when expanded in the quasisymmetric Schur basis, are nonnegative integers, satisfying a Littlewood–Richardson rule analogue that reduces to the classical Littlewood–Richardson rule under χ.As an application we show that the morphism of algebras from the algebra of Poirier–Reutenauer to Sym factors through NSym. We also extend the definition of Schur functions in noncommuting variables of Rosas–Sagan in the algebra NCSym to define quasisymmetric Schur functions in the algebra NCQSym. We prove these latter functions refine the former and their properties, and project onto quasisymmetric Schur functions under the forgetful map. Lastly, we show that by suitably labeling LC, skew quasisymmetric Schur functions arise in the theory of Pieri operators on posets.     

The Flagged Double Schur Function

The double Schur function is a natural generalization of the factorial Schur function introduced by Biedenharn and Louck. It also arises as the symmetric double Schubert polynomial corresponding to a class of permutations called Grassmannian permutations introduced by A. Lascoux. We present a lattice path interpretation of the double Schur function based on a flagged determinantal definition, which readily leads to a tableau interpretation similar to the original tableau definition of the factorial Schur function. The main result of this paper is a combinatorial treatment of the flagged double Schur function in terms of the lattice path interpretations of divided difference operators. Finally, we find lattice path representations of formulas for the symplectic and orthogonal characters for sp(2n) and so(2n + 1) based on the tableau representations due to King and El-Shakaway, and Sundaram. Based on the lattice path interpretations, we obtain flagged determinantal formulas for these characters.     

Schur convexity and Schur multiplicative convexity for a class of symmetric functions with applications

For x = (x ₁, x ₂, …, x _n ) ∈ (0, 1 ] ⁿ and r ∈ { 1, 2, … , n}, a symmetric function F _n (x, r) is defined by the relation

两类对称函数的Schur凸性

本文用一种新方法研究两类对称函数的Schur凸性.首先,对x=(x1,...,xn)∈(-∞,1)n∪(1,+∞)n和r∈{1,2,...,n},讨论Guan(2007)定义的对称函数Fn(x,r)=Fn(x1,x2,...,xn;r)=∑1≤i1≤i2≤···≤ir≤n r∏j=1xij/(1-xij)的Schur凸性,其中i1,i2,...,in为正整数;推广褚玉明等人(2009)的主要结果,因而用新方法推广并解决Guan(2007)提出的一个公开问题.然后,对x=(x1,...,xn)∈(-∞,1)n∪(1,+∞)n和r∈{1,2,...,n},研究本文定义的对称函数Gn(x,r)=Gn(x1,x2,...,xn;r)=∑1≤i1≤i2≤···≤ir≤n(r∏j=1xij/(1-xij))1/r的Schur凸性、Schur乘性凸性和Schur调和凸性,其中i1,i2,...,in为正整数.作为应用,用Schur凸函数自变量的双射变换得到其他几类对称函数的Schur凸性,用控制理论建立一些不等式,特别地,由此给出Sharpiro不等式和Ky Fan不等式一个共同的推广,导出Safta猜想在高维空间的推广.     

关于广义Muirhead平均的Schur幂凸性

对广义Muirhead平均的Schur-幂凸性进行了讨论,给出了判定Muirhead平均的Schur-幂凸性的充要条件.结果改进了Chu和Xia在相关文献中的主要结果,Chu和Xia的结果是结果的特例.