Identifier
-
Mp00154:
Graphs
—core⟶
Graphs
Mp00037: Graphs —to partition of connected components⟶ Integer partitions
Mp00321: Integer partitions —2-conjugate⟶ Integer partitions
St000205: Integer partitions ⟶ ℤ
Values
([],1) => ([],1) => [1] => [1] => 0
([],2) => ([],1) => [1] => [1] => 0
([(0,1)],2) => ([(0,1)],2) => [2] => [2] => 0
([],3) => ([],1) => [1] => [1] => 0
([(1,2)],3) => ([(0,1)],2) => [2] => [2] => 0
([(0,2),(1,2)],3) => ([(0,1)],2) => [2] => [2] => 0
([(0,1),(0,2),(1,2)],3) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([],4) => ([],1) => [1] => [1] => 0
([(2,3)],4) => ([(0,1)],2) => [2] => [2] => 0
([(1,3),(2,3)],4) => ([(0,1)],2) => [2] => [2] => 0
([(0,3),(1,3),(2,3)],4) => ([(0,1)],2) => [2] => [2] => 0
([(0,3),(1,2)],4) => ([(0,1)],2) => [2] => [2] => 0
([(0,3),(1,2),(2,3)],4) => ([(0,1)],2) => [2] => [2] => 0
([(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,3),(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,2),(0,3),(1,2),(1,3)],4) => ([(0,1)],2) => [2] => [2] => 0
([(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [4] => [2,2] => 0
([],5) => ([],1) => [1] => [1] => 0
([(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(2,4),(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(1,4),(2,4),(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(0,4),(1,4),(2,4),(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(1,4),(2,3)],5) => ([(0,1)],2) => [2] => [2] => 0
([(1,4),(2,3),(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(0,1),(2,4),(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(1,4),(2,3),(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(1,3),(1,4),(2,3),(2,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(0,4),(1,2),(1,3),(2,4),(3,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(1,3),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(0,3),(0,4),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(1,3),(2,3),(2,4)],5) => ([(0,1)],2) => [2] => [2] => 0
([(0,1),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,3),(1,2),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,3),(0,4),(1,2),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => [5] => [2,2,1] => 1
([(0,1),(0,4),(1,3),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,3),(0,4),(1,2),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(1,2),(1,3),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [4] => [2,2] => 0
([(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [4] => [2,2] => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [4] => [2,2] => 0
([(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,4),(3,4)],5) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(1,2),(1,3),(2,3)],4) => [4] => [2,2] => 0
([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => ([(0,1),(0,2),(0,3),(0,4),(1,2),(1,3),(1,4),(2,3),(2,4),(3,4)],5) => [5] => [2,2,1] => 1
([],6) => ([],1) => [1] => [1] => 0
([(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(2,5),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,5),(1,5),(2,5),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(2,5),(3,4)],6) => ([(0,1)],2) => [2] => [2] => 0
([(2,5),(3,4),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,2),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(1,5),(2,5),(3,4),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,1),(2,5),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,5),(2,5),(3,4),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,5),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,5),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,5),(1,5),(2,4),(3,4)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,5),(2,3),(2,4),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,5),(1,5),(2,3),(3,4),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,5),(2,4),(3,4),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,5),(1,5),(2,3),(2,4),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,4),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,4),(0,5),(1,4),(1,5),(2,4),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,4),(2,3)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,5),(2,4),(3,4),(3,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(0,1),(2,5),(3,4),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,2),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,4),(2,3),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,4),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,1),(2,5),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,4),(1,5),(2,3),(2,5),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(1,4),(1,5),(2,3),(2,5),(3,4)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => [5] => [2,2,1] => 1
([(0,5),(1,4),(2,3),(2,4),(3,5),(4,5)],6) => ([(0,1)],2) => [2] => [2] => 0
([(1,2),(1,5),(2,4),(3,4),(3,5),(4,5)],6) => ([(0,1),(0,2),(1,2)],3) => [3] => [2,1] => 0
([(0,5),(1,2),(1,4),(2,3),(3,5),(4,5)],6) => ([(0,3),(0,4),(1,2),(1,4),(2,3)],5) => [5] => [2,2,1] => 1
>>> Load all 208 entries. <<<
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
Number of non-integral Gelfand-Tsetlin polytopes with prescribed top row and partition weight.
Given $\lambda$ count how many integer partitions $w$ (weight) there are, such that
$P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex.
Given $\lambda$ count how many integer partitions $w$ (weight) there are, such that
$P_{\lambda,w}$ is non-integral, i.e., $w$ such that the Gelfand-Tsetlin polytope $P_{\lambda,w}$ has at least one non-integral vertex.
Map
to partition of connected components
Description
Return the partition of the sizes of the connected components of the graph.
Map
2-conjugate
Description
Return a partition with the same number of odd parts and number of even parts interchanged with the number of cells with zero leg and odd arm length.
This is a special case of an involution that preserves the sequence of non-zero remainders of the parts under division by $s$ and interchanges the number of parts divisible by $s$ and the number of cells with zero leg length and arm length congruent to $s-1$ modulo $s$.
In particular, for $s=1$ the involution is conjugation, hence the name.
This is a special case of an involution that preserves the sequence of non-zero remainders of the parts under division by $s$ and interchanges the number of parts divisible by $s$ and the number of cells with zero leg length and arm length congruent to $s-1$ modulo $s$.
In particular, for $s=1$ the involution is conjugation, hence the name.
Map
core
Description
The core of a graph.
The core of a graph $G$ is the smallest graph $C$ such that there is a homomorphism from $G$ to $C$ and a homomorphism from $C$ to $G$.
Note that the core of a graph is not necessarily connected, see [2].
The core of a graph $G$ is the smallest graph $C$ such that there is a homomorphism from $G$ to $C$ and a homomorphism from $C$ to $G$.
Note that the core of a graph is not necessarily connected, see [2].
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!