Vertex-reinforced jump processes on trees and finite graphs

We study the continuous time process on the vertices of the b-ary tree which jumps to each nearest neighbor vertex at the rate of the time already spent at that vertex times , plus 1, where is a positive constant. We show that for fixed b>1, if is large enough the process is transient, and if is close enough to zero it is recurrent. Related results for some other graphs and trees are also proved.The research is partly supported by The Nuffield Foundation.     

The integral modulus of continuity of the Dirichlet kernel and the conjugate Dirichlet kernel

Asymptotic estimates for the integral modulus of continuity of order s of the Dirichlet kernel and the conjugate Dirichlet kernel are obtained. For example, if k/2, then _s (D _k ,)=2 ^s +1/²sin ^s k/2 log(1+k/s)+O(2 ^s sin ^s k/2)holds uniformly with respect to all the parameters.Translated from Matematicheskie Zametki, Vol. 54, No. 3, pp. 98–105, September, 1993.     

Sharp Error Bounds for Asymptotic Expansions of the Distribution Functions for Scale Mixtures

Let Z be a random variable with the distribution function G(x) and let s be a positive random variable independent of Z. The distribution function F(x) of the scale mixture X = sZ is expanded around G(x) and the difference between F(x) and its expansion is evaluated in terms of a quantity depending only on G and the moments of the powers of the variable of the form s/gr - 1, where (> 0) and (= ±1) are parameters indicating the types of expansion. For = -1, the bound is sharp under some extra conditions. Sharp bounds for errors of the approximations of the scale mixture of the standard normal and some gamma distributions are given either by analysis ( = -1) or by numerical computation ( = 1).     

On Piecewise-Constant Approximation of Continuous Functions of n Variables in Integral Metrics

We consider the approximation by piecewise-constant functions for classes of functions of many variables defined by moduli of continuity of the form (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ), where _i ( _i ) are ordinary moduli of continuity that depend on one variable. In the case where _i ( _i ) are convex upward, we obtain exact error estimates in the following cases: (i) in the integral metric L ₂ for (₁, ..., _n ) = ₁(₁) + ... + _n ( _n ); (ii) in the integral metric L _p (p 1) for (₁, ..., _n ) = c ₁₁ + ... + c _{n n} ; (iii) in the integral metric L _{(2, ..., 2, 2r)} (r = 2, 3, ...) for (₁, ..., _n ) = ₁(₁) + ... + _{n – 1}( _{n – 1}) + c _{n n} .     

Solution of integral equations in fractional Sobolev spaces

We consider linear integral equations and Urysohn equations with constant integration limits. Sufficient conditions are given for the solutions of these equations to be in Sobolev spacesW ₂ (0,1), 0 2. Finite-difference schemes are constructed for approximate solution of the original equation by special averaging of the right-hand side kernel. The rate of convergence of the approximate solution to the averaged exact solution is shown to beO(h|ln h|(1/2,)⁺(3/2,)).Translated from Vychislitel'naya i Prikladnaya Matematika, No. 63, pp. 3–19, 1987.     

On the Absolute Convergence of Fourier Series

The necessary and sufficient conditions of the absolute convergence of a trigonometric Fourier series are established for continuous 2-periodic functions which in [0, 2] have a finite number of intervals of convexity, and whose nth Fourier coefficients are O((l/n; f)/n), where ( f) is the continuity modulus of the function f.     

Large deviations for squares of Bessel and Ornstein-Uhlenbeck processes

Let (X_t⁽⁾,t0) be the BESQ process starting at x. We are interested in large deviations as for the family {^–1X_t⁽⁾,tT}, – or, more generally, for the family of squared radial OU process. The main properties of this family allow us to develop three different approaches: an exponential martingale method, a Cramér–type theorem, thanks to a remarkable additivity property, and a Wentzell–Freidlin method, with the help of McKean results on the controlled equation. We also derive large deviations for Bessel bridges.Mathematics Subject Classification (2000): 60F10, 60J60     

Aλδ-calculus with an algorithmicδ

In this paper we propose a system, based on-calculus, where the restriction of Church's to normal forms is dropped, while the monotony properties are weakened. The main feature of such a system is that the Church-Rosser property is maintained and all provable equalities between closed terms are semidecidable within it.     

Positive Solutions for a Singular Nonlinear Problem on a Bounded Domain in R 2

For a bounded regular Jordan domain in R ², we introduce and study a new class of functions K() related on its Green function G. We exploit the properties of this class to prove the existence and the uniqueness of a positive solution for the singular nonlinear elliptic equation u+(x,u)=0, in D(), with u=0 on and uC(), where is a nonnegative Borel measurable function in ×(0,) that belongs to a convex cone which contains, in particular, all functions (x,t)=q(x)t ^–,>0 with nonnegative functions qK(). Some estimates on the solution are also given.     

On certain indestructibility of strong cardinals and a question of Hajnal

A model in which strongness of is indestructible under ⁺ -weakly closed forcing notions satisfying the Prikry condition is constructed. This is applied to solve a question of Hajnal on the number of elements of { |2 <}.     

Flat points of two-dimensional Brownian motion

