I have an idea for a project but no time this year for mentoring (maybe
next one)
The idea boils down to develop a random testing framework to find (in some
way minimal) failing examples (wrong answers or crashes)
using bots (like running patchbot to test sage).
So if someone is willing, able
On Wednesday, February 8, 2017 at 11:03:57 AM UTC, David Coudert wrote:
>
> That's clearly something we need.
> If the student is good and fast, (s)he can also try to implement the
> split-decomposition which is a generalization of modular decomposition that
> can be computed in linear time
That's clearly something we need.
If the student is good and fast, (s)he can also try to implement the
split-decomposition which is a generalization of modular decomposition that
can be computed in linear time (roughly finds complete bipartite graph
separators).
Also, we could consider adding
On Tuesday, February 7, 2017 at 11:13:40 PM UTC+1, mmarco wrote:
>
> I don't plan to have much time available to mentor, but I think the
> project of porting rubi to sage would be doable. Someone wants to step in
> as a co-mentor?
>
No GSoC commitment from me but a support statement.
--
You
I've added a project on modular decomposition of graphs and digraphs.
How many more we would like to have?
On Thursday, January 19, 2017 at 6:05:19 PM UTC, Harald Schilly wrote:
>
> Hello, this year's Google Summer of Code 2017 just started.
>
> I assume we will try again to be part of it, and
On Tuesday, February 7, 2017 at 9:33:22 AM UTC-6, Travis Scrimshaw wrote:
>
> I added two projects with the somewhat broad subject areas:
>
> - Improve the representation theory in Sage
> - Improve the root system code in Sage
>
> I added another one for quantum cluster algebras (based on a
I added two projects with the somewhat broad subject areas:
- Improve the representation theory in Sage
- Improve the root system code in Sage
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving
I can add (and volunteer to mentor) a project to develop an implementation of
graph modular decomposition (which is very broken in Sage, and no 3rd party
implementations are suitable for interfacing)
--
You received this message because you are subscribed to the Google Groups
"sage-devel"
Hi Harald,
Thanks for yelling out. I've added the polynomial class project that
I mentioned on the list earlier. But 1 project is surely not enough...
Best,
Johan
Harald Schilly writes:
> Hello, in 3 days is the deadline regarding the project application.
> I'm working on the application
Hello, in 3 days is the deadline regarding the project application.
I'm working on the application itself, but a list of suggested
projects is *vital* to getting approval. I saw a few ideas here, but
so far not a single proposal was added to
https://wiki.sagemath.org/GSoC/2017
Please compare it
On Friday, January 20, 2017 at 8:40:06 PM UTC+1, mmarco wrote:
>
> I am not sure I will have time to be a mentor this year, but I would like
> to propose porting rubi to sage:
>
The main tasks would be:
1. implement missing symbolic functions (Meijer-G, Appell, etc.)
2. convert the ruleset to an
I am not sure I will have time to be a mentor this year, but I would like
to propose porting rubi to sage:
http://www.apmaths.uwo.ca/~arich/
It is a series of rules (over 6000) to be applied to symbolic expressions
in order to get their primitive. The results they produce are better than
the
12 matches
Mail list logo
