I have a draft document at
https://github.com/sagemath/sage/wiki/NumFOCUS#project-governance that
could be updated to describe some of the elevated repository permissions
and what functions/duties they are needed for.
On Tuesday, May 14, 2024 at 6:14:22 PM UTC-7 David Roe wrote:
> On Tue, May
On Tue, May 14, 2024 at 9:13 PM Dima Pasechnik wrote:
>
>
> On 14 May 2024 22:55:01 BST, "julian...@fsfe.org"
> wrote:
> >I granted "write" permissions to you. That seems to be the required
> >permission to approve workflow runs.
>
> IIRC, such permissions are automatic for the members of
On 14 May 2024 22:55:01 BST, "julian...@fsfe.org" wrote:
>I granted "write" permissions to you. That seems to be the required
>permission to approve workflow runs.
IIRC, such permissions are automatic for the members of triage team.
Could you check that Martin is there?
>
>Can you check that
Thank you, yes, I now have the appropriate button!
Wonderful!
On Tuesday 14 May 2024 at 23:55:01 UTC+2 julian...@fsfe.org wrote:
> I granted "write" permissions to you. That seems to be the required
> permission to approve workflow runs.
>
> Can you check that it works now?
>
> julian
>
> PS:
I granted "write" permissions to you. That seems to be the required
permission to approve workflow runs.
Can you check that it works now?
julian
PS: If this should be done differently, please let me know and I'll revoke
that permission again :)
On Tuesday, May 14, 2024 at 11:55:53 PM UTC+3
Could I have the right to approve github actions?
Otherwise, mentoring the GSOC student over github is a pain.
Best wishes,
Martin (mantepse)
--
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, May 14, 2024 at 1:48 AM Matthias Koeppe
wrote:
>
> On Sunday, May 12, 2024 at 6:50:05 PM UTC-7 Travis Scrimshaw wrote:
>
> That model is not how we have worked as a community, nor do I think it is a
> productive way to run a smaller developer community such as ours.
>
>
> I'm not sure
We found and implemented in sage efficient algorithm for factoring
bivariate polynomials modulo composite modulus assuming the solution
is unique up to a constant factor.
More formally let $K=\mathbb{Z}/n\mathbb{Z}[x,y]$.
Given $F \in K$ in general we can find solution $f,g$ such
that $F=f g$
