 | ECS #67: maps |
| Introduction | Examples | Search | Submit | Help | Links |
1. Description
- Partial maps
- (n+1)^n
2. Specification
This labelled structure is specified as S in
\displaystyle
\left\{ S={\rm Set} \left( {\rm Connected} \right) ,{\rm Tree}={\rm
Prod} \left( Z,{\rm Set} \left( {\rm Tree} \right) \right) ,{\rm
Connected}={\rm Union} \left( {\rm Cycle} \left( {\rm Tree} \right) ,{
\rm Prod} \left( {\rm Undefined},{\rm Tree} \right) \right) ,{\rm
Undefined}={\rm Epsilon} \right\}
other formats
3. Coefficients
3.1. First terms
3.2. Asymptotics
4. Exponential generating function
\displaystyle
-{\frac {{\rm LambertW} \left( -x \right) }{x \left( 1+{\rm LambertW}
\left( -x \right) \right) }}
other formats
5. References
6. Random structure
Search a combinatorial structure by: (firstTerms should be a sequence of integers, separated by commas).