Search

There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these representations yield the same class of real numbers. If we work with some restricted notion of computability, e.g., polynomial time computability or primitive recursiveness, they do not. Irrational numbers can be represented by infinite sums of certain forms. We prove some results related to representation of irrational numbers by infinite sums.

The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable real functions with respect to the same class of operators is a proper extension of the class of uniformly computable real functions and it computes the elementary functions of calculus on their whole domains. The definition of both classes relies on certain transformations of infinitistic names of real numbers. In the present paper, the conditional computability of real functions is characterized in the spirit of Tent and Ziegler, avoiding the use of infinitistic names.

For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect to this class. These two computability notions are natural generalizations of certain notions introduced in a previous paper co-authored by Andreas Weiermann and in another previous paper by the same authors, respectively. Under certain weak assumptions about the class in question, we show that conditional computability is preserved by substitution, that all conditionally computable real functions are locally uniformly computable, and that the ones with compact domains are uniformly computable. The introduced notions have some similarity with the uniform computability and its non-uniform extension considered by Katrin Tent and Martin Ziegler, however, there are also essential differences between the conditional computability and the non-uniform computability in question., Comment: Manuscript accepted for publication in the CiE 2011 post-proceedings, which will appear in Annals of Pure and Applied Logic

We study preconditioning techniques for discontinuous Galerkin discretizations of isotropic linear elasticity problems in primal (displacement) formulation. We propose subspace correction methods based on a splitting of the vector valued piecewise linear discontinuous finite element space, that are optimal with respect to the mesh size and the Lame parameters. The pure displacement, the mixed and the traction free problems are discussed in detail. We present a convergence analysis of the proposed preconditioners and include numerical examples that validate the theory and assess the performance of the preconditioners., Comment: 23 pages and 2 figures

We consider a broad class of stochastic lattice predator-prey models, whose main features are overviewed. In particular, this article aims at drawing a picture of the influence of spatial fluctuations, which are not accounted for by the deterministic rate equations, on the properties of the stochastic models. Here, we outline the robust scenario obeyed by most of the lattice predator-prey models with an interaction "a' la Lotka-Volterra". We also show how a drastically different behavior can emerge as the result of a subtle interplay between long-range interactions and a nearest-neighbor exchange process., Comment: 5 pages, 2 figures. Proceedings paper of the workshop "Stochastic models in biological sciences" (May 29 - June 2, 2006 in Warsaw) for the Banach Center Publications

We study the general properties of stochastic two-species models for predator-prey competition and coexistence with Lotka-Volterra type interactions defined on a $d$-dimensional lattice. Introducing spatial degrees of freedom and allowing for stochastic fluctuations generically invalidates the classical, deterministic mean-field picture. Already within mean-field theory, however, spatial constraints, modeling locally limited resources, lead to the emergence of a continuous active-to-absorbing state phase transition. Field-theoretic arguments, supported by Monte Carlo simulation results, indicate that this transition, which represents an extinction threshold for the predator population, is governed by the directed percolation universality class. In the active state, where predators and prey coexist, the classical center singularities with associated population cycles are replaced by either nodes or foci. In the vicinity of the stable nodes, the system is characterized by essentially stationary localized clusters of predators in a sea of prey. Near the stable foci, however, the stochastic lattice Lotka-Volterra system displays complex, correlated spatio-temporal patterns of competing activity fronts. Correspondingly, the population densities in our numerical simulations turn out to oscillate irregularly in time, with amplitudes that tend to zero in the thermodynamic limit. Yet in finite systems these oscillatory fluctuations are quite persistent, and their features are determined by the intrinsic interaction rates rather than the initial conditions. We emphasize the robustness of this scenario with respect to various model perturbations., Comment: 19 pages, 11 figures, 2-column revtex4 format. Minor modifications. Accepted in the Journal of Statistical Physics. Movies corresponding to Figures 2 and 3 are available at http://www.phys.vt.edu/~tauber/PredatorPrey/movies/

Including spatial structure and stochastic noise invalidates the classical Lotka-Volterra picture of stable regular population cycles emerging in models for predator-prey interactions. Growth-limiting terms for the prey induce a continuous extinction threshold for the predator population whose critical properties are in the directed percolation universality class. Here, we discuss the robustness of this scenario by considering an ecologically inspired stochastic lattice predator-prey model variant where the predation process includes next-nearest-neighbor interactions. We find that the corresponding stochastic model reproduces the above scenario in dimensions 1< d \leq 4, in contrast with mean-field theory which predicts a first-order phase transition. However, the mean-field features are recovered upon allowing for nearest-neighbor particle exchange processes, provided these are sufficiently fast., Comment: 5 pages, 4 figures, 2-column revtex4 format. Emphasis on the lattice predator-prey model with next-nearest-neighbor interaction (Rapid Communication in PRE)

We present precision Monte Carlo data and analytic arguments for an asymmetric exclusion process, involving two species of particles driven in opposite directions on a $2 \times L$ lattice. We propose a scenario which resolves a stark discrepancy between earlier simulation data, suggesting the existence of an ordered phase, and an analytic conjecture according to which the system should revert to a disordered state in the thermodynamic limit. By analyzing the finite size effects in detail, we argue that the presence of a single, seemingly macroscopic, cluster is an intermediate stage of a complex nucleation process: In smaller systems, this cluster is destabilized while larger systems allow the formation of multiple clusters. Both limits lead to exponential cluster size distributions which are, however, controlled by very different length scales., Comment: 5 pages, 3 figures, one column

We consider the dynamics of the voter model and of the monomer-monomer catalytic process in the presence of many ``competing'' inhomogeneities and show, through exact calculations and numerical simulations, that their presence results in a nontrivial fluctuating steady state whose properties are studied and turn out to specifically depend on the dimensionality of the system, the strength of the inhomogeneities and their separating distances. In fact, in arbitrary dimensions, we obtain an exact (yet formal) expression of the order parameters (magnetization and concentration of adsorbed particles) in the presence of an arbitrary number $n$ of inhomogeneities (``zealots'' in the voter language) and formal similarities with {\it suitable electrostatic systems} are pointed out. In the nontrivial cases $n=1, 2$, we explicitly compute the static and long-time properties of the order parameters and therefore capture the generic features of the systems. When $n>2$, the problems are studied through numerical simulations. In one spatial dimension, we also compute the expressions of the stationary order parameters in the completely disordered case, where $n$ is arbitrary large. Particular attention is paid to the spatial dependence of the stationary order parameters and formal connections with electrostatics., Comment: 17 pages, 6 figures, revtex4 2-column format. Original title ("Are Voting and Catalytic Processes Electrostatic Problems ?") changed upon editorial request. Minor typos corrected. Published in Physical Review E

This paper introduces a position-space renormalization-group approach for nonequilibrium systems and applies the method to a driven stochastic one-dimensional gas with open boundaries. The dynamics are characterized by three parameters: the probability $\alpha$ that a particle will flow into the chain to the leftmost site, the probability $\beta$ that a particle will flow out from the rightmost site, and the probability $p$ that a particle will jump to the right if the site to the right is empty. The renormalization-group procedure is conducted within the space of these transition probabilities, which are relevant to the system's dynamics. The method yields a critical point at $\alpha_c=\beta_c=1/2$,in agreement with the exact values, and the critical exponent $\nu=2.71$, as compared with the exact value $\nu=2.00$., Comment: 14 pages, 4 figures