Identifier
-
Mp00148:
Finite Cartan types
—to root poset⟶
Posets
Mp00306: Posets —rowmotion cycle type⟶ Integer partitions
St001097: Integer partitions ⟶ ℤ
Values
['A',1] => ([],1) => [2] => 0
['A',2] => ([(0,2),(1,2)],3) => [3,2] => 1
['B',2] => ([(0,3),(1,3),(3,2)],4) => [4,2] => 0
['G',2] => ([(0,5),(1,5),(3,2),(4,3),(5,4)],6) => [6,2] => 0
search for individual values
searching the database for the individual values of this statistic
/
search for generating function
searching the database for statistics with the same generating function
Description
The coefficient of the monomial symmetric function indexed by the partition in the formal group law for linear orders.
For a generating function $f$ the associated formal group law is the symmetric function $f(f^{(-1)}(x_1) + f^{(-1)}(x_2), \dots)$, see [1].
This statistic records the coefficient of the monomial symmetric function $m_\lambda$ in the formal group law for linear orders, with generating function $f(x) = x/(1-x)$, see [1, sec. 3.4].
This statistic gives the number of Smirnov arrangements of a set of letters with $\lambda_i$ of the $i$th letter, where a Smirnov word is a word with no repeated adjacent letters. e.g., [3,2,1] = > 10 since there are 10 Smirnov rearrangements of the word 'aaabbc': 'ababac', 'ababca', 'abacab', 'abacba', 'abcaba', 'acabab', 'acbaba', 'babaca', 'bacaba', 'cababa'.
For a generating function $f$ the associated formal group law is the symmetric function $f(f^{(-1)}(x_1) + f^{(-1)}(x_2), \dots)$, see [1].
This statistic records the coefficient of the monomial symmetric function $m_\lambda$ in the formal group law for linear orders, with generating function $f(x) = x/(1-x)$, see [1, sec. 3.4].
This statistic gives the number of Smirnov arrangements of a set of letters with $\lambda_i$ of the $i$th letter, where a Smirnov word is a word with no repeated adjacent letters. e.g., [3,2,1] = > 10 since there are 10 Smirnov rearrangements of the word 'aaabbc': 'ababac', 'ababca', 'abacab', 'abacba', 'abcaba', 'acabab', 'acbaba', 'babaca', 'bacaba', 'cababa'.
Map
rowmotion cycle type
Description
The cycle type of rowmotion on the order ideals of a poset.
Map
to root poset
Description
The root poset of a finite Cartan type.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
This is the poset on the set of positive roots of its root system where $\alpha \prec \beta$ if $\beta - \alpha$ is a simple root.
searching the database
Sorry, this statistic was not found in the database
or
add this statistic to the database – it's very simple and we need your support!