I was double checking a problem from my combinatorics class (we are doing
Pólya enumeration) and I came across what I think is a bug in the
necklaces.py code.
I'll open a ticket, but I want to double check in case someone knows more
about this code than I do.
sage: Necklaces([0,2,1]).list()
Hey Mike,
We had the problem for Lyndon words
(http://trac.sagemath.org/ticket/12997), but it was hacked around. So
either we fix _sfc/_simple_fixed_content or we hack around it by stripping
leading 0's and then modifying the yielded elements (by adding # leading
0's).
Best,
Travis
On
That is really good to know. It seems that the code isn't handling input
vectors with leading 0's.
-Mike
--
You received this message because you are subscribed to the Google Groups
sage-combinat-devel group.
To unsubscribe from this group and stop receiving emails from it, send an email
to
I forgot an important part: could you tell me if you agree with the removal
of such functions ? If you object, can you say why ?
Thanks,
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To unsubscribe from this group and stop receiving
On Tue, 2 Dec 2014, Nathann Cohen wrote:
Poset.to_graph)
There are three graphs that I know which can be associated to a
Poset. Its comparability graph [1], its incomparability graph, and the
undirected version of its Hasse Diagram [2]. When I see
Poset.to_graph I cannot guess which one it
On Mon, 1 Dec 2014, Nils Bruin wrote:
The easy solution for Nathann and Jori for now is just to write their
high-performance code in terms of primitives: a tuple consisting of the
base set and some suitable description of the PO
I can use plain Hasse diagram.
A simple example of timings: If
I would have guessed that P.to_graph() returns a digraph.
Then you expected either P.hasse_diagram() or
P.hasse_diagram().transitive_closure().
Could there be just Graph(Poset) and maybe even DiGraph(Poset)?
Same problem, we would not know which graph or which digraph it
represents. With
On Tue, 2 Dec 2014, Nathann Cohen wrote:
Could there be just Graph(Poset) and maybe even DiGraph(Poset)?
Same problem, we would not know which graph or which digraph it
represents. With P.hasse_diagram() or P.comparability_graph() we know.
True. Then I think we should just remove
Single-threaded build after make distclean was successful. Currently
trying
export MAKE=make -j4
make distclean
make
Will report back tomorrow.
--Stefan.
On Tuesday, December 2, 2014 5:00:06 PM UTC+13, Stefan wrote:
On Tuesday, December 2, 2014 2:22:28 PM UTC+13, François wrote:
It
Hello,
For Graph I would remove the one line functions
- remove Graph.to_partition
- remove Graph.connected_components_number
or as a second choice
- rename Graph.to_partition - Graph.connected_components_sizes (with
an argument `multiplicity` if you need to emphasize that you will
repeat
That is great!. Where are those plugins available?
On a slightly unrelated subject, i could be interested in some way to
automatically convert sage worksheets into wiki pages.
El martes, 2 de diciembre de 2014 03:04:53 UTC+1, jason escribió:
On 12/1/14, 6:00, mmarco wrote:
P.S. 2: Is
On Monday, December 1, 2014 2:04:00 PM UTC-5, Volker Braun wrote:
Can somebody tell me for sure that the current osx binary is wrong? The
app and dmg have different sizes.
I can't do that since I don't have a recent enough OS X, *but* the MD5
hashes are the same, according to the
The 6.4 binary did not build the app version, but we fixed that for 6.4.1.
The latter are different.
On Tuesday, December 2, 2014 4:17:30 PM UTC, kcrisman wrote:
I can't do that since I don't have a recent enough OS X, *but* the MD5
hashes are the same, according to the download page.
Am 2014-12-01 um 19:37 schrieb Nils Bruin:
Interval fields apparently hide this (intervals are equal if they have
non-empty intersection?), but of course hash cannot respect this, because this
ComplexIntervalFieldElement.__richcmp__ says:
As with the real interval fields this never
Success again. I don't know what was different the first time. Sorry for
the noise.
--Stefan
On Tuesday, December 2, 2014 10:35:15 PM UTC+13, Stefan wrote:
Single-threaded build after make distclean was successful. Currently
trying
export MAKE=make -j4
make distclean
make
Will report
The emphasis lies on 'trying' Concerning image processing and control
theory matlab is prefered by most with good reason (for reference: I come
from these areas)
Since numpy/scipy/matplotlib is on board with Sage, it can easily challenge
Mathematica in these areas, since the scipy packages can
On Tue, Dec 2, 2014 at 10:43 PM, maldun dom...@gmx.net wrote:
Has someone more examples why he/she uses Sage instead of one of the 4Ms?
in such a list, vendor lock-in is also a good point. imagine mathworks
closes its doors …
-- harald
--
You received this message because you are subscribed
I strongly object to removing the function to_partition as it is useful
to people (beyond FindStat), but I'm not opposed to renaming it to
something like connected_components_partition. Similar for to_graph.
Although if you want to argue about removing one-line functions, we
should also
Hello Travis,
2014-12-03 0:24 UTC+01:00, Travis Scrimshaw tsc...@ucdavis.edu:
I strongly object to removing the function to_partition as it is useful
to people (beyond FindStat), but I'm not opposed to renaming it to
something like connected_components_partition.
I find your proposition
sage: a = CIF(RIF(0, 1), RIF(0, 1))
sage: a is a
True
sage: a == a
False
So equality is not even reflexive.
Okay. Please never define a graph with these things as vertices :-D
Nathann
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To
The 6.4.1 download _does_ give the app.
-Ivan
On Dec 1, 2014, at 12:03 PM, Volker Braun vbraun.n...@gmail.com wrote:
Can somebody tell me for sure that the current osx binary is wrong? The app
and dmg have different sizes.
On Monday, December 1, 2014 6:54:29 PM UTC, kcrisman wrote:
Hello !
I strongly object to removing the function to_partition as it is useful
to people (beyond FindStat),
I would be interested to know how. Do you use it yourself ?
but I'm not opposed to renaming it to something
like connected_components_partition.
As Vincent said,
I would be interested to know how. Do you use it yourself ?
I have used it, although I wasn't using the fact it returned a Partition
instance.
but I'm not opposed to renaming it to something
like connected_components_partition.
As Vincent said, 'connected_components_partition'
Hello !
I have used it, although I wasn't using the fact it returned a Partition
instance.
Oh. So what you needed was actually map(len, G.connected_components()).
Well, this functon has been added in order to return a partition (this the
name _to_partition), and this is one thing I find no
I would like to know if anybody tried to install PyClaw in Sage.
http://www.clawpack.org/doc/pyclaw/
I am interested, and I propose to make an spkg.
Yours
t.d.
--
You received this message because you are subscribed to the Google Groups
sage-devel group.
To unsubscribe from this group and
On Wed, 3 Dec 2014, Vincent Delecroix wrote:
By one line function I meant one line function that anybody can
reproduce after one hour of Python.
To give two specific examples: on posets there are is_connected() and
minimal_elements(). First is just a direct wrapper to graph function with
26 matches
Mail list logo
