A few years back, there were efforts to support the creation of
pip-installable user packages by preparing project templates that provide
some common infrastructure for building and testing etc.
- https://github.com/sagemath/sage_sample
- Marc Masdeu's
On Wednesday, May 1, 2024 at 1:35:08 PM UTC-7 Matthias Koeppe wrote:
[...] SageMath makes use of hundreds of *"upstream" projects: third-party,
separately maintained packages* [...]
https://groups.google.com/g/sage-devel/c/H8FcZD90O0Y/m/VRIRzj1sBAAJ) [...]
suggested that "*linking to
I've opened https://github.com/sagemath/sage/pull/38039 (needs review) to
add a check for this in the configure phase.
On Monday, May 20, 2024 at 11:28:14 AM UTC-7 Matthias Koeppe wrote:
> The files that have "slash in the contents" are actually symbolic links.
>
> On WSL, it is important to
This was merged in 10.4.beta6, so the "CI Fix" label can now be used.
On Monday, May 6, 2024 at 11:54:51 AM UTC-7 Matthias Koeppe wrote:
> I have implemented this change in
> https://github.com/sagemath/sage/pull/37950, needs review.
>
> On Wednesday, March 20, 2024 at 10:18:53 AM UTC-7 David
The files that have "slash in the contents" are actually symbolic links.
On WSL, it is important to use Linux git (not some other git that may be on
your system) with the exact options as instructed
in
https://github.com/sagemath/sage/blob/develop/README.md#instructions-to-build-from-source
Hi,
I'm attempting to build SageMath from source. I run Windows 10 WSL/Ubuntu
20.04 and Python 3.10.8. I followed all of the instructions in the "Getting
Started" manual, including changing the PATH variable to what was
specified. What ends up happening in my installation when I run "make" is
Thank you for all the advice. I guess for the concurrent one, I probably would
go with the pip approach.
For Sage specific functions, we use tree decomposition and nice tree
decomposition, and all other graph functions.
Jing
2024年5月20日 +0200 16:57 Dima Pasechnik ，写道：
> On Mon, May 20, 2024 at
On Mon, May 20, 2024 at 3:43 AM Matthias Koeppe
wrote:
>
> 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
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
