#13917: IndependentSets class
---------------------------------+------------------------------------------
Reporter: ncohen | Owner: jason, ncohen, rlm
Type: enhancement | Status: needs_review
Priority: major | Milestone: sage-5.10
Component: graph theory | Resolution:
Keywords: | Work issues:
Report Upstream: N/A | Reviewers: ahmorales
Authors: Nathann Cohen | Merged in:
Dependencies: | Stopgaps:
---------------------------------+------------------------------------------
Comment (by vdelecroix):
Hi,
People from statistical physics are interested in finer quantities than
the number of independent configurations (independent sets are related to
particule interactions). In their case each configuration is counted with
a weight of the form `$\prod_{v \in I} \lambda(v)$` where `$\lambda: V
\rightarrow \mathbb{R}_+$` is a function on the vertices. Considering the
case of $\lambda$ being constant, the code could even return the
polynomial `$f(\lambda)$` whose coefficient for `$\lambda^k$` is the
number of independent set with `$k$` vertices (or equivalently the list of
number of independent set of given size). Perhaps this polynomial has a
name in graph theory ?
I let the serious comments to the reviewer.
Vincent
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/13917#comment:5>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
Visit this group at http://groups.google.com/group/sage-trac?hl=en.
For more options, visit https://groups.google.com/groups/opt_out.
