Consider an elliptic curve defined over the
rational numbers and embedded in projective space.
The rational points on the curve are viewed as integer vectors with
coprime coordinates.
What can be said about the rational points for which the number of
prime factors dividing a fixed coordinate does not exceed a fixed bound?
If the bound is zero, then
Siegel's theorem guarantees that there are only finitely many such points.
We consider, theoretically and computationally, two conjectures: one is a generalization
of Siegel's theorem, and the other is a refinement that
resonates with Hall's conjecture.