On May 12, 2017, at 20:52 , Venkataraman S wrote:
> I vaguely remember that if one can quickly find a quadratic non-residue, one
> can find a primitive root fast. I don't remember the exact connection now.
> Does anybody in the group have any reference?
Internet search can be helpful in times
I vaguely remember that if one can quickly find a quadratic non-residue, one
can find a primitive root fast. I don't remember the exact connection now. Does
anybody in the group have any reference?
--
You received this message because you are subscribed to the Google Groups
"sage-support" gro
On Friday, May 12, 2017 at 10:23:43 AM UTC-4, John H Palmieri wrote:
>
> Sage has no interface to any persistent homology software. Please write
> one!
>
> --
>>
>>
>>>
+1 this would be a fantastic addition to Sage.
--
You received this message because you are subscribed to the Google Groups
Sage has no interface to any persistent homology software. Please write one!
--
John
On Friday, May 12, 2017 at 4:20:14 AM UTC-7, Dima Pasechnik wrote:
>
>
>
> On Friday, May 12, 2017 at 9:49:20 AM UTC+1, Pierre wrote:
>>
>> Is there any interface between Sage and persistent homology software?
On Friday, May 12, 2017 at 9:49:20 AM UTC+1, Pierre wrote:
>
> Is there any interface between Sage and persistent homology software? For
> example this:
>
> http://gudhi.gforge.inria.fr/
>
>
> or this:
>
>
> http://mrzv.org/software/dionysus/index.html
>
>
> (Older threads here or on sage-devel
Hi !
Is there any interface between Sage and persistent homology software? For
example this:
http://gudhi.gforge.inria.fr/
or this:
http://mrzv.org/software/dionysus/index.html
(Older threads here or on sage-devel seemed to indicate that the answer was
"no", but they're quite old.)
Inci
One way or the other, the bottleneck is in the primitivity test.
On Friday, May 12, 2017 at 4:36:20 AM UTC+1, Venkataraman S wrote:
>
> The German school thinks differently. There is a different (well known)
> algorithm due to Gauss. Take an arbitrary number a coprime to p. Find its
> order. If
