The Open UniversitySkip to content
 

Open Research Online
Items Authored or Edited by David Broadhurst

Up a level
Export as [feed] Atom [feed] RSS 1.0 [feed] RSS 2.0 [Create Shortened URL] SURL
Embed as feed
Group by: Published Date | Item Type | Authors/Editors/Creators | No Grouping
Jump to: 2010 | 2008 | 2004 | 2001
Number of items: 8.

2010

Blümlein, J.; Broadhurst, D. J. and Vermaseren, J. A. M. (2010). The multiple zeta value data mine. Computer Physics Communications, 181(3) pp. 582–625. file

Broadhurst, David J. and Davydychev, Andrei I. (2010). Exponential suppression with four legs and an infinity of loops. Nuclear Physics B - Proceedings Supplements, 205-206, pp. 326–330.

Bailey, David H.; Borwein, Jonathan M.; Broadhurst, David and Zudilin, Wadim (2010). Experimental mathematics and mathematical physics. In: Amdeberhan, Tewodros; Medina, Luis A. and Moll, Victor H. eds. Gems in Experimental Mathematics. Contemporary Mathematics, 517. Providence, RI, USA: American Mathematical Society, pp. 41–58. file

2008

Bailey, D.H.; Borwein, J.M.; Broadhurst, D. and Glasser, M.I. (2008). Elliptic integral evaluations of Bessel moments and applications. Journal of Physics A: Mathematical and Theoretical, 41 file

2004

Broadhurst, D. J.; Kataev, A. L. and Maxwell, C. J. (2004). Comparison of the Gottfried and Adler sum rules within the large-N_c expansion. Physics Letters B, 590(1-2) pp. 76–85.

2001

Borwein, Jonathan M.; Bradey, David M.; Broadhurst, David J. and Lisonek, Petr (2001). Special values of multiple polylogarithms. Transactions of the American Mathematical Society, 353(3) pp. 907–941. file

Borwein, Jonathan Michael; Broadhurst, David J. and Kamnitzer, Joel (2001). Central binomial sums, multiple Clausen values, and zeta valuse. Experimental Mathematics, 10(1) pp. 25–34.

Bailey, David H. and Broadhurst, David J. (2001). Parallel integer relation detection: techniques and applications. Mathematics of Computation, 70(236) pp. 1719–1736. file

This list was generated on Sat May 26 23:05:08 2018 BST.

Policies | Disclaimer

© The Open University   contact the OU