Representing Sets with Sums of Triangular Numbers

@article{Kane2009RepresentingSW,
  title={Representing Sets with Sums of Triangular Numbers},
  author={Ben Kane},
  journal={International Mathematics Research Notices},
  year={2009},
  volume={2009},
  pages={3264-3285}
}
  • Ben Kane
  • Published 2009
  • Mathematics
  • International Mathematics Research Notices
We investigate here sums of triangular numbers f(x) := P i biTxi where Tn is the n-th triangular number. We show that for a set of positive integers S there is a finite subset S0 such that f represents S if and only if f represents S0. However, computationally determining S0 is ineffective for many choices of S. We give an explicit and efficient algorithm to determine the setS0 under certain Generalized Riemann Hypotheses, and implement the algorithm to determine S0 when S is the set of all odd… Expand
8 Citations

Tables from this paper

The triangular theorem of eight and representation by quadratic polynomials
  • 8
  • PDF
ON TWO CONJECTURES ABOUT MIXED SUMS OF SQUARES AND TRIANGULAR NUMBERS
  • 6
ON TWO CONJECTURES
  • 2
  • Highly Influenced
  • PDF
On sums of three squares
  • 1
  • PDF
Sequences and Sets 11
  • PDF

References

SHOWING 1-10 OF 40 REFERENCES
REPRESENTATIONS OF INTEGERS BY TERNARY QUADRATIC FORMS
  • 15
  • PDF
Modular Forms of Half Integer Weight
  • 3
Multiplicative Number Theory
  • 1,954
SOME RECENT RESULTS ABOUT (TERNARY) QUADRATIC FORMS
  • 23
  • Highly Influential
  • PDF
CM liftings of Supersingular Elliptic Curves
  • 10
  • PDF
...
1
2
3
4
...