Loading [MathJax]/jax/output/HTML-CSS/jax.js
Ask Your Question
0

Recursive combinatorial species

asked 2 years ago

Thrash gravatar image

updated 2 years ago

FrédéricC gravatar image

The combinatorial species of rooted trees can be defined recursively via A=XE(A), where X denotes the singleton species and E the set species. How can I make the following code work? The last command yields an error.

sage: X = species.SingletonSpecies()
sage: E = species.SetSpecies()
sage: A = CombinatorialSpecies()
sage: A.define(X*E(A))
sage: A.generating_series()
Preview: (hide)

1 Answer

Sort by » oldest newest most voted
1

answered 2 years ago

FrédéricC gravatar image

Like this (one has to tell the valuation now).

sage: X = species.SingletonSpecies()
sage: E = species.SetSpecies()
sage: A = CombinatorialSpecies(min=1)
sage: A.define(X*E(A))
sage: A
Combinatorial species with min=1
sage: A.generating_series()[0:4]
[0, 1, 1, 3/2]
Preview: (hide)
link

Your Answer

Please start posting anonymously - your entry will be published after you log in or create a new account.

Add Answer

Question Tools

Stats

Asked: 2 years ago

Seen: 187 times

Last updated: May 09 '23