Skip to main content

All Questions

8 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
5 votes
1 answer
172 views

Isogenous elliptic curves and canonical modular polynomials

Let $\ell$ and $p$ be two primes. We are looking for a method for checking whether two supersingular elliptic curves over the finite field $F_p$, given through their $j$-invariants, are $\ell$-...
user447243's user avatar
4 votes
0 answers
189 views

How to find a CM point with the image in the elliptic curve under modular parametrization given

everyone! Let $E:y^2+y=x^3-61$ be the minimal model of the elliptic curve 243b. How can I find the CM point $\tau$ in $X_0(243)$ such that $\tau$ maps to the point $(3\sqrt[3]{3},4)$ under the modular ...
yhb's user avatar
  • 390
4 votes
0 answers
122 views

Finding short linear combinations in abelian groups

Let $M$ be a finitely generated abelian group. Assume we are given a presentation of $M$, that is \begin{equation*} M = \frac{\bigoplus_{i=1}^r \mathbf{Z}g_i}{\sum_{j=1}^s \mathbf{Z} r_j} \end{...
François Brunault's user avatar
3 votes
0 answers
203 views

Fourier expansions of newforms at width-1 cusps

Let $f_E$ be the newform attached to the Elliptic Curve $E$ with cremona label $\textbf{100a1}$ and let $\alpha = \left[\begin{matrix} 1&0 \\ 10&1 \end{matrix}\right] \in SL_2(\mathbb{Z})$. ...
Hao Chen's user avatar
  • 221
3 votes
0 answers
713 views

Tunnell's theorem

Is it possible in some way, to use Tunnells's theorem to determine how long it will take a computer, to determine whether a number n, is a possible area of a rational right triangle?
Nøhr's user avatar
  • 31
2 votes
0 answers
132 views

How to compute torsion subgroup $E[24]$ over $\overline{\mathbb{Q}}$

If I have an elliptic curve $E: y^2=x^3-15x+22$ over $\mathbb{Q}$ with CM from the imaginary quadratic field $\mathbb{Q}(\sqrt{-3})$ then how do I compute the $24$-torsion subgroup $E[24]$ over $\...
Anish Ray's user avatar
  • 309
0 votes
0 answers
61 views

Is generating semirandom blake256 hashes until packed points is on the curve, a safe algorithm to avoid the discrete log between the generated points?

I know there are more robust methods, but I wanted to know about this specific one For any distinct said randomly generated point : $P_i,P_j\in \{P_1,...,P_k\}$ it should be hard to find $s$ such that ...
user2284570's user avatar
0 votes
0 answers
319 views

Percent of rational coordinates that is a multiple of another point on the elliptic curve

Consider elliptic curves $E:= y^2=x^3+Ax+B $ (A, B are integers) which have points $P, Q$ with rational coordinates and satisfy $P=[n]Q, n>1$. Now consider the below problem: Input: Rational ...
Consider Non-Trivial Cases's user avatar