Re: [sage-devel] Resolution of singularities

2019-08-24 Thread Dan Abramovich
Jayson - I see your point regarding Sage schemes. The implementation in SINGULAR is what's known as embedded resolution, which returns a scheme (the ambient variety) and a subscheme (the resolved subvariety). I gather in SINGULAR as it stands the scheme must be presented explicitly as a bun

[sage-devel] Re: slowness in copy of integer sparse matrices

2019-08-24 Thread Nils Bruin
It seems to be spending a lot of time in cython code, so "%crun" might give the best idea. This is part of the profile obtained by running the "copy" command 20 times: 0 0.0% 1.3% 2575 98.2% __pyx_pw_4sage_6matrix_21matrix_integer_sparse_21Matrix_integer_sparse_5__init__ 2

[sage-devel] slowness in copy of integer sparse matrices

2019-08-24 Thread Frédéric Chapoton
Hello, With sage 8.9.b7 under py3, I get sage: P = posets.TamariLattice(8) sage: H = P._hasse_diagram sage: L = H.lequal_matrix() sage: %time copy(L) CPU times: user 2.71 s, sys: 4.01 ms, total: 2.71 s Wall time: 2.71 s 1430 x 1430 sparse matrix over Integer Ring (use the '.str()' method to see