Summary SupposeZ(·) is a two-dimensional Brownian motion. It is shown that a.s. there existt ₀ and >0 such thatZ(t ₀) is an extremal point of the convex hull of {Z(t)|t ₀–tt₀} and also an extremal point of the convex hull of {Z(t)|t ₀tt₀+} and, moreover, the tangent lines to the convex hulls atZ(t ₀) form a non-zero angle.The result is related to the following unsolved problem of S.J. Taylor. Do there exist a.s.t ₀ and >0 such that the intersection of the convex hulls of {Z(t)|t ₀–tt₀} and {Z(t)|t ₀tt₀+} contains onlyZ(t ₀)?This research was partially supported by Grant-in-Aid for Scientific Research (No. 400101540202), Ministry of Education, Science and Culture     

On the complexity of following the central path of linear programs by linear extrapolation II

A class of algorithms is proposed for solving linear programming problems (withm inequality constraints) by following the central path using linear extrapolation with a special adaptive choice of steplengths. The latter is based on explicit results concerning the convergence behaviour of Newton's method to compute points on the central pathx(r), r>0, and this allows to estimate the complexity, i.e. the total numberN = N(R, ) of steps needed to go from an initial pointx(R) to a final pointx(), R>>0, by an integral of the local weighted curvature of the (primal—dual) path. Here, the central curve is parametrized with the logarithmic penalty parameterr0. It is shown that for large classes of problems the complexity integral, i.e. the number of stepsN, is not greater than constm log(R/), where < 1/2 e.g. = 1/4 or = 3/8 (note that = 1/2 gives the complexity of zero order methods). We also provide a lower bound for the complexity showing that for some problems the above estimation can hold only for 1/3.As a byproduct, many analytical and structural properties of the primal—dual central path are obtained: there are, for instance, close relations between the weighted curvature and the logarithmic derivatives of the slack variables; the dependence of these quantities on the parameterr is described. Also, related results hold for a family of weighted trajectories, into which the central path can be embedded.On leave from the Institute of Mathematics, Eötvös University Budapest, H-1080 Budapest, Hungary.     

A Statistic on Involutions

We define a statistic, called weight, on involutions and consider two applications in which this statistic arises. Let I(n) denote the set of all involutions on [n](={1,2,..., n}) and let F(2n) denote the set of all fixed point free involutions on [2n]. For an involution , let || denote the number of 2-cycles in . Let[ n] _q =1+q++q^n-1 and let denote the q-binomial coefficient. There is a statistic wt on I(n) such that the following results are true.(i) We have the expansion

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

Some applications of the nash-williams lemma to the edge-reconstruction conjecture

It is shown that a graph whose vertices have one of four possible degrees is edgereconstructible if either 8 ord 2log ₂ 68, where andd are the minimum and the average degree of a graph respectively.     

Boundedness in the mean of orthonormalized polynomials

For the polynomials {p_n(t)} ₀ , orthonormalized on [–1, 1] with weightp(t) = (1–t) (1+t) _v=1 ^m , we obtain necessary and sufficient conditions for boundedness of the sequences of norms: 1) 2) and 3) with the conditions that on [–1, 1] and (H,)^–1 L²(0, 2), where(H,) is the modulus of continuity in C(–1, 1) of function H.Translated from Matematicheskie Zametki, Vol. 13, No. 5, pp. 759–770, May, 1973.     

A priori estimates of the solution of the dirichlet problem for the Monge-ampére equation in weight spaces

One proves that a priori boundedness of the norm of the solution of the problem det(U_xx)=f(x,u,u_x)>>0,u¦=0. The magnitudes of the exponents,() depends on whether the arguments u p occur or not in f (x,u,p).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 125, pp. 74–90, 1983.     

A sum-product estimate in finite fields,and applications

Let A be a subset of a finite field for some prime q. If for some > 0, then we prove the estimate for some = () > 0. This is a finite field analogue of a result of [ErS]. We then use this estimate to prove a Szemerédi-Trotter type theorem in finite fields, and obtain a new estimate for the Erdös distance problem in finite fields, as well as the three-dimensional Kakeya problem in finite fields.     

Stability and uniqueness of the solution of the inverse kinematic problem of seismology in higher dimensions

The following inverse kinematic problem of seismology is considered. In the compact domain M of dimension ,2 with the metric, we consider the problem of constructing a new metricdu=nds according to the known formula where ,M and K_, is the geodesic in the metric du, connecting the points , . One proves uniqueness and one obtains a stability estimate, where the refraction indices n₁, n₂ are the solutions of the inverse kinematic problem, constructed relative to the functions ₁, ₂, respectively, is the differential form on M×Mwhere =₂–₁,.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akad. Nauk SSSR, Vol. 84, pp. 3–6, 1979.     

Bounds for bounded motion around a perturbed fixed point

We consider a dissipative map of the plane with a bounded perturbation term. This perturbation represents e.g. an extra time dependent term, a coupling to another system or noise. The unperturbed map has a spiral attracting fixed point. We derive an analytical/numerical method to determine the effect of the additional term on the phase portrait of the original map, as a function of the bound on the perturbation. This method yields a value _c such that for< _c the orbits about the attractor are certainly bounded. In that case we obtain a largest region in which all orbits remain bounded and a smallest region in which these bounded orbits are captured after some time (the analogue of basin and attractor respectively).The analysis is based on the Lyapunov function which exists for the unperturbed map.