Let $G$ be a finite simple graph.
Can we find all paths(induced ) of given length?
Thanks in advance.
--
You received this message because you are subscribed to the Google Groups
"sage-support" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
On Tuesday, July 25, 2017 at 5:53:37 AM UTC-7, springfield .gion wrote:
>
> Hi, I need to create and manipulate the additive semigroups generated by
> integers (such as those generated by tuples of coprime integers), but I am
> struggling with the syntax; is there an easy way to create
There is a nice GAP package for numerical semigroups. You can use that via
sage interface once you install it into the GAP under Sage (which could be
tricky). Check
https://www.gap-system.org/Packages/numericalsgps.html
--
You received this message because you are subscribed to the Google
Thanks, that solved the problem. (I wasn't aware that the actual phc binary
isn't included in sage while the interface to it is.)
Am Mittwoch, 26. Juli 2017 19:19:10 UTC+2 schrieb vdelecroix:
>
> Do you have phc installed on your computer? The error message says that
> there is no 'phc' command
Do you have phc installed on your computer? The error message says that
there is no 'phc' command available...
(I was not able to install phcpack so I can not properly test the interface)
On 26/07/2017 17:15, 'Peter Mueller' via sage-support wrote:
Trying the example from the doc of phc
Trying the example from the doc of phc results in:
sage: from sage.interfaces.phc import phc
sage: R. = PolynomialRing(CDF,2)
sage: testsys = [x^2 + 1, x*y - 1]
sage: phc.mixed_volume(testsys)
---
ExceptionPexpect