Results 1  10
of
62
A Strong Hot Spot Theorem
 Proceedings of the American Mathematical Society
"... Abstract. A real number α is said to be bnormal if every mlong string of digits appears in the baseb expansion of α with limiting frequency b −m. We prove that α is bnormal if and only if it possesses no baseb “hot spot. ” In other words, α is bnormal if and only if there is no real number y su ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Abstract. A real number α is said to be bnormal if every mlong string of digits appears in the baseb expansion of α with limiting frequency b −m. We prove that α is bnormal if and only if it possesses no baseb “hot spot. ” In other words, α is bnormal if and only if there is no real number y such that smaller and smaller neighborhoods of y are visited by the successive shifts of the baseb expansion of α with larger and larger frequencies, relative to the lengths of these neighborhoods. 1.
A compendium of BBPtype formulas for mathematical constants
, 2000
"... A 1996 paper by the author, Peter Borwein and Simon Plouffe showed that any mathematical constant given by an infinite series of a certain type has the property that its nth digit in a particular number base could be calculated directly, without needing to compute any of the first n−1 digits, by me ..."
Abstract

Cited by 13 (2 self)
 Add to MetaCart
A 1996 paper by the author, Peter Borwein and Simon Plouffe showed that any mathematical constant given by an infinite series of a certain type has the property that its nth digit in a particular number base could be calculated directly, without needing to compute any of the first n−1 digits, by means of a simple algorithm that does not require multipleprecision arithmetic. Several such formulas were presented in that paper, including formulas for the constants π and log 2. Since then, numerous other formulas of this type have been found. This paper presents a compendium of currently known results of this sort, both formal and experimental. Many of these results were found in the process of compiling this collection and have not previously appeared in the literature. Several conjectures suggested by these results are mentioned.
Resolution of the QuinnRandStrogatz constant of nonlinear physics
 EXP. MATHEMATICS, TO APPEAR, HTTP://CRD.LBL.GOV/˜DHBAILEY/DHBPAPERS/QRS.PDF. COMPUTATION AND MATHEMATICAL PHYSICS DAVID H. BAILEY
, 2007
"... Herein we develop connections between zeta functions and some recent “mysterious” constants of nonlinear physics. In an important analysis of coupled Winfree oscillators, Quinn, Rand, and Strogatz [14] developed a certain Noscillator scenario whose bifurcation phase offset φ is implicitly defined, ..."
Abstract

Cited by 10 (7 self)
 Add to MetaCart
Herein we develop connections between zeta functions and some recent “mysterious” constants of nonlinear physics. In an important analysis of coupled Winfree oscillators, Quinn, Rand, and Strogatz [14] developed a certain Noscillator scenario whose bifurcation phase offset φ is implicitly defined, with a conjectured asymptotic behavior: sin φ ∼ 1 − c1/N, with experimental estimate c1 = 0.605443657.... We are able to derive the exact theoretical value of this “QRS constant ” c1 as a real zero of a particular Hurwitz zeta function. This discovery enables, for example, the rapid resolution of c1 to extreme precision. Results and conjectures are provided in regard to higherorder terms of the sin φ asymptotic, and to yet more physics constants emerging from the original QRS work.
Elliptic integral evaluations of Bessel moments and applications
, 2008
"... We record and substantially extend what is known about the closed forms for various Bessel function moments arising in quantum field theory, condensed matter theory and other parts of mathematical physics. In particular, we develop formulae for integrals of products of six or fewer Bessel functions. ..."
Abstract

Cited by 8 (6 self)
 Add to MetaCart
