Identifier
- St000823: Set partitions ⟶ ℤ
Values
{{1,2}} => 2
{{1},{2}} => 1
{{1,2,3}} => 3
{{1,2},{3}} => 2
{{1,3},{2}} => 2
{{1},{2,3}} => 1
{{1},{2},{3}} => 1
{{1,2,3,4}} => 4
{{1,2,3},{4}} => 3
{{1,2,4},{3}} => 3
{{1,2},{3,4}} => 2
{{1,2},{3},{4}} => 2
{{1,3,4},{2}} => 3
{{1,3},{2,4}} => 2
{{1,3},{2},{4}} => 1
{{1,4},{2,3}} => 2
{{1},{2,3,4}} => 1
{{1},{2,3},{4}} => 1
{{1,4},{2},{3}} => 2
{{1},{2,4},{3}} => 1
{{1},{2},{3,4}} => 1
{{1},{2},{3},{4}} => 1
{{1,2,3,4,5}} => 5
{{1,2,3,4},{5}} => 4
{{1,2,3,5},{4}} => 4
{{1,2,3},{4,5}} => 3
{{1,2,3},{4},{5}} => 3
{{1,2,4,5},{3}} => 4
{{1,2,4},{3,5}} => 3
{{1,2,4},{3},{5}} => 2
{{1,2,5},{3,4}} => 3
{{1,2},{3,4,5}} => 2
{{1,2},{3,4},{5}} => 2
{{1,2,5},{3},{4}} => 3
{{1,2},{3,5},{4}} => 2
{{1,2},{3},{4,5}} => 2
{{1,2},{3},{4},{5}} => 2
{{1,3,4,5},{2}} => 4
{{1,3,4},{2,5}} => 3
{{1,3,4},{2},{5}} => 1
{{1,3,5},{2,4}} => 3
{{1,3},{2,4,5}} => 2
{{1,3},{2,4},{5}} => 2
{{1,3,5},{2},{4}} => 2
{{1,3},{2,5},{4}} => 1
{{1,3},{2},{4,5}} => 1
{{1,3},{2},{4},{5}} => 1
{{1,4,5},{2,3}} => 3
{{1,4},{2,3,5}} => 2
{{1,4},{2,3},{5}} => 1
{{1,5},{2,3,4}} => 2
{{1},{2,3,4,5}} => 1
{{1},{2,3,4},{5}} => 1
{{1,5},{2,3},{4}} => 2
{{1},{2,3,5},{4}} => 1
{{1},{2,3},{4,5}} => 1
{{1},{2,3},{4},{5}} => 1
{{1,4,5},{2},{3}} => 3
{{1,4},{2,5},{3}} => 2
{{1,4},{2},{3,5}} => 1
{{1,4},{2},{3},{5}} => 1
{{1,5},{2,4},{3}} => 2
{{1},{2,4,5},{3}} => 1
{{1},{2,4},{3,5}} => 1
{{1},{2,4},{3},{5}} => 1
{{1,5},{2},{3,4}} => 2
{{1},{2,5},{3,4}} => 1
{{1},{2},{3,4,5}} => 1
{{1},{2},{3,4},{5}} => 1
{{1,5},{2},{3},{4}} => 2
{{1},{2,5},{3},{4}} => 1
{{1},{2},{3,5},{4}} => 1
{{1},{2},{3},{4,5}} => 1
{{1},{2},{3},{4},{5}} => 1
{{1,2,3,4,5,6}} => 6
{{1,2,3,4,5},{6}} => 5
{{1,2,3,4,6},{5}} => 5
{{1,2,3,4},{5,6}} => 4
{{1,2,3,4},{5},{6}} => 4
{{1,2,3,5,6},{4}} => 5
{{1,2,3,5},{4,6}} => 4
{{1,2,3,5},{4},{6}} => 3
{{1,2,3,6},{4,5}} => 4
{{1,2,3},{4,5,6}} => 3
{{1,2,3},{4,5},{6}} => 3
{{1,2,3,6},{4},{5}} => 4
{{1,2,3},{4,6},{5}} => 3
{{1,2,3},{4},{5,6}} => 3
{{1,2,3},{4},{5},{6}} => 3
{{1,2,4,5,6},{3}} => 5
{{1,2,4,5},{3,6}} => 4
{{1,2,4,5},{3},{6}} => 2
{{1,2,4,6},{3,5}} => 4
{{1,2,4},{3,5,6}} => 3
{{1,2,4},{3,5},{6}} => 3
{{1,2,4,6},{3},{5}} => 3
{{1,2,4},{3,6},{5}} => 2
{{1,2,4},{3},{5,6}} => 2
{{1,2,4},{3},{5},{6}} => 2
{{1,2,5,6},{3,4}} => 4
{{1,2,5},{3,4,6}} => 3
>>> Load all 1200 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
The number of unsplittable factors of the set partition.
Let $\pi$ be a set partition of $m$ into $k$ parts and $\sigma$ a set partition of $n$ into $\ell$ parts. Then their split product is the set partition of $m+n$ with blocks
$$ B_1 \cup (C_1+m),\dots,B_k \cup (C_k+m), C_{k+1}+m,\dots,C_\ell+m $$
if $k\leq \ell$ and
$$ B_1 \cup (C_1+m),\dots,B_\ell \cup (C_\ell+m), B_{\ell+1},\dots,B_k $$
otherwise.
Let $\pi$ be a set partition of $m$ into $k$ parts and $\sigma$ a set partition of $n$ into $\ell$ parts. Then their split product is the set partition of $m+n$ with blocks
$$ B_1 \cup (C_1+m),\dots,B_k \cup (C_k+m), C_{k+1}+m,\dots,C_\ell+m $$
if $k\leq \ell$ and
$$ B_1 \cup (C_1+m),\dots,B_\ell \cup (C_\ell+m), B_{\ell+1},\dots,B_k $$
otherwise.
References
[1] Chen, W. Y. C., Li, T. X. S., Wang, D. G. L. A bijection between atomic partitions and unsplitable partitions MathSciNet:2770112
[2] Triangle read by rows: T(n,k) = number of noncommutative symmetric polynomials of degree n that have exactly k different variables appearing in each monomial and which generate the algebra of all noncommutative symmetric polynomials (n >= 1, 1 <= k <= n). OEIS:A055105
[2] Triangle read by rows: T(n,k) = number of noncommutative symmetric polynomials of degree n that have exactly k different variables appearing in each monomial and which generate the algebra of all noncommutative symmetric polynomials (n >= 1, 1 <= k <= n). OEIS:A055105
Code
def statistic(pi):
return len(split(pi))
def split_product(pi, sigma):
"""
An associative product.
sage: split_product([[1,2]],[[1,3],[2]])
{{1, 2, 3, 5}, {4}}
sage: split_product([[1,3],[2]],[[1,2]])
{{1, 3, 4, 5}, {2}}
"""
pi = sorted([sorted(B) for B in pi])
sigma = sorted([sorted(B) for B in sigma])
k = len(pi)
l = len(sigma)
m = SetPartition(pi).size()
if k <= l:
return SetPartition([B + [c+m for c in C] for B, C in zip(pi, sigma)]
+ [[c+m for c in C] for C in sigma[k:]])
else:
return SetPartition([B + [c+m for c in C] for B, C in zip(pi, sigma)]
+ pi[l:])
@cached_function
def unsplittable(n):
"""
sage: [len(unsplittable(n)) for n in range(1,8)]
[1, 1, 2, 6, 22, 92, 426]
sage: oeis(_)
0: A074664: Number of algebraically independent elements of degree n in the algebra of symmetric polynomials in noncommuting variables.
"""
return Set(SetPartitions(n)).difference(Set([split_product(pi, sigma) for k in range(1,n) for pi in SetPartitions(k) for sigma in SetPartitions(n-k)]))
def split(pi):
pi = SetPartition(pi)
n = pi.size()
if pi in unsplittable(n):
return [pi]
for l in range(1, n):
for sigma in unsplittable(l):
for kappa in SetPartitions(n-l):
if pi == split_product(sigma, kappa):
return [sigma] + split(kappa)
Created
May 30, 2017 at 09:43 by Martin Rubey
Updated
Nov 18, 2017 at 22:17 by Martin Rubey
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!