2021-11-03 05:08:06 +0200 received badge ● Nice Question (source) 2021-11-02 23:35:07 +0200 asked a question is_homogeneous ignoring order is_homogeneous ignoring order It seems that for certain coefficient ring, is_homogeneous does not take into considerat 2021-09-20 19:18:04 +0200 commented question Lower-level Singular interface / turn off unneeded PARI calculations Hi! I just saw this question. Earlier this year I wrote some script that precisely does this: solving zero-dimensional i 2021-09-12 02:58:54 +0200 received badge ● Nice Question (source) 2021-08-29 21:55:51 +0200 commented question Integer arithmetic performance Thanks! I agree that profiling is very useful. Although in this case %prun sum(prod(c) for c in Combinations(range(1, 31 2021-08-29 13:24:29 +0200 edited question Integer arithmetic performance Integer arithmetic performance Hi! I think Python/Sage is really slow with integer arithmetic. I have an example below 2021-08-29 11:39:22 +0200 commented question Integer arithmetic performance Thanks! I just tried out Cython and indeed I get the performance comparable to C :) However, integers can get overflow i 2021-08-28 23:52:23 +0200 edited question Integer arithmetic performance Integer arithmetic performance Hi! I think Python/Sage is really slow with integer arithmetic. I have an example below 2021-08-28 23:35:53 +0200 asked a question Integer arithmetic performance Integer arithmetic performance Hi! I think Python/Sage is really slow with integer arithmetic. I have an example below 2021-02-22 11:17:22 +0200 received badge ● Popular Question (source) 2021-02-15 22:18:34 +0200 commented question Height of rational points My code for enumeration of points using elimination is here if anyone is interested. There is a hacked-up global height function for homogeneous coordinates. 2021-02-15 12:58:12 +0200 commented answer Height of rational points That would be great, thanks a lot! BTW the algorithm for the enumeration of points on projective varieties is not very efficient. I wrote a package in Macaulay2 using elimination, maybe I'll try to port it to Sage too. 2021-02-15 08:57:36 +0200 received badge ● Nice Question (source) 2021-02-15 02:00:12 +0200 received badge ● Editor (source) 2021-02-15 01:47:32 +0200 commented question Height of rational points Thanks for the comment! First of all, global_height gives the logarithm height, so one should consider exp(0.53...) which is actually equal to 5^(1/3). But this only computes the maximal height among the three coordinates, instead of the height as a homogeneous coordinate. The former is not a well-defined function, for example for (1:1:1)=(2:2:2) it can give both 0=ln(1) and ln(2). 2021-02-14 01:05:25 +0200 received badge ● Student (source) 2021-02-14 01:04:07 +0200 asked a question Height of rational points Hi, I'm looking at this example of enumeration of rational points from the documentation Enumeration of rational points on projective schemes. Here I'm considering the entire projective plane. from sage.schemes.projective.projective_rational_point import enum_projective_number_field u = QQ['u'].0 K = NumberField(u^3 - 5, 'v') P. = ProjectiveSpace(K, 2) enum_projective_number_field(P, bound=RR(5^(1/3)), prec=2^10)  The returned result includes several points like (v : 1/5*v^2 : 1). If I'm not mistaken, this point is of height 25^(1/3) instead of 5^(1/3): for the infinite place the first coordinate provides a 5^(1/3), and for the place 5 the second coordinate provides another 5^(1/3). Is this a bug? Edit. I reviewed the code, it seems that the problem is in the file schemes/projective/projective_space.py, the method points_of_bounded_height of class ProjectiveSpace_field. When enumerating points with bounded height over a number field, it uses the method elements_of_bounded_height: this gives not just algebraic integers but all field elements with bounded height.