Why the following doesn't work?
Session:
#Author: Georgi Guninski
K.=QQ[]
C=HyperellipticCurve(u^5+u+5^2-2);
J=C.jacobian();
print("J=",J);
P=J(1,5);
#output
J= Jacobian of Hyperelliptic Curve over Rational Field defined by y^2
On Wed, Jul 31, 2024 at 7:32 PM Nils Bruin wrote:
>
> This is now:
>
> https://github.com/sagemath/sage/pull/38459
>
You are missing the `Author` from the original report.
Which license pisses off most SageMath, Inc to
include in future testcases (if any)?
--
You received this message because
Hi SageMath Inc developers,
First there is an open problem on mathoverflow at [1]:
Conjectured Somos-like closed form of recurrences with polynomial coefficients
I would like a proof if possible.
The answer of Max Alekseyev there links to code using Groebner basis
over QQ.
If I modify the attac
On Sun, Aug 4, 2024 at 9:03 PM Matthias Koeppe wrote:
>
> In https://github.com/sagemath/sage/pull/38219 (needs review), I propose the
> following mild policy change:
> - as a third option, a "standard" package is allowed to be a Python package
> that can be installed from platform-dependent (b
On Wed, Aug 7, 2024 at 4:17 AM Bagas Sanjaya wrote:
>
>
> In Windows, that's quite common for people to have antivirus installed.
> But for people on Linux, they usually don't install one.
>
On GNU/Linux malware is open source :)
> Find attached .tar.gz, do `configure ; make`
or
> git clone chix_
On Wed, Aug 7, 2024 at 5:54 AM Michael Orlitzky wrote:
>
> On Linux, people aren't usually dumb enough to download exes from
> strangers. Yet here we are.
>
Some people didn't realize mine was sarcasm.
As for dumb people running exe's, some of the notable windoze malware
is zero interaction, res
On what distro is the problem?
Since a few days, I suffer from random freezes on Fedora 39 and Fedora 40.
They are usually triggered by heavy load.
>From friends I hear other people have Fedora freezes too.
--
You received this message because you are subscribed to the Google Groups
"sage-devel"
On Sun, Aug 11, 2024 at 2:45 PM Hakan Granath wrote:
>
> # We could also have a vertical line with two interior points
> if x1 == x2:
> return [M.get_point(x1), M.get_point(infinity)]
>
> Maybe the if statement should instead be something like
>
> if abs(x1 - x2) < EPSILON:
>
> A4 modifying a comment by someone else (including modifying the PR
> description)
This abuse of moderation sucks much.
Is it legal a mod loser to modify my writing?
https://en.wikipedia.org/wiki/First_they_came_...
First they came for the socialists, and I did not speak out—
Becau
I think it it clear that sage doesn't have community.
Unfortunately this scales to the real world community.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-d
On Tue, Aug 27, 2024 at 3:37 PM Kwankyu Lee wrote:
>
> sage: RR(-1)^(1/3)
> 0.500 + 0.866025403784439*I
I think it is of doubtful correctness RR not being closed under coercion:
sage: RR(RR(-1)^(1/3))
TypeError: unable to convert '0.500+0.866025403784439*I'
to a real numbe
All of the following return the complex branch:
pari/gp, mpmath, maxima
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To
In short:
```
for A2 in range(1, 10**5):
E=EllipticCurve([A2,0])
rn=E.root_number()
```
leaks nearly 128MB of memory on sage 10.4
The same code in pari passes with very little memory.
This is related to the following problem in algebraic geometry [1]
Let $k,k_1,k_2$ be squarefree pairwise
I observe that the following does not leak:
E=EllipticCurve([5*13,0]) #no leak
rn=E.root_number()
The size of the leak is suspiciously close to a power of two.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and st
> How do you know that doesn't leak? Do you mean that repeated execution of
> those commands in the same session does not swell memory use?
I am computing the root number in a loop, collect garbage and measure
the used memory using `Process.memory_info().rss`
> It may even be the case that 128
On Fri, Aug 30, 2024 at 11:43 AM Dima Pasechnik wrote:
>
> If the loop over elliptic curves is shorter (or longer), do you still
> have the same leak size?
>
For a start, I have been killing sage bugs since 2012 [1]:
and have debugged some of them.
I think I deserve to be listed as sage contribut
>As well, with cypari, a call to pari.getheap() adds 1 object there, a
bug, I guess.
>(this does not happen with cypari2)
>In [14]: pari.getheap()
>Out[14]: [334, 163655741]
>In [15]: pari.getheap()
>Out[15]: [335, 163655758]
I can't reproduce this on 10.4:
sage: s=pari.getheap()
sage: fo
Is it known why the following doesn't leak?
sage: def test3(N,A=2**70):
: e=EllipticCurve([A,0])
: m=e.root_number()
:
sage: test3(10^4)
sage: pari.getheap()
[4, 149]
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscr
sage: def test3(N,A=2**70):
: for a in range(1,N):
: e=EllipticCurve([A,0])
: m=e.root_number()
:
sage: test3(10^4)
sage: pari.getheap()
[7, 289]
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe fr
I observe that a lot of users quote **everything** when replying.
In plaintext the email looks like:
TOP POST
>X_1 wrote
>>X_2 wrote
>>>X_3 wrote
>>
>>>X_n wrote
This wastes space and I believe is considered bad email etiquette.
In some desktop GUI mail user agents or web Gmail
Probably this shares the same bug as [1]
Calling `NumberField().class_group().order()` in a loop of size N:
#10^3 leaks: 40.03 MB 40026112 pari= [7950, 1451665]
#10^4 leaks: 338.49 MB 338493440 pari= [83505, 19297360]
The leak appears to be in the pari heap.
Code .sage:
#Author Georgi
On Wed, Sep 4, 2024 at 11:13 PM Marc Culler wrote:
>
> I think that here you are seeing caching taking place, rather than a memory
> leak. This is what I tried:
>
>
You call this caching, I call it leak, it can be both ways.
It is natural to compute the class numbers of QQ[sqrt(-n)] and
it shoul
This is not complaint, it is an observation about bug of type memory leak.
To leak about one GB, run the testcase `leaknf5` from the top of the
thread with argument N=3*10^4:
#3*10^4 leaks: 1084.55 MB in 1m35.208s
--
You received this message because you are subscribed to the Google Groups
"s
On Sun, Sep 8, 2024 at 6:12 PM Marc Culler wrote:
>
> I think something else is causing Sage NumberField objects to leak memory
> (i.e. to not be deallocated) in your example. The fact that both issues
> involve growth of the PARI heap does not mean that both issues have the same
> cause. The
https://www.theregister.com/2024/09/09/predator_spyware_trump_crypto/
Mon 9 Sep 2024 // 02:00 UTC
Pasting from the above:
PyPI hijack exposes 22K+ packages to takeover attacks
Security researchers monitoring open source packages have spotted
nasty folk waiting for a package to be deleted and re
> from there, https://pypi.org/project/objgraph/ . The author has linked some
> blogposts to illustrate how to use these tools to find memory links
Maybe fighting leaks should start at developer level, then QA.
Waiting to see gigabytes missing in a minute is a very crude way
to recognize leak.
-
> It's very common for computer algebra packages to have memory leaks
At least you are honest about the generalization for the whole
software development theater.
Bill Gates said: "If I had a cent every time Windows crashes,
I would have been billionaire. Oh, wait..."
--
You received this messa
sage: Kx.=QQ[]
sage: I=Ideal([x*y])
sage: gb=I.groebner_basis(algorithm='singular:stdfglm')
TypeError: Singular error:
? The ideal i has to be 0-dimensional
I believe computing the dimension of ideal requires computing groebner basis
and even if this a false, computing the dimension of ideal w
On Wed, Oct 16, 2024 at 6:45 PM Nils Bruin wrote:
>
>
> Is the above reasoning correct?
>
>
> No it is not. The error above only indicates that the algorithm found a
> contradiction to the assumption that the ideal is 0-dimensional; not that it
> computed what the dimension actually is.
>
Acco
sage: Kz.=QQ[]
sage: C=Curve([x+y+z+1,x*(x-1)*(x+1)+y*(y-1)*(y+1)])
sage: C.genus()
253 return self._genus
254 except AttributeError:
--> 255 raise NotImplementedError
NotImplementedError:
sage: C.irreducible_components()
[
Closed subscheme of Affine Space of dimension 3 over Ra
sage: set_random_seed(1)
sage: n=100;Kx=PolynomialRing(QQ,'x',n)
sage: for i in range(20):
: l=[Kx.random_element(degree=1,terms=n) for _ in range(n)]
: #print("l=",l)
: try: gb=Ideal(l).variety()
: except Exception as e: print(" exception",e)
:
skipping text
Simpler testcase:
sage: set_random_seed(1)
sage: n=100;Kx=PolynomialRing(QQ,'x',n)
sage: l=[Kx.random_element(degree=1,terms=n) for _ in range(n)]
sage: Ideal(l).dimension()
0
sage: va=Ideal(l).variety()
skipping text from `)` error at token `)`
-
I can't reproduce the pari message on 10.4, but your code leaks memory.
This might be the opposite of memory leak: use after free.
Use after free in general is considered security vulnerability.
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To u
sage: Kx.=QQ[]
sage: l=[x,x^2]
sage: ge=Sequence(l).algebraic_dependence().gens();ge
[-T1 + T0^2]
sage: Kx.=QQ[]
sage: l=[x,x^2]
sage: ge=Sequence(l).algebraic_dependence().gens();ge
AttributeError: 'Sequence_generic' object has no attribute
--
You received this message because you are subscribe
On Tue, Oct 1, 2024 at 5:59 PM Dima Pasechnik wrote:
>
> This is a usual discrepancy between the univariate and multi-variable
> case: the backends are different, and probably the functionality
> is not implemented in the univariate backend (Flint?).
> I gather it can be implemented using a result
> sage: (20 + 25)*(20 + 25)
> 2025
:)) I think sage has great potential in advanced applied numerology.
Possibly in predicting the winning numbers in the lottery too ;)
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this grou
Downloading and running code over unencrypted channels like 'http://'
is dangerous from security point of view.
The question includes building sage from source.
Searching:
$/tmp/sage-10.5$ grep -rnI 'http://' .| grep -v -w gnu | grep -v -w
sagemath | wc -l
1306
--
You received this message bec
On Mon, Feb 10, 2025 at 5:38 PM Dima Pasechnik wrote:
>
> I suppose most http: strings are in documentation.
>
I think this is not the case.
The original command skips sagemath via `grep -v -w sagemath`
On an empty tree:
$grep -E -r "http://www.sagemath|http://sagemath"; /tmp/sage-10.5/| wc -l
8
> The laptop has 3gb ram. What Linux distribution would people recommend? I
> see that Debian supports 32bit still.
I don't know the answer, but you may consider trying Debian
with some lightweight window manager like XFCE or even possibly
no X, only console.
IMHO the bottleneck is not 32bit, bu
Have you tried to run i386 installer on modern 64 bit hardware?
If the installer starts without SIGILL, then you can install it on
modern hardware. You need not install it, just check if it starts.
Searching google appears to suggest that they are backwards compatible, e.g. [1]
I have the partia
#Installing kali 32 bit linux on x86 64 bit qemu host
#kali has prebuilt qemu images, check for newer versions
$wget https://cdimage.kali.org/kali-2024.3/kali-linux-2024.3-qemu-i386.7z
#veriy checksum from the web
$sudo dnf install p7zip
$7za e kali-linux-2024.3-qemu-i386.7z
#~/vms$ ls -lth kali
Efficient probabilistic algorithm for integer factorization given
bounds for one factor
Me and Stefcho Guninski released preprint [1] Efficient probabilistic
algorithm for integer factorization given bounds for one factor.
We are interested if the algorithm can be improved and possibly compete wi
> Another VM option might be docker, which is much easier to install
I suspect docker will not solve Cremona's problem.
Docker uses the host CPU and kernel and can't run whole OS on it.
On qemu you emulate the CPU and can run arbitrary OS, possibly on
another architecture.
Might be wrong if things
> VirtualBox VMWare
I have been using qemu for more than 10 years and i am satisfied.
Advantages: works fine everywhere. doesn't require any extra kernel modules
Disadvantages: misses some shiny "features" like shared clipboard,
but it is security advantage.
--
You received this message because
> something does not work on a 32-bit machine, I thought I could resurrect the
> ancient one for that purpose -- and that purpose only!
You may try to run 32 bit guest on x86_64 host virtual machine,
probably using qemu/kvm.
I am not sure which virtual machines give good performance in your case
Partial results:
I managed to run 32 bit debian live cd in qemu virtual machine with 64 bit host.
It is very slow, but /proc/cpuinfo gives 8200 bogomips.
From
https://cdimage.debian.org/cdimage/archive/latest-oldstable-live/i386/iso-hybrid/
I downloaded:
https://cdimage.debian.org/cdimage/archive
I think this is a bug:
sage: Kt.=QQ[]
sage: J=[x*y*z-t^2,x+2*y+3*z-t-1]
sage: Ideal(J).dimension()
2
sage: C=Curve(J);C
Affine Curve over Rational Field defined by x*y*z - t^2, x + 2*y + 3*z - t - 1
sage: C.genus()
1
sage:
--
You received this message because you are subscribed to the Google Gro
Computing sums of floor() or frac() is related to non-trivial results
in number theory, e.g. `sum(n//i for i in range(1,n+1))` is
https://oeis.org/A006218
sage: var('x,y,n')
(x, y, n)
sage: ig=integrate(floor(n/x),x);ig
x*floor(n/x)
sage: n=13;a=1;b=n
sage: f=floor(n/x)
sage: i1=integrate(f,x);i1
sage: def f1(x): return sum(i for i in range(x))
sage: f1(20)
190
sage: pl1=plot(f1,2,4);pl1
verbose 0 (3965: plot.py, generate_plot_points) WARNING: When
plotting, failed to evaluate function at 200 points.
verbose 0 (3965: plot.py, generate_plot_points) Last error message:
''float' object cannot
In sage 10.4, I can prove $-1 = -oo$ and I am concerned about citing
CAS with this inconsistency.
Are there plans to try to reduce the inner inconsistencies in sage?
sage: Kx.=QQ[];f=Kx(0);f.degree()
-1
sage: gp(f).poldegree()
-oo
--
You received this message because you are subscribed to the G
Happy New smooth square year 3^4 * 5^2!
Let happiness be with you!
--
joro
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.c
Hi,
Many thanks for listing me on your developer map.
On sagemath.org I go to Download source [1] then I choose mirror [2]
On the mirror I see:
sage-10.5.tar.gztorrent1535.20 MB2024-12-04 00:28
MD5: 83dab794f87e989a30e248f3b39c40db
There are several potential issues with this:
1.
This sucks much, especially if you reuse passwords.
According [1] this was introduced "(March 12, according to Sysdig)",
so it might be good idea to check logs for suspicious stuff in this
range.
IMHO whatever microsoft buy, they ruin it.
[1] https://www.theregister.com/2025/03/17/supply_chain_att
I continue to think this is at least one bug.
There is an easy fix via change_ring():
sage: M=F.adjacency_matrix();f=M.characteristic_polynomial();f=f.change_ring(AA)
: ;ro=f.roots();sum(e for _,e in ro)
90
--
You received this message because you are subscribed to the Google Groups
"sage-
" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to sage-devel+unsubscr...@googlegroups.com.
To view this discussion visit
https://groups.google.com/d/msgid/sage-devel/CAGUWgD_dzD6Em0oO8Ky4tp%2Bqy_v%2BSRazuZTaTua5C7ovgdq
Just trying to show that real roots can be easily computed, not
relying on the bugs in roots over QQbar.
I don't see way to control the precision in the spectrum.
Who decides that small algebraic number is real, is it user's
responsibility, discarding visual non-zero?
e-60 is zero is e-58 zero or j
f(x,y)*g(x,y)=F, deg(g)=D_g,deg(f)=D_f
Author Georgi Guninski, Tue May 14 12:01:23 PM UTC 2024
Example usage:
set_random_seed(1);p1=random_prime(2**140);p2=random_prime(p1);n=p1*p2
Kxy.=Integers(n)[]
D2,D3=2,3
g2=Kxy.random_element(degree=D2);f2=Kxy
https://graphclasses.org/ ISGCI released update of their database on 2025-01-31.
Sage has some methods for downloading the database, but I couldn't
make it work from sage.
Manually downloading and unzipping the db works for me.
--
You received this message because you are subscribed to the Goog
Thanks for the plots.
Are you sure that the example with implicit_plot and plot_points=800
doesn't have patterns?
I suspect that precision issues (float?) together with small "pixel"
size incorrectly kill the pattern.
implicit_plot(lambda u, v:frac(u^2+v^2)-0.5, (13, 14), (13, 14),
plot_points=800
UWgD-Agyj155cNQX4FeivaVi_iHbAq5DV7uNo8QcodnhDtnA%40mail.gmail.com.
"""
Bug in variety of zero dimenstional ideal
Author: Georgi Guninski 2025-05-20
"""
Kx=PolynomialRing(QQ,'x',48)
Kx.inject_variables()
J=[2*x0 + 3*x1 + 5*x2 + 7*x3 + 11*x4 + 13*x5 + 17*x6 + 19
On Tue, May 20, 2025 at 2:48 PM Vincent Delecroix
<20100.delecr...@gmail.com> wrote:
>
> Works for me (archlinux system sage (version 10.6))
>
> sage: va=Ideal(J).variety()
Thanks for testing.
I think the problem if any is in Singular.
My Singular is:
Singular for x86_64-Linux version 4.4.0 (44004
sage: K.=QQ[];I=Ideal([x*(x-1),y*(y-1)])
sage: I.reduce(x+y-3) #(1)
x + y - 3
sage: I.reduce(x+y-1) #(2)
x + y - 1
In (1) there is no common solution
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receivin
On Fri, Jul 11, 2025 at 6:32 PM Dima Pasechnik wrote:
>
> I reported this on their github repo sagemath/sagecell
>
> They also have a dedicated Google Group, for which this would be a better
> place to report
>
On this testcase, both sagecell and sage 10.6 built from source on
Fedora 41 with sys
FYI the following fails on 10.6 and https://sagecell.sagemath.org/
print(giac.version())
K.=QQ[];I=Ideal([X+Y,X*Y])
I2=I.elimination_ideal(X,algorithm="giac");I2 #fails with exception
"giac 1.9.0, (c)
ModuleNotFoundError: No module named 'sagemath_giac'
--
You received this message because you
101 - 164 of 164 matches
Mail list logo
