Asymptotics of zeros of basic sine and cosine functions

We give an elementary calculus proof of the asymptotic formulas for the zeros of the q-sine and cosine functions which have been recently found numerically by Gosper and Suslov. Monotone convergent sequences of the lower and upper bounds for these zeros are constructed as an extension of our method. Improved asymptotics are found by a different method using the Lagrange inversion formula. Asymptotic formulas for the points of inflection of the basic sine and cosine functions are conjectured. Analytic continuation of the q-zeta function is discussed as an application. An interpretation of the zeros is given.     

Distribution of the Number of Successes in Success Runs of Length at Least <Emphasis Type="Italic">k</Emphasis> in Higher-Order Markovian Sequences

We consider the distribution of the number of successes in success runs of length at least k in a binary sequence. One important application of this statistic is in the detection of tandem repeats among DNA sequence segments. In the literature, its distribution has been computed for independent sequences and Markovian sequences of order one. We extend these results to Markovian sequences of a general order. We also show that the statistic can be represented as a function of the number of overlapping success runs of lengths k and k + 1 in the sequence, and give immediate consequences of this representation. AMS 2000 Subject Classification 60E05, 60J05     

A remark on random and equidistributed sequences

The average of the values of a function f on the points of an equidistributed sequence in [0, 1] ^s converges to the integral of f as soon as f is Riemann integrable. Some known low discrepancy sequences perform faster integration than independent random sampling (cf. [1]). We show that a small random absolutely continuous perturbation of an equidistributed sequence allows to integrate bounded Borel functions, and more generally that, if the law of the random perturbation doesn't charge polar sets, such perturbed sequences allow to integrate bounded quasi-continuous functions.     

Average growth-behavior and distribution properties of generalized weighted digit-block-counting functions

We introduce a generalized weighted digit-block-counting function on the nonnegative integers, which is a generalization of many digit-depending functions as, for example, the well known sum-of-digits function. A formula for the first moment of the sum-of-digits function has been given by Delange in 1972. In the first part of this paper we provide a compact formula for the first moment of the generalized weighted digit-block-counting function and show that a (weak) Delange type formula holds if the sequence of weights converges. The question, whether the converse is true as well, can only be answered partially at the moment. In the second part of this paper we study distribution properties of generalized weighted digit-block-counting sequences and their d-dimensional analogues. We give an if and only if condition under which such sequences are uniformly distributed modulo one.     

Long repetitive patterns in random sequences

Summary Appearances of long repetitive sequences such as 00...0 or 1010...101 in random sequences are studied. The expected length of the longest repetitive run of any specified type in a random binary sequence of length n is shown to tend to the binary logarithm of n plus a periodic function of log n. Necessary and sufficient conditions are derived to ensure that with probability 1 an infinite random sequence should contain repetitive runs of specified lengths in given initial segments. Finally, the number of long repetitive runs of a specified kind that occur in a random sequence is studied. These results are derived from simple expressions for the generating functions for the probabilities of occurrences of various repetitive runs. These generating functions are rational, and lead to sharp asymptotic estimates for the probabilities.     

On ratio block sequences with extreme distribution function

Distribution functions of ratio block sequences formed from sequences of positive integers are investigated in the paper. We characterize the case when the set of all distribution functions of a ratio block sequence contains c ₀, the greatest possible distribution function. Presented results complete some previously published results. Supported by grant MSM 6198898701, and VEGA no. 1/4006/07.     

Constructing a sequence of discrete Hessian matrices of an SC 1 function uniformly convergent to the generalized Hessian matrix

We construct a uniform approximation for generalized Hessian matrix of an SC ¹ function. Using the discrete gradient and the extended second order derivative, we define the discrete Hessian matrix. We construct a sequence of sets, where each set is composed of discrete Hessian matrices. We first show some new properties of SC ¹ functions. Then, we prove that for SC ¹ functions the sequence of the set of discrete Hessian matrices is uniformly convergent to the generalized Hessian matrix.      

Divided Differences and Linearly Recursive Sequences

