Gennadi Sardanashvily: Difference between revisions

From formulasearchengine
Jump to navigation Jump to search
en>Omnipaedista
per MOS:DOB
→‎Selected monographs: Geometric formulation of classical and quantum mechanics
 
Line 1: Line 1:
[[File:Semistandard_Young_tableaux_of_shape_(3,_2)_and_weight_(1,_1,_2,_1).png|thumb|right|The three semistandard Young tableaux of shape &lambda; = (3, 2) and weight &mu; = (1, 1, 2, 1).  They are counted by the Kostka number ''K''<sub>&lambda;&mu;</sub> = 3.]]
My name is Enrique (40 years old) and my hobbies are Darts and Australian Football League.<br><br>Also visit my web-site [http://www.ezramedicalcare.com/?document_srl=4814265 как правильно питаться чтобы похудеть]
 
In [[mathematics]], the '''Kostka number''' ''K''<sub>&lambda;&mu;</sub> (depending on two [[Partition (number theory)|integer partitions]] &lambda; and &mu;) is a [[non-negative integer]] that is equal to the number of [[semistandard Young tableaux]] of shape &lambda; and weight &mu;.  They were introduced by the mathematician [[Carl Kostka]] in his study of symmetric functions ({{harvtxt|Kostka|1882}}).<ref>Stanley, Enumerative combinatorics, volume 2, p. 398.</ref>
 
For example, if &lambda; = (3, 2) and &mu; = (1, 1, 2, 1), the Kostka number ''K''<sub>&lambda;&mu;</sub> counts the number of ways to fill a left-aligned collection of boxes with 3 in the first row and 2 in the second row with 1 copy of the number 1, 1 copy of the number 2, 2 copies of the number 3 and 1 copy of the number 4 such that the entries increase along columns and do not decrease along rows.  The three such tableaux are shown at right, and ''K''<sub>(3, 2) (1, 1, 2, 1)</sub> = 3.
 
==Examples and special cases==
For any partition &lambda;, the Kostka number ''K''<sub>&lambda;&lambda;</sub> is equal to 1: the unique way to fill the [[Young diagram]] of shape &lambda; = (&lambda;<sub>1</sub>, &lambda;<sub>2</sub>, ..., &lambda;<sub>''m''</sub>) with &lambda;<sub>1</sub> copies of 1, &lambda;<sub>2</sub> copies of 2, and so on, so that the resulting tableau is weakly increasing along rows and strictly increasing along columns is if all the 1s are placed in the first row, all the 2s are placed in the second row, and so on.  (This tableau is sometimes called the [[Yamanouchi tableau]] of shape &lambda;.)
 
The Kostka number ''K''<sub>&lambda;&mu;</sub> is positive (i.e., there exist semistandard Young tableaux of shape &lambda; and weight &mu;) if and only if &lambda; and &mu; are both partitions of the same integer ''n'' and &lambda; is larger than &mu; in [[dominance order]].<ref>Stanley, Enumerative combinatorics, volume 2, p. 315.</ref>
 
In general, there are no nice formulas known for the Kostka numbers.  However, some special cases are known.  For example, if &mu; = (1, 1, 1, ..., 1) is the partition whose parts are all 1 then a semistandard Young tableau of weight &mu; is a standard Young tableau; the number of standard Young tableaux of a given shape &lambda; is given by the [[hook-length formula]].
 
 
==Kostka numbers, symmetric functions and representation theory==
In addition to the purely [[combinatorics|combinatorial]] definition above, they can also be defined as the coefficients that arise when one expresses the [[Schur polynomial]] ''s''<sub>&lambda;</sub> as a [[linear combination]] of [[Ring_of_symmetric_functions#Defining_individual_symmetric_functions|monomial symmetric functions]] ''m''<sub>&mu;</sub>:
 
: <math>s_\lambda= \sum_\mu K_{\lambda\mu}m_\mu.\ </math>
 
Because of the connections between symmetric function theory and [[representation theory]], Kostka numbers also express the decomposition of the [[permutation module]] ''M''<sub>&mu;</sub> in terms of the representations ''V''<sub>&lambda;</sub> corresponding to the character ''s''<sub>&lambda;</sub>, i.e.,
 
: <math>M_\mu = \bigoplus_{\lambda} K_{\lambda \mu} V_\lambda.</math>
 
On the level of representations of the [[general linear group]] <math>\mathrm{GL}_n(\mathbb{C})</math>, the Kostka number ''K''<sub>&lambda;&mu;</sub> counts the dimension of the [[weight space]] corresponding to &mu; in the [[irreducible representation]] ''V''<sub>&lambda;</sub> (where we require &mu; and &lambda; to have at most ''n'' parts).
 
==Examples==
The Kostka numbers for partitions of size at most 3 are as follows:
: ''K''<sub>(0) (0)</sub> = 1 (here (0) represents the empty partition)
: ''K''<sub>(1) (1)</sub> = 1
: ''K''<sub>(2) (2)</sub> = ''K''<sub>(2) (1,1)</sub> = ''K''<sub>(1,1) (1,1)</sub> = 1, ''K''<sub>(1,1) (2)</sub> = 0.
: ''K''<sub>(3) (3)</sub> = ''K''<sub>(3) (2,1)</sub> = ''K''<sub>(3) (2,1)</sub> = 1
: ''K''<sub>(2,1) (3)</sub> = 0, ''K''<sub>(2,1) (2,1)</sub> = 1, ''K''<sub>(2,1) (1,1,1)</sub> = 2
: ''K''<sub>(1,1,1) (3)</sub> = ''K''<sub>(1,1,1) (2,1)</sub> = 0, ''K''<sub>(1,1,1) (1,1,1)</sub> = 1
 
These values are exactly the coefficients in the expansions of Schur functions in terms of monomial symmetric functions:
:''s'' = ''m'' = 1 (indexed by the empty partition)
:''s''<sub>1</sub> = ''m''<sub>1</sub>
:''s''<sub>2</sub> = ''m''<sub>2</sub> + ''m''<sub>11</sub>
:''s''<sub>11</sub> = ''m''<sub>11</sub>
:''s''<sub>3</sub> = ''m''<sub>3</sub> + ''m''<sub>21</sub> + ''m''<sub>111</sub>
:''s''<sub>21</sub> = ''m''<sub>21</sub> + 2''m''<sub>111</sub>
:''s''<sub>111</sub> = ''m''<sub>111.</sub>
 
{{harvtxt|Kostka|1882|loc=pages 118-120}} gave tables of these numbers for partitions of numbers up to 8.
 
==Generalizations==
Kostka numbers are special values of the 1 or 2 variable [[Kostka polynomial]]s:
: <math>K_{\lambda\mu}= K_{\lambda\mu}(1)=K_{\lambda\mu}(0,1). </math>
 
==Notes==
{{reflist}}
 
==References==
*{{citation|authorlink=Richard P. Stanley | first = Richard |last=Stanley|title=Enumerative combinatorics, volume 2|year=1999|publisher=Cambridge University Press}}
*{{citation|authorlink=C. Kostka | first=C. |last=Kostka|title=Über den Zusammenhang zwischen einigen Formen von symmetrischen Funktionen|journal= [[Crelle's Journal]]|volume= 93  |year=1882|pages=89–123|url=http://gdz.sub.uni-goettingen.de/no_cache/dms/load/img/?IDDOC=259790}}
*{{Citation | last1=Macdonald | first1=I. G. | author1-link=Ian G. Macdonald | title=Symmetric functions and Hall polynomials | url=http://www.oup.com/uk/catalogue/?ci=9780198504504 | publisher=The Clarendon Press Oxford University Press | edition=2nd | series=Oxford Mathematical Monographs | isbn=978-0-19-853489-1 | id={{MathSciNet | id = 1354144}} | year=1995}}
*{{springer|id=s/s120040|title=Schur functions in algebraic combinatorics|first=Bruce E. |last=Sagan | authorlink=Bruce Sagan}}
 
[[Category:Symmetric functions]]
[[Category:Numbers]]

Latest revision as of 20:37, 25 December 2014

My name is Enrique (40 years old) and my hobbies are Darts and Australian Football League.

Also visit my web-site как правильно питаться чтобы похудеть