We record and substantially extend what is known about the closed forms for various Bessel function moments arising in quantum field theory, condensed matter theory and other parts of mathematical physics. In particular, we develop formulae for integrals of products of six or fewer Bessel functions. In consequence, we are able to discover and prove closed forms for cn,k: = � ∞ (t)dt with integers n = 1,2,3,4 and k ≥ 0, 0 tkKn 0 obtaining new results for the even moments c3,2k and c4,2k. We also derive new closed forms for the odd moments sn,2k+1: = � ∞ 0 t2k+1I0 (t)K n−1 0 (t)dt with n = 3,4 and for tn,2k+1: = � ∞ 0 t2k+1I2 0 (t)Kn−2 0 (t)dt with n = 5, relating the latter to Green functions on hexagonal, diamond and cubic lattices. We conjecture the values of s5,2k+1, make substantial progress on the evaluation of c5,2k+1, s6,2k+1 and t6,2k+1 and report more limited progress regarding c5,2k, c6,2k+1 and c6,2k. In the process, we obtain 8 conjectural evaluations, each of which has been checked to 1200 decimal places. One of these lies deep in 4dimensional quantum field theory and two are probably provable by delicate combinatorics. There remains a hard core of five conjectures whose proofs would be most instructive, to mathematicians and physicists alike.
HighPrecision Computation and Mathematical Physics
"... At the present time, IEEE 64bit floatingpoint arithmetic is sufficiently accurate for most scientific applications. However, for a rapidly growing body of important scientific computing applications, a higher level of numeric precision is required. Such calculations are facilitated by highpreci ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
At the present time, IEEE 64bit floatingpoint arithmetic is sufficiently accurate for most scientific applications. However, for a rapidly growing body of important scientific computing applications, a higher level of numeric precision is required. Such calculations are facilitated by highprecision software packages that include highlevel language translation modules to minimize the conversion effort. This paper presents a survey of recent applications of these techniques and provides some analysis of their numerical requirements. These applications include supernova simulations, climate modeling, planetary orbit calculations, Coulomb nbody atomic systems, scattering amplitudes of quarks, gluons and bosons, nonlinear oscillator theory, Ising theory, quantum field theory and experimental mathematics. We conclude that highprecision arithmetic facilities are now an indispensable component of a modern largescale scientific computing environment.
Mathematical proofs at a crossroad
 Theory Is Forever, Lectures Notes in Comput. Sci. 3113
, 2004
"... Abstract. For more than 2000 years, from Pythagoras and Euclid to Hilbert and Bourbaki, mathematical proofs were essentially based on axiomaticdeductive reasoning. In the last decades, the increasing length and complexity of many mathematical proofs led to the expansion of some empirical, experimen ..."
Abstract

Cited by 7 (7 self)
 Add to MetaCart
Abstract. For more than 2000 years, from Pythagoras and Euclid to Hilbert and Bourbaki, mathematical proofs were essentially based on axiomaticdeductive reasoning. In the last decades, the increasing length and complexity of many mathematical proofs led to the expansion of some empirical, experimental, psychological and social aspects, yesterday only marginal, but now changing radically the very essence of proof. In this paper, we try to organize this evolution, to distinguish its different steps and aspects, and to evaluate its advantages and shortcomings. Axiomaticdeductive proofs are not a posteriori work, a luxury we can marginalize nor are computerassisted proofs bad mathematics. There is hope for integration! 1
Normal Numbers and Pseudorandom Generators
, 2011
"... For an integer b ≥ 2 a real number α is bnormal if, for all m> 0, every mlong string of digits in the baseb expansion of α appears, in the limit, with frequency b −m. Although almost all reals in [0, 1] are bnormal for every b, it has been rather difficult to exhibit explicit examples. No result ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
For an integer b ≥ 2 a real number α is bnormal if, for all m> 0, every mlong string of digits in the baseb expansion of α appears, in the limit, with frequency b −m. Although almost all reals in [0, 1] are bnormal for every b, it has been rather difficult to exhibit explicit examples. No results whatsoever are known, one way or the other, for the class of “natural ” mathematical constants, such as π, e, √ 2 and log 2. In this paper, we summarize some previous normality results for a certain class of explicit reals, and then show that a specific member of this class, while provably 2normal, is provably not 6normal. We then show that a practical and reasonably effective pseudorandom number generator can be defined based on the binary digits of this constant, and conclude by sketching out some directions for further research.
Optimal transmission range for topology management in wireless sensor networks
 In Information Networking, Advances in Data Communications and Wireless Networks, Proceedings of the International Conference on Information Networking (ICOIN) 2006
