Results 11 to 20 of about 3,811 (236)

Schur Convexity and Inequalities for a Multivariate Symmetric Function

open access: yesJournal of Function Spaces, 2020
In the article, we provide the Schur, Schur multiplicative, and Schur harmonic convexities properties for the symmetry function Fnx,r=Fnx1,x2,⋯,xn;r=∏1 ...
Ming-Bao Sun   +3 more
doaj   +2 more sources

Characteristic Function, Schur Parameters and Pseudocontinuation of Schur functions

open access: yes, 2023
In [19] there is an approach to the investigation of the pseudocontinuability of Schur functions in terms of Schur parameters. In particular, there was obtained a criterion for the pseudocontinuability of Schur functions and the Schur parameters of rational Schur functions were described.
Dubovoy, Vladimir K.   +4 more
openaire   +3 more sources

Generalized Schur Functions and Augmented Schur Parameters [PDF]

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). In this note we prove a similar result for generalized Schur functions.
Dijksma, Aad, Wanjala, Gerald
core   +5 more sources

Ribbon Schur Functions

open access: yesEuropean Journal of Combinatorics, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alain Lascoux, Piotr Pragacz
openaire   +3 more sources

New Schur Function Series

open access: yesJournal of Algebra, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ishikawa, Masao, Wakayama, Masato
openaire   +3 more sources

A unimodality identity for a Schur function

open access: yesJournal of Combinatorial Theory, Series A, 1992
A new formula for the principal specialization of a Schur function is given. The identity implies that the sequence of coefficients of this polynomial is unimodal. The proof of the main result is based on a combinatorial construction due to \textit{S. V. Kerov}, \textit{A. N. Kirillov} and \textit{N. Yu. Reshetikhin} [J. Sov. Math. 41, No. 2, 916--924 (
Frederick M. Goodman   +2 more
openaire   +2 more sources

A pólya interpretation of the schur function

open access: yesJournal of Combinatorial Theory, Series A, 1980
AbstractWhen the Schur function is written as a linear combination of products of symmetric power sums, it takes the form of a character-weighted cycle index polynomial. A Pólya-like interpretation is given to this formula and a purely combinatorial proof is given. Some observations concerning general group actions are made.
White, Dennis E
openaire   +2 more sources

Schur Products [PDF]

open access: yesScienceOpen Research, 2014
The projective representation of groups was introduced in 1904 by Issai Schur. It differs from the normal representation of groups by a twisting factor, which we call Schur function in this book and which is called sometimes normalized factor set in the ...
Corneliu Constantinescu
doaj   +2 more sources

Aggregating distributed energy resources for grid flexibility services: A distributed game theoretic approach

open access: yesInternational Journal of Robust and Nonlinear Control, EarlyView., 2023
Abstract We propose a hierarchical energy management scheme for aggregating Distributed Energy Resources (DERs) for grid flexibility services. To prevent a direct participation of numerous prosumers in the wholesale electricity market, aggregators, as self‐interest agents in our scheme, incentivize prosumers to provide flexibility. We firstly model the
Xiupeng Chen   +3 more
wiley   +1 more source

Row-strict quasisymmetric Schur functions [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the $\textit{quasisymmetric Schur function basis}$ which are generated combinatorially through fillings of composition diagrams in much the same way as ...
Sarah K Mason, Jeffrey Remmel
doaj   +1 more source

Home - About - Disclaimer - Privacy