Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1093/imrn/rnp053
- Scopus: eid_2-s2.0-80052878924
- WOS: WOS:000269205300006
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Representing sets with sums of triangular numbers
Title | Representing sets with sums of triangular numbers |
---|---|
Authors | |
Issue Date | 2009 |
Citation | International Mathematics Research Notices, 2009, v. 2009 n. 17, p. 3264-3285 How to Cite? |
Abstract | We investigate here sums of triangular numbers f (x) := ∑ i b iT xi where T n is the nth triangular number. We show that for a set of positive integers S, there is a finite subset S 0 such that f represents S if and only if f represents S 0. However, computationally determining S 0 is ineffective for many choices of S. We give an explicit and efficient algorithm to determine the set S 0 under certain generalized Riemann hypotheses, and implement the algorithm to determine S 0 when S is the set of all odd integers. © The Author 2009. Published by Oxford University Press. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/192198 |
ISSN | 2023 Impact Factor: 0.9 2023 SCImago Journal Rankings: 1.337 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Kane, B | en_US |
dc.date.accessioned | 2013-10-23T09:27:18Z | - |
dc.date.available | 2013-10-23T09:27:18Z | - |
dc.date.issued | 2009 | en_US |
dc.identifier.citation | International Mathematics Research Notices, 2009, v. 2009 n. 17, p. 3264-3285 | en_US |
dc.identifier.issn | 1073-7928 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/192198 | - |
dc.description.abstract | We investigate here sums of triangular numbers f (x) := ∑ i b iT xi where T n is the nth triangular number. We show that for a set of positive integers S, there is a finite subset S 0 such that f represents S if and only if f represents S 0. However, computationally determining S 0 is ineffective for many choices of S. We give an explicit and efficient algorithm to determine the set S 0 under certain generalized Riemann hypotheses, and implement the algorithm to determine S 0 when S is the set of all odd integers. © The Author 2009. Published by Oxford University Press. All rights reserved. | - |
dc.language | eng | en_US |
dc.relation.ispartof | International Mathematics Research Notices | en_US |
dc.title | Representing sets with sums of triangular numbers | en_US |
dc.type | Article | en_US |
dc.description.nature | postprint | - |
dc.identifier.doi | 10.1093/imrn/rnp053 | en_US |
dc.identifier.scopus | eid_2-s2.0-80052878924 | en_US |
dc.identifier.volume | 2009 | en_US |
dc.identifier.issue | 17 | en_US |
dc.identifier.spage | 3264 | en_US |
dc.identifier.epage | 3285 | en_US |
dc.identifier.isi | WOS:000269205300006 | - |
dc.identifier.issnl | 1073-7928 | - |