"... Abstract. Topology management protocols aim to minimize the number of nodes in densely distributed sensor networks that constitute the topology. Most protocols construct the topology with a fixed transmission range (i.e. maximum transmission power). However, in data transmission, it is more efficien ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Abstract. Topology management protocols aim to minimize the number of nodes in densely distributed sensor networks that constitute the topology. Most protocols construct the topology with a fixed transmission range (i.e. maximum transmission power). However, in data transmission, it is more efficient to communicate with shorter transmission range, even with increased number of nodes in the topology. Therefore, it is necessary to find an optimal transmission range to minimize the total power consumed by the topology management as well as data transmissions. Moreover, data rate is also an important factor to determine the total transmission energy. In this paper, we obtain the optimal transmission range for a given data rate and maximum transmission power, which minimizes the total power consumption. 1
On the Numerical Evaluation of Distributions in Random Matrix Theory: A Review
, 2010
"... Abstract. In this paper we review and compare the numerical evaluation of those probability distributions in random matrix theory that are analytically represented in terms of Painlevé transcendents or Fredholm determinants. Concrete examples for the Gaussian and Laguerre (Wishart) βensembles and t ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. In this paper we review and compare the numerical evaluation of those probability distributions in random matrix theory that are analytically represented in terms of Painlevé transcendents or Fredholm determinants. Concrete examples for the Gaussian and Laguerre (Wishart) βensembles and their various scaling limits are discussed. We argue that the numerical approximation of Fredholm determinants is the conceptually more simple and efficient of the two approaches, easily generalized to the computation of joint probabilities and correlations. Having the means for extensive numerical explorations at hand, we discovered new and surprising determinantal formulae for the kth largest (or smallest) level in the edge scaling limits of the Orthogonal and Symplectic Ensembles; formulae that in turn led to improved numerical evaluations. The paper comes with a toolbox of Matlab functions that facilitates further mathematical experiments by the reader.
The SIAM 100digit challenge, a study in highaccuracy numerical computing. http://wwwm3.ma.tum.de/m3old/ bornemann/challengebook/index.html
, 2004
"... Digit Challenge ” [6]. In this note he presented ten easytostate but hardtosolve problems of numerical analysis, and challenged readers to find each answer to tendigit accuracy: � 1 1. What is limɛ→0 ɛ x−1 cos(x−1 log x) dx? 2. A photon moving at speed 1 in the xy plane starts at t = 0 at (x, ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
Digit Challenge ” [6]. In this note he presented ten easytostate but hardtosolve problems of numerical analysis, and challenged readers to find each answer to tendigit accuracy: � 1 1. What is limɛ→0 ɛ x−1 cos(x−1 log x) dx? 2. A photon moving at speed 1 in the xy plane starts at t = 0 at (x, y) = (1/2, 1/10) heading due east. Around every integer lattice point (i, j) in the plane, a circular mirror of radius 1/3 has been erected. How far from the origin is the photon at t = 10? 3. The infinite matrix A with entries a11 = 1, a12 = 1/2, a21 = 1/3, a13 = 1/4, a22 = 1/5, a31 = 1/6, etc., is a bounded operator on ℓ 2. What is A? 4. What is the global minimum of the function exp(sin(50x))+sin(60e y)+sin(70 sin x)+ sin(sin(80y)) − sin(10(x + y)) + (x 2 + y 2)/4? 5. Let f(z) = 1/Γ(z), where Γ(z) is the gamma function, and let p(z) be the cubic polynomial that best approximates f(z) on the unit disk in the supremum norm   · ∞. What is f − p∞? 6. A flea starts at (0, 0) on the infinite 2D integer lattice and executes a biased random walk: At each step it hops north or south with probability 1/4, east with probability 1/4 + ɛ, and west with probability 1/4 − ɛ. The probability that the flea returns to (0, 0) sometime during its wanderings is 1/2. What is ɛ? 7. Let A be the 20000 × 20000 matrix whose entries are zero everywhere except for the primes 2, 3, 5, 7, · · · , 224737 along the main diagonal and the number 1 in all the positions aij with i − j  = 1, 2, 4, 8, · · · , 16384. What is the (1, 1) entry of A −1.