2015
DOI: 10.1016/j.jat.2014.10.004
|View full text |Cite
|
Sign up to set email alerts
|

Computation and theory of Mordell–Tornheim–Witten sums II

Abstract: In [8] the current authors, along with the late and much-missed Richard Crandall , considered generalized Mordell-Tornheim-Witten (MTW) zeta-function values along with their derivatives, and explored connections with multiple-zeta values (MZVs). This entailed use of symbolic integration, high precision numerical integration, and some interesting combinatorics and special-function theory. The original motivation was to represent objects such as Eulerian log-gamma integrals; and all such integrals were expressed… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 8 publications
(3 citation statements)
references
References 23 publications
(50 reference statements)
0
3
0
Order By: Relevance
“…• Crandall [8] presents a unified version of his earlier approach for general s (and other related functions), as well as the expression for the expansions near negative integer s, but in this work does not report a complete algorithm, and also suffers from some small mistakes. • Bailey and Borwein [3,4] use and refine Crandall's work for calculating polylogarithms and their derivatives. They discuss alternative approaches in different domains, but their main interest is in related functions and although they fill in some gaps of [8], they do not present a complete algorithm either.…”
Section: The Branchmentioning
confidence: 99%
See 2 more Smart Citations
“…• Crandall [8] presents a unified version of his earlier approach for general s (and other related functions), as well as the expression for the expansions near negative integer s, but in this work does not report a complete algorithm, and also suffers from some small mistakes. • Bailey and Borwein [3,4] use and refine Crandall's work for calculating polylogarithms and their derivatives. They discuss alternative approaches in different domains, but their main interest is in related functions and although they fill in some gaps of [8], they do not present a complete algorithm either.…”
Section: The Branchmentioning
confidence: 99%
“…and gives the c k,j in [8, pp.35-36] recursively, but note that Crandall's manuscript has typographic errors; Bailey and Borwein [3,4] give the correct formula. However, for |τ | 1 we need only take a small number of terms, the first three of which can be written explicitly as 2) (n + 1) 6 .…”
Section: Alternative Seriesmentioning
confidence: 99%
See 1 more Smart Citation