We show that the theory of divided differences is a natural tool for the study of linearly recurrent sequences. The divided differences functional associated with a monic polynomial w on degree n + 1 yields a vector space isomorphism between the space of polynomials of degree at most equal to n and the space of linearly recurrent sequences f that satisfy the difference equation w(E)f=0 where E is the usual shift operator. Using such isomorphisms, we can translate problems about recurrent sequences into simple problems about polynomials. We present here a new approach to the theory of divided differences, using only generating functions and elementary linear algebra, which clarifies the connections of divided differences with rational functions, polynomial interpolation, residues, and partial fractions decompositions.     

On the relative extrema of a linear combination of elementary symmetric functions

We determine where a linear combination of elementary symmetric functions attains as maximum and minimum over a certain convex set in Rⁿ . We also show that an inequality for elementary symmetric functions proposed by S. Pierce is true.     

Normal families of covering maps

Suppose that (f _n)n∈N is a sequence of meromorphic covering maps which is uniformly convergent in a neighbourhood of a pointx∈Ĉ such that the limit function is non-constant. It is proved that the convergence extends to the largest domain where the sequence eventually is defined and that the limit function again is a covering map. As a consequence of this result, we obtain a rescaling lemma for holomorphic covering maps, a version of the Carathéodory Kernel Theorem for arbitrary domains in the sphere, and an elementary access to the Riemann Uniformization Theorem for arbitrary domains in the sphere. An application to complex dynamics of transcendental entire functions provides that the existence of an invariant Baker domain implies a certain frequency of singularities of the inverse function.     

Asymptotic properties of digit sequences of random numbers

We consider several aspects of the relationship between a [0, 1]‐valued random variable X and the random sequence of digits given by its m‐ary expansion. We present results for three cases: (a) independent and identically distributed digit sequences; (b) random variables X with smooth densities; (c) stationary digit sequences. In the case of i.i.d. an integral limit thorem is proved which applies for example to relative frequencies, yielding asymptotic moment identities. We deal with occurrence probabilities of digit groups in the case that X has an analytic Lebesgue density. In the case of stationary digits we determine the distribution of X in terms of their transition functions. We study an associated [0, 1]‐valued Markov chain, in particular its ergodicity, and give conditions for the existence of stationary digit sequences with prespecified transition functions. It is shown that all probability measures induced on [0, 1] by such sequences are purely singular except for the uniform distribution. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Equicalmness and Epiderivatives That Are Pointwise Limits

Recently, Moussaoui and Seeger (Ref. 1) studied the monotonicity of first-order and second-order difference quotients with primary goal the simplification of epilimits. It is well known that epilimits (lim inf and lim sup) can be written as pointwise limits in the case of a sequence of functions that is equi-lsc. In this paper, we introduce equicalmness as a condition that guarantees equi-lsc, and our primary goal is to give conditions that guarantee that first-order and second-order difference quotients are equicalm. We show that a piecewise-C ¹ function f with convex domain is epidifferentiable at any point of its domain. We also show that a convex piecewise C ²-function (polyhedral pieces) is twice epidifferentiable. We thus obtain a modest extension of the Rockafellar result concerning the epidifferentiability of piecewise linear-quadratic convex functions.     

Nonlinearity of davenport—Schinzel sequences and of generalized path compression schemes

Davenport—Schinzel sequences are sequences that do not contain forbidden subsequences of alternating symbols. They arise in the computation of the envelope of a set of functions. We show that the maximal length of a Davenport—Schinzel sequence composed ofn symbols is Θ (nα(n)), where α(n) is the functional inverse of Ackermann’s function, and is thus very slowly increasing to infinity. This is achieved by establishing an equivalence between such sequences and generalized path compression schemes on rooted trees, and then by analyzing these schemes. Work on this paper by the second author has been supported in part by a grant from the U.S.-Israeli Binational Science Foundation.     

On convergence of sections of sequences in Banach spaces

An elementary proof of the (known) fact that each element of the Banach spaceℓ _w ^p (X) of weakly absolutelyp-summable sequences (if 1≤p<∞) in the Banach spaceX is the norm limit of its sections if and only if each element ofℓ _w ^p (X) is a norm null sequence inX, is given. Little modification to this proof leads to a similar result for a family of Orlicz sequence spaces. Some applications to spaces of compact operators on Banach sequence spaces are considered.     

