نتایج جستجو برای: schur index

تعداد نتایج: 400323  

2015
Christopher R. Dance Tomi Silander

We study the restless bandit associated with an extremely simple scalar Kalman filter model in discrete time. Under certain assumptions, we prove that the problem is indexable in the sense that the Whittle index is a non-decreasing function of the relevant belief state. In spite of the long history of this problem, this appears to be the first such proof. We use results about Schur-convexity an...

Journal: :wavelet and linear algebra 2015
m. khosravi a. sheikhhosseini

for a ∈ mn, the schur multiplier of a is defined as s a(x) =a ◦ x for all x ∈ mn and the spectral norm of s a can be stateas ∥s a∥ = supx,0 ∥a ∥x ◦x ∥ ∥. the other norm on s a can be definedas ∥s a∥ω = supx,0 ω(ω s( ax (x ) )) = supx,0 ωω (a (x ◦x ) ), where ω(a) standsfor the numerical radius of a. in this paper, we focus on therelation between the norm of schur multiplier of product of matric...

Journal: :Electr. J. Comb. 2014
Carolina Benedetti Nantel Bergeron

The main purpose of this paper is to show that the multiplication of a Schubert polynomial of finite type A by a Schur function, which we refer to as Schubert vs. Schur problem, can be understood combinatorially from the multiplication in the space of dual k-Schur functions. Using earlier work by the second author, we encode both problems by means of quasisymmetric functions. On the Schubert vs...

2008
MINORU ITOH

We introduce a class of Schur type functions associated with polynomial sequences of binomial type. This can be regarded as a generalization of the ordinary Schur functions and the factorial Schur functions. This generalization satisfies some interesting expansion formulas, in which there is a curious duality. Moreover this class includes examples which are useful to describe the eigenvalues of...

2005
PAVLO PYLYAVSKYY

We prove Okounkov’s conjecture, a conjecture of Fomin-FultonLi-Poon, and a special case of Lascoux-Leclerc-Thibon’s conjecture on Schur positivity and give several more general statements using a recent result of Rhoades and Skandera. An alternative proof of this result is provided. We also give an intriguing log-concavity property of Schur functions. 1. Schur positivity conjectures The ring of...

2014
A. M. Hamel

Symplectic and orthogonal Schur functions can be defined combinatorially in a manner similar to the classical Schur functions. This paper demonstrates that they can also be expressed as determinants. These determinants are generated using planar decompositions of tableaux into strips and the equivalence of these determinants to symplectic or orthogonal Schur functions is established by Gessel-V...

Journal: :Electr. J. Comb. 2009
Farzin Barekat Stephanie van Willigenburg

We introduce a new operation on skew diagrams called composition of transpositions, and use it and a Jacobi-Trudi style formula to derive equalities on skew Schur Q-functions whose indexing shifted skew diagram is an ordinary skew diagram. When this skew diagram is a ribbon, we conjecture necessary and sufficient conditions for equality of ribbon Schur Q-functions. Moreover, we determine all re...

Journal: :Eur. J. Comb. 2009
Peter R. W. McNamara Stephanie van Willigenburg

There is considerable current interest in determining when the difference of two skew Schur functions is Schur positive. While the general solution for ribbon Schur functions seems out of reach at present, we determine necessary and sufficient conditions for multiplicity-free ribbons, i.e. those whose expansion as a linear combination of Schur functions has all coefficients either zero or one. ...

Journal: :Physical review 2021

We brute-force evaluate the vacuum character for $\mathcal{N}=2$ vertex operator algebras labeled by crystallographic complex reflection groups $G(k,1,1)={\mathbb{Z}}_{k}$, $k=3$, 4, 6, and $G(3,1,2)$. For ${\mathbb{Z}}_{3,4}$ $G(3,1,2)$ these characters have been conjectured to respectively reproduce Macdonald limit of superconformal index rank one two S-fold $\mathcal{N}=3$ theories in four d...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید