Results 61 to 70 of about 1,177,096 (136)

Criteria and Schur Complements of H-matrices

open access: yes, 2010
The purpose of this paper is twofold: We first present a sufficient condition for testing strictly generalized diagonally dominant matrices (i.e., H-matrices) and we claim that our criterion is superior to the existing ones.
Liu, Jianzhou, Zhang, Fuzhen
core   +1 more source

Generalized Schur functions and augmented Schur parameters

open access: yes, 2006
Every Schur function s(z) is the uniform limit of a sequence of finite Blaschke products on compact subsets of the open unit disk. The Blaschke products in the sequence are defined inductively via the Schur parameters of s(z).
Wanjala, Gerald, Dijksma, Aad
core  

Positivity properties for q-Schur algebras. [PDF]

open access: yes, 1997
We prove Du's positivity conjecture for the canonical basis of the q-Schur algebra, using elementary arguments and the positivity result for Lusztig's canonical basis for U+q(sln).
Green, R. M.
core   +1 more source

Pieri’s Formula for Generalized Schur Polynomials

open access: yes, 2008
. We define a generalization of Schur polynomials as a expansion coefficient of generalized Schur operators. We generalize the Pieri’s formula to the generalized Schur polynomials. Résumé.
Combinatoire Algébrique   +2 more
core  

The Schur-positivity of generalized nets

open access: yes, 2023
A graph is Schur-positive if its chromatic symmetric function expands nonnegatively in the Schur basis. All claw-free graphs are conjectured to be Schur-positive. We introduce a combinatorial object corresponding to a graph G, called a special rim hook
Shelburne, Ethan
core  

Schur Convexity of Generalized Heronian Means Involving Two Parameters

open access: yes, 2008
The Schur convexity and Schur-geometric convexity of generalized Heronian means involving two parameters are studied, the main result is then used to obtain several interesting and significantly inequalities for generalized Heronian means.
Shi Huan-Nan   +3 more
core  

Home - About - Disclaimer - Privacy