Average growth-behavior and distribution properties of generalized weighted digit-block-counting functions

We introduce a generalized weighted digit-block-counting function on the nonnegative integers, which is a generalization of many digit-depending functions as, for example, the well known sum-of-digits function. A formula for the first moment of the sum-of-digits function has been given by Delange in 1972. In the first part of this paper we provide a compact formula for the first moment of the generalized weighted digit-block-counting function and show that a (weak) Delange type formula holds if the sequence of weights converges. The question, whether the converse is true as well, can only be answered partially at the moment. In the second part of this paper we study distribution properties of generalized weighted digit-block-counting sequences and their d-dimensional analogues. We give an if and only if condition under which such sequences are uniformly distributed modulo one. Roswitha Hofer, Recipient of a DOC-FFORTE-fellowship of the Austrian Academy of Sciences at the Institute of Financial Mathematics at the University of Linz (Austria). Friedrich Pillichshammer, Supported by the Austrian Science Foundation (FWF), Project S9609, that is part of the Austrian National Research Network “Analytic Combinatorics and Probabilistic Number Theory”. Dedicated to Prof. Robert F. Tichy on the occasion of his 50th birthday Authors’ address: Roswitha Hofer, Gerhard Larcher and Friedrich Pillichshammer, Institut für Finanzmathematik, Universit?t Linz, Altenbergerstra?e 69, A-4040 Linz, Austria     

Application of pseudo‐trigonometry to Bessel series and integrals of Bessel functions

In this article, an extension of the Laplace transform of J_n (t) to pseudo‐trigonometric function is discussed. We are seeking elementary functions expressed by Bessel series. It is shown that the result is applicable to the solution of the first‐order differential equation. The expression of modified Bessel integral formulas in pseudo‐trigonometric function is also discussed.     

The elementary computable functions over the real numbers: applying two new techniques

The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether defined in different manners, via function algebras (Real Recursive Functions) or via Turing Machines (Computable Analysis). We provide general tools for investigating these issues, using two techniques we call approximation and lifting. We use these methods to obtain two main theorems. First, we provide an alternative proof of the result from Campagnolo et al. (J Complex 18:977–1000, 2002), which precisely relates the Kalmar elementary computable functions to a function algebra over the reals. Second, we build on that result to extend a result of Bournez and Hainry (Theor Comput Sci 348(2–3):130–147, 2005), which provided a function algebra for the real elementary computable functions; our result does not require the restriction to functions. In addition to the extension, we provide an alternative approach to the proof. Their proof involves simulating the operation of a Turing Machine using a function algebra. We avoid this simulation, using a technique we call lifting, which allows us to lift the classic result regarding the elementary computable functions to a result on the reals. The two new techniques bring a different perspective to these problems, and furthermore appear more easily applicable to other problems of this sort.      

Elementary equivalence of some rings of definable functions

We characterize elementary equivalences and inclusions between von Neumann regular real closed rings in terms of their boolean algebras of idempotents, and prove that their theories are always decidable. We then show that, under some hypotheses, the map sending an L-structure R to the L-structure of definable functions from R ⁿ to R preserves elementary inclusions and equivalences and gives a structure with a decidable theory whenever R is decidable. We briefly consider structures of definable functions satisfying an extra condition such as continuity.      

Commutative Sequences of Integrable Functions and Best Approximation With Respect to the Weighted Vector Measure Distance

Let λ be a countably additive vector measure with values in a separable real Hilbert space H. We define and study a pseudo metric on a Banach lattice of integrable functions related to λ that we call a λ-weighted distance. We compute the best approximation with respect to this distance to elements of the function space by the use of sequences with special geometric properties. The requirements on the sequence of functions are given in terms of a commutation relation between these functions that involves integration with respect to λ. We also compare the approximation that is obtained in this way with the corresponding projection on a particular Hilbert space.     

Strings of consecutive successes

A sequence of independent Bernoulli trials is conducted. Let Nbe the number of trials required before observing a string of m successes. Using only elementary methods of probability theory, the expected value, variance and probability generating function of N are determined as functions of m and p, the probability of success on any given trial.