#### Filter Results:

- Full text PDF available (9)

#### Publication Year

1997

2016

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Jonathan M. Borwein, David M. Bradley, David John Broadhurst
- Electr. J. Comb.
- 1997

Euler sums (also called Zagier sums) occur within the context of knot theory and quantum eld theory. There are various conjectures related to these sums whose incompletion is a sign that both theâ€¦ (More)

- David John Broadhurst, D. Kreimer
- J. Symb. Comput.
- 1999

It was recently shown that the renormalization of quantum field theory is organized by the Hopf algebra of decorated rooted trees, whose coproduct identifies the divergences requiring subtraction andâ€¦ (More)

- David H. Bailey, David John Broadhurst
- Math. Comput.
- 2001

Let {x1, x2, Â· Â· Â· , xn} be a vector of real numbers. An integer relation algorithm is a computational scheme to find the n integers ak , if they exist, such that a1x1 + a2x2 + Â· Â· Â·+ anxn = 0. Inâ€¦ (More)

- Jonathan M. Borwein, David John Broadhurst, Joel Kamnitzer
- Experimental Mathematics
- 2001

We find and prove relationships between Riemann zeta values and central binomial sums. We also investigate alternating binomial sums (also called ApÃ©ry sums). The study of non-alternating sums leadsâ€¦ (More)

- Jonathan M. Borwein, David M. Bradley, David John Broadhurst, Petr Lisonek
- Electr. J. Comb.
- 1998

Multiple zeta values (MZVs, also called Euler sums or multiple harmonic series) are nested generalizations of the classical Riemann zeta function evaluated at integer values. The fact that anâ€¦ (More)

Cohen, Lewin and Zagier found four ladders that entail the polylogarithms Lin(Î± âˆ’k 1 ) := âˆ‘ r>0 Î± âˆ’kr 1 /r n at order n = 16, with indices k â‰¤ 360, and Î±1 being the smallest known Salem number, i.e.â€¦ (More)

- David H. Bailey, David John Broadhurst, Yozo Hida, Xiaoye S. Li, Brandon L Thompson
- ACM/IEEE SC 2002 Conference (SC'02)
- 2002

In this paper we describe some novel applications of high performance computing in a discipline now known as "experimental mathematics." The paper reviews some recent published work, and thenâ€¦ (More)

Let {x1, x2, Â· Â· Â· , xn} be a vector of real numbers. An integer relation algorithm is a computational scheme to find the n integers ak , if they exist, such that a1x1 + a2x2 + Â· Â· Â·+ anxn = 0. Inâ€¦ (More)

Cohen, Lewin and Zagier found four ladders that entail the polylogarithms Lin( k 1 ) := P r>0 kr 1 =r n at order n = 16, with indices k 360, and 1 being the smallest known Salem number, i.e. theâ€¦ (More)

Let {x1, x2, Â· Â· Â· , xn} be a vector of real numbers. An integer relation algorithm is a computational scheme to find the n integers ak , if they exist, such that a1x1 + a2x2 + Â· Â· Â·+ anxn = 0. Inâ€¦ (More)

- â€¹
- 1
- â€º