 | ECS #779: A simple grammar |
| Introduction | Examples | Search | Submit | Help | Links |
1. Description
No description available
2. Specification
This unlabelled structure is specified as S in
\displaystyle
\left\{ B={\rm PowerSet} \left( C \right) ,C={\rm Cycle} \left( S
\right) ,S={\rm Prod} \left( B,Z \right) \right\}
other formats
3. Coefficients
3.1. First terms
4. Ordinary generating function
\displaystyle
[B \left( x \right) ={{\rm e}^{\sum _{j_{{1}}=1}^{\infty }-{\frac {
\left( -1 \right) ^{j_{{1}}}C \left( {x}^{j_{{1}}} \right) }{j_{{1}}}}
}},C \left( x \right) =\sum _{j_{{2}}=1}^{\infty }{\frac {{\rm phi}
\left( j_{{2}} \right) \ln \left( \left( 1-S \left( {x}^{j_{{2}}}
\right) \right) ^{-1} \right) }{j_{{2}}}},S \left( x \right) =B
\left( x \right) x,Z \left( x \right) =x]
other formats
5. References
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).