[sage-devel] Standard/Recommended practices for adding codes with third-party libraries into Sage codebase?

Dear all, In the past few months I have been working on a Sage library for counting graph homomorphisms: https://github.com/guojing0/count-graph-homs (It's still updating, hence not 100% complete) In `concurrent_hom_count.py`, I use third-party libraries, such as `numba`, `dask`, and `numpy`.

[sage-devel] Re: CI Is (Generally) Broken

I've now set https://github.com/sagemath/sage/pull/37998 back to "need work" for the following reasons: - Needs to be tested on all 6 os/python version combinations - Updates of the conda lock files should never require additions to the "known bugs" exclusions. If a certain version upgrade result

[sage-devel] Re: Standard/Recommended practices for adding codes with third-party libraries into Sage codebase?

On Sunday, May 19, 2024 at 12:53:25 PM UTC-7 Jing Guo wrote: In the past few months I have been working on a Sage library for counting graph homomorphisms: https://github.com/guojing0/count-graph-homs (It's still updating, hence not 100% complete) In `concurrent_hom_count.py`, I use third-party

[sage-devel] Re: collect names of all optional arguments used in sage

I could imagine that such a reference would be valuable as an additional index to our reference manual. I would suggest to look into implementing it as a Sphinx extension (after checking whether something like this already exists). Sage already uses a custom version of the Sphinx autodoc exte

[sage-devel] Re: Build from source on Apple Silicon M3

You'll need: - https://github.com/sagemath/sage/pull/38025 - https://github.com/sagemath/sage/pull/38008 - https://github.com/sagemath/sage/pull/37919 - https://github.com/sagemath/sage/pull/38021 On Sunday, May 19, 2024 at 7:04:58 PM UTC-7 Trevor Karn wrote: > Hi all, > > I am trying to build fr

[sage-devel] Re: Build from source on Apple Silicon M3

Thanks Matthias! I can build off of commit a8a8dd875a On Sunday, May 19, 2024 at 9:44:20 PM UTC-5 Matthias Koeppe wrote: > You'll need: > - https://github.com/sagemath/sage/pull/38025 > - https://github.com/sagemath/sage/pull/38008 > - https://github.com/sagemath/sage/pull/37919 > - https://githu

[sage-devel] OT Efficient probabilistic factorization of F(x,y)=g(x,y) f(x,y) modulo composite integers n assuming the solution is unique

Sorry for offtopic. We give efficient probabilistic factorization of F(x,y)=g(x,y) f(x,y) modulo composite integers n assuming the solution is unique. The main contribution is the observation that `Ideal(J).groebner_basis()` is efficient for overdetermined `J` and it works modulo n The preprint i