2016
DOI: 10.1016/j.ejc.2015.07.005
|View full text |Cite
|
Sign up to set email alerts
|

On inequalities for normalized Schur functions

Abstract: We prove a conjecture of Cuttler et al. [2011] [A. Cuttler, C. Greene, and M. Skandera; Inequalities for symmetric means. European J. Combinatorics, 32(2011), 745-761] on the monotonicity of normalized Schur functions under the usual (dominance) partial-order on partitions. We believe that our proof technique may be helpful in obtaining similar inequalities for other symmetric functions.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

2
17
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(19 citation statements)
references
References 5 publications
2
17
0
Order By: Relevance
“…For any λ, µ ∈ W N , we have λ µ if and only if L λ ≥ L µ pointwise on R N . Theorem 1.1 generalizes an ex-conjecture of Cuttler, Greene, and Skandera [6] which characterizes the majorization order on Young diagrams via nonnegative specializations of Schur polynomials (the original conjecture was proved by Sra [33], and refined by Khare and Tao [20]). The purpose of this paper is to prove a general principle that yields a large family of majorization-characterizing inequalities in a very general context; in particular, Theorem 1.1 emerges as a special case of this construction.…”
Section: Introductionmentioning
confidence: 81%
“…For any λ, µ ∈ W N , we have λ µ if and only if L λ ≥ L µ pointwise on R N . Theorem 1.1 generalizes an ex-conjecture of Cuttler, Greene, and Skandera [6] which characterizes the majorization order on Young diagrams via nonnegative specializations of Schur polynomials (the original conjecture was proved by Sra [33], and refined by Khare and Tao [20]). The purpose of this paper is to prove a general principle that yields a large family of majorization-characterizing inequalities in a very general context; in particular, Theorem 1.1 emerges as a special case of this construction.…”
Section: Introductionmentioning
confidence: 81%
“…In [35], the author used the Harish-Chandra-Itzykson-Zuber (HCIZ) integral to represent the term-normalized Schur polynomials in order to obtain a monotonicity result concerning a conjecture formulated in [10]. As mentioned earlier, we shall next use the integral representation obtained in Section 2 to provide a generalization of the preceding theorem.…”
Section: On the Monotonicity Of Complete Symmetric Polynomialsmentioning
confidence: 99%
“…Our work is based on majorization methods for moments and thus differs from the algebraic approach used in [10]. Since the integrand in HCIZ involves two matrices, the author in [35] was able to express the term-normalized Schur polynomial as a single integral (over the set of unitary matrices). The existence of the exponential term in HCIZ was needed to obtain a Schur convexity result.…”
Section: On the Monotonicity Of Complete Symmetric Polynomialsmentioning
confidence: 99%
See 2 more Smart Citations