Vector Meson Dominance as a first step in a systematic approximation: the pion vector form factor

Pade Approximants can be used to go beyond Vector Meson Dominance in a systematic approximation. We illustrate this fact with the case of the pion vector form factor and extract values for the first two coefficients of its Taylor expansion. Pade Approximants are shown to be a useful and simple tool for incorporating high-energy information, allowing an improved determination of these Taylor coefficients.Comment: 13 pages, 7 figure

Laser anemometer measurements of trailing vortices in water

A series of measurements of trailing vortices behind lifting hydrofoils is described. These measurements were made in the Caltech Free-Surface Water Tunnel, using a laser-Doppler velocimeter to measure two components of velocity in the vortex wake. Two different model planforms were tested, and measurements were made at several free-stream velocities and angles of attack for each. Velocity profiles were measured at distances downstream of the model of from five to sixty chord lengths. These measurements are the first results of a continuing experimental programme. In § 3 of this paper, the theory of trailing vortices is discussed. The effects of ‘vortex wandering’ upon the measurements are computed, and the corrected results are seen to be in reasonable agreement with the theory

Avoidability of formulas with two variables

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ of variables if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing morphism. A pattern $p$ is said to be $k$-avoidable if there exists an infinite word over a $k$-letter alphabet that avoids $p$. We consider the patterns such that at most two variables appear at least twice, or equivalently, the formulas with at most two variables. For each such formula, we determine whether it is $2$-avoidable, and if it is $2$-avoidable, we determine whether it is avoided by exponentially many binary words

Connectedness properties of the set where the iterates of an entire function are unbounded

We investigate the connectedness properties of the set I+(f) of points where the iterates of an entire function f are unbounded. In particular, we show that I+(f) is connected whenever iterates of the minimum modulus of f tend to ∞. For a general transcendental entire function f, we show that I+(f)∪ \{\infty\} is always connected and that, if I+(f) is disconnected, then it has uncountably many components, infinitely many of which are unbounded

A Guide to Precision Calculations in Dyson's Hierarchical Scalar Field Theory

The goal of this article is to provide a practical method to calculate, in a scalar theory, accurate numerical values of the renormalized quantities which could be used to test any kind of approximate calculation. We use finite truncations of the Fourier transform of the recursion formula for Dyson's hierarchical model in the symmetric phase to perform high-precision calculations of the unsubtracted Green's functions at zero momentum in dimension 3, 4, and 5. We use the well-known correspondence between statistical mechanics and field theory in which the large cut-off limit is obtained by letting beta reach a critical value beta_c (with up to 16 significant digits in our actual calculations). We show that the round-off errors on the magnetic susceptibility grow like (beta_c -beta)^{-1} near criticality. We show that the systematic errors (finite truncations and volume) can be controlled with an exponential precision and reduced to a level lower than the numerical errors. We justify the use of the truncation for calculations of the high-temperature expansion. We calculate the dimensionless renormalized coupling constant corresponding to the 4-point function and show that when beta -> beta_c, this quantity tends to a fixed value which can be determined accurately when D=3 (hyperscaling holds), and goes to zero like (Ln(beta_c -beta))^{-1} when D=4.Comment: Uses revtex with psfig, 31 pages including 15 figure