On rational definite summation
We present a partial proof of van Hoeij-Abramov conjecture about the algorithmic possibility of computation of finite sums of rational functions. The theoretical results proved in this paper provide an algorithm for computation of a large class of sums $ S(n) = \sum_{k=0}^{n-1}R(k,n)$.
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Tsarev, Sergey P |
| description | We present a partial proof of van Hoeij-Abramov conjecture about the
algorithmic possibility of computation of finite sums of rational functions.
The theoretical results proved in this paper provide an algorithm for
computation of a large class of sums $ S(n) = \sum_{k=0}^{n-1}R(k,n)$. |
| doi_str_mv | 10.48550/arxiv.cs/0407059 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_cs_0407059</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>cs_0407059</sourcerecordid><originalsourceid>FETCH-LOGICAL-a679-ada1d1da2836954bd14b16a38879a3b22fa4322cbddb9e7b7c83470f292267493</originalsourceid><addsrcrecordid>eNotjr0KgzAYALN0KLYP0KX1BdT8mmQs0j8ouLjLl0QhoLYYW9q3L1ingxuOQ2hHcMqVEDiD8ePfqQ0Z5lhioddoXw7xCJN_DNDFrmn94KcmDq--n-UGrVroQrNdGKHqfKqKa3IvL7fieE8glzoBB8QRB1SxXAtuHOGG5MCUkhqYobQFzii1xjmjG2mkVYxL3FJNaS65ZhE6_LPzYP0cfQ_jt7ahXkbZD4KcN_I</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>On rational definite summation</title><source>arXiv.org</source><creator>Tsarev, Sergey P</creator><creatorcontrib>Tsarev, Sergey P</creatorcontrib><description>We present a partial proof of van Hoeij-Abramov conjecture about the
algorithmic possibility of computation of finite sums of rational functions.
The theoretical results proved in this paper provide an algorithm for
computation of a large class of sums $ S(n) = \sum_{k=0}^{n-1}R(k,n)$.</description><identifier>DOI: 10.48550/arxiv.cs/0407059</identifier><language>eng</language><subject>Computer Science - Discrete Mathematics ; Computer Science - Symbolic Computation</subject><creationdate>2004-07</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/cs/0407059$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.cs/0407059$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Tsarev, Sergey P</creatorcontrib><title>On rational definite summation</title><description>We present a partial proof of van Hoeij-Abramov conjecture about the
algorithmic possibility of computation of finite sums of rational functions.
The theoretical results proved in this paper provide an algorithm for
computation of a large class of sums $ S(n) = \sum_{k=0}^{n-1}R(k,n)$.</description><subject>Computer Science - Discrete Mathematics</subject><subject>Computer Science - Symbolic Computation</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2004</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotjr0KgzAYALN0KLYP0KX1BdT8mmQs0j8ouLjLl0QhoLYYW9q3L1ingxuOQ2hHcMqVEDiD8ePfqQ0Z5lhioddoXw7xCJN_DNDFrmn94KcmDq--n-UGrVroQrNdGKHqfKqKa3IvL7fieE8glzoBB8QRB1SxXAtuHOGG5MCUkhqYobQFzii1xjmjG2mkVYxL3FJNaS65ZhE6_LPzYP0cfQ_jt7ahXkbZD4KcN_I</recordid><startdate>20040724</startdate><enddate>20040724</enddate><creator>Tsarev, Sergey P</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20040724</creationdate><title>On rational definite summation</title><author>Tsarev, Sergey P</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a679-ada1d1da2836954bd14b16a38879a3b22fa4322cbddb9e7b7c83470f292267493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Computer Science - Discrete Mathematics</topic><topic>Computer Science - Symbolic Computation</topic><toplevel>online_resources</toplevel><creatorcontrib>Tsarev, Sergey P</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Tsarev, Sergey P</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On rational definite summation</atitle><date>2004-07-24</date><risdate>2004</risdate><abstract>We present a partial proof of van Hoeij-Abramov conjecture about the
algorithmic possibility of computation of finite sums of rational functions.
The theoretical results proved in this paper provide an algorithm for
computation of a large class of sums $ S(n) = \sum_{k=0}^{n-1}R(k,n)$.</abstract><doi>10.48550/arxiv.cs/0407059</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.cs/0407059 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_cs_0407059 |
| source | arXiv.org |
| subjects | Computer Science - Discrete Mathematics Computer Science - Symbolic Computation |
| title | On rational definite summation |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-01T12%3A42%3A46IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=On%20rational%20definite%20summation&rft.au=Tsarev,%20Sergey%20P&rft.date=2004-07-24&rft_id=info:doi/10.48550/arxiv.cs/0407059&rft_dat=%3Carxiv_GOX%3Ecs_0407059%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |