α-Sober spaces via the orthogonal closure operator

Each ordinal equipped with the upper topology is a T ₀-space. It is well known that for =2 the reflective hull of in Top₀ is the subcategory of sober spaces. Here, we define -sober space for each 2 in such a way that the reflective hull of in Top₀ is the subcategory of -sober spaces. Moreover, we obtain an order-preserving bijective correspondence between a proper class of ordinals and the corresponding (epi)reflective hulls. Our main tool is the concept of orthogonal closure operator, first introduced in [12].The author acknowledges financial support from Instituto Politécnico de Viseu and from Centro de Matemática da Universidade de Coimbra.     

Black holes on the plane drawn by a Wiener process

Summary We say that the discD()R ², of radius , located around the origin isp-covered in timeT by a Wiener processW(·) if for anyzD() there exists a 0tT such thatW(t) is a point of the disc of radiusp, located aroundz. The supremum of those 's (0) is studied for which,D() isp-covered inT.     

Numerical application of Euler's series transformation and its generalizations

Summary A nonlinear generalizationÊ _z of Euler's series transformation is compared with the (linear) Euler-Knopp transformationE _z and a twoparametric methodE . It is shown how to applyE orE _, to compute the valuef(z_o) of a functionf from the power series at 0 iff is holomorphic in a half plane or in the cut plane. BothE andE _, are superior toÊ _z . A compact recursive algorithm is given for computingE andE _,.     

A remark on fixed points of functors in topological categories

For a topological category over Set we prove that if a functor T: has a fixed cardinal (i.e. for each object K with card (UK)= we have card (UTK)), then T has a least fixed point, and if T has a successive pair of fixed cardinals and ⁺, then T has a greatest fixed point. This extends results of Adámek and Koubek.Partial financial support of the Grant Agency of the Czech Republic under Grant No. 201/93/0950 is gratefully acknowledged.     

Eulerian numbers with fractional order parameters

Summary The aim of this paper is to generalize the well-known Eulerian numbers, defined by the recursion relationE(n, k) = (k + 1)E(n – 1, k) + (n – k)E(n – 1, k – 1), to the case thatn is replaced by . It is shown that these Eulerian functionsE(, k), which can also be defined in terms of a generating function, can be represented as a certain sum, as a determinant, or as a fractional Weyl integral. TheE(, k) satisfy recursion formulae, they are monotone ink and, as functions of , are arbitrarily often differentiable. Further, connections with the fractional Stirling numbers of second kind, theS(, k), > 0, introduced by the authors (1989), are discussed. Finally, a certain counterpart of the famous Worpitzky formula is given; it is essentially an approximation ofx in terms of a sum involving theE(, k) and a hypergeometric function.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth.     

On cyclic biquadratic fields related to a problem of Hasse

In this note we shall prove that there exist infinitely many cyclic biquadratic fieldsK whose integral bases are neither {1, , ², } nor {1, , , ³) for any numbers , inK. Next, we shall construct infinitely many cyclic biquadratic fieldsK which have the index 1, but still have not the integral basis {1, , ², ³) for every inK. Finally we shall give a class of biquadratic fields for a problem of Hasse concerning an integral basis.     

Galois theory for the family of partial differential equationsΔ α ψ=0

Summary The partial differential fields most suited for the purpose of construction of Galois theory for the family (1) are endowed with the symmetric bilinear form (2iv) and are called -differential fields. In Section 1 are defined certain algebraic notions related to the symmetric bilinear form (2iv) and which are necessary for the construction of any Galois theory. Necessary and sufficient condition for the extension of the domain of the operator (this operator is not a derivation although it commutes with the partial derivations of the -differential field) from an -differential fieldK to a finitely generated -differential extension field is given in Theorem 1.Section 2 defines the notion of -differential mapping as linear mappings which preserve the symmetric bilinear form and commute with the partial derivations. The group properties of the set of -differential mappings are discussed and the Galois correspondence theorems set up for -differential fields.Section 3 sets up the notion of -Liouvillian extensions of -differential fields and briefly discusses the Galois groups associated with these -Liouvillian extension fields.Section 4 points to the procedure for the algebraic characterization of -simple--differential field extensions by elementary solutions of the partial differential equation _m =0.     

Stability properties of collocation methods

Lower bounds for are given for which equidistant s-point collocation methods areA()-stable for arbitrarys.     

Quelques propriétés des solutions de l'équation de Ginzburg-Landau sur un ouvert de ∝2

For a solution u of –u=u(1–|u|²) on the whole plane, |u|<1 holds everywhere unless u=eⁱ for some ; the derivatives of order k have moduli a constant M _kdepending only on k. For a solution u on an open set ², the moduli of u and its derivatives have upper bounds depending only on the distance to ²\ therefore the set of solutions on a given is compact in C() for the topology of uniform convergence on compact subsets of . For a solution u such that |u|<1, 1–|u| satisfies an estimation similar to the classical Harnack inequality for positive harmonic functions.Finally, if is bounded and |u| has a lim supm at each boundary point, the |u|m in if m1, but if m<1 then |u| admits only a majorant S _m with values in ]m, 1[ and sufficient conditions are given for lim S _m =0 or S _m =O(m) as m0.

     

A 0-stable linear multistep formulas of theα-type

The-type linear multistep formulas are a generalization of the Adams-type formulas. This paper is concerned with completely characterizing theA ₀-stability of thek-step, orderk -type formulas. Specifically, all such formulas of orders 4 or less are identified and it is shown that no-type formulas of order 5 or more exist. These theorems generalize some previous results.     

Admissibility of unbiased tests for a composite hypothesis with a restricted alternative

This paper discusses -admissiblility and d-admissiblity which are important concepts in studying the performance of statistical tests for composite hypotheses. A sufficient condition for -admissibility is presented. When =1/m, the Nomakuchi-Sakata test, which is uniformly more powerful than the likelihood ratio test for hypotheses min (₁, ₁) = 0 versus min (₁, ₁) > 0, is generalized for a class of distributions in an exponential family, and its unbiasedness and -admissibility are shown. Finally, the case of 1/m is discussed in brief.     

L 2-approximation by the translates of a function and related attenuation factors

Summary Let be thek-dimensional subspace spanned by the translates (·–2j/k),j=0, 1, ...,k–1, of a continuous, piecewise smooth, complexvalued, 2-periodic function . For a given functionfL ²(–, ), its least squares approximantS _kf from can be expressed in terms of an orthonormal basis. Iff is continuous,S _kf can be computed via its discrete analogue by fast Fourier transform. The discrete least squares approximant is used to approximate Fourier coefficients, and this complements the works of Gautschi on attenuation factors. Examples of include the space of trigonometric polynomials where is the de la Valleé Poussin kernel, algebraic polynomial splines where is the periodic B-spline, and trigonometric polynomial splines where is the trigonometric B-spline.     

Finding the αn-th largest element

We describe an algorithm for selecting the n-th largest element (where 0<<1), from a totally ordered set ofn elements, using at most (1+(1+o(1))H())·n comparisons whereH() is the binary entropy function and theo(1) stands for a function that tends to 0 as tends to 0. For small values of this is almost the best possible as there is a lower bound of about (1+H())·n comparisons. The algorithm obtained beats the global 3n upper bound of Schönhage, Paterson and Pippenger for <1/3.     

Comparison of four algorithms accelerating the convergence of a subset of logarithmic fixed point sequences

The behaviour of four algorithms accelerating the convergence of a subset of LOG is compared (LOG is the set of logarithmic sequences). This subset, denoted LOGF ₁ , is that of fixed point sequences whose associated error sequence,e _n =S _n –S, verifiese _n+1 =e _n + ₂ e _n ² + ₃ e _n ³ +... , where _{3 2} ² , ₂ < 0. The algorithms are modifications of the -algorithm and of Aitken's ² adapted to LOGF ₁ , the iterated ₂-algorithm, or Lubkin's transform, and the -algorithm of Brezinski. All of them accelerate the convergence of sequences in LOGF ₁ , but precise results are given on their relative convergence speed. This comparison is illustrated by numerical examples.     

On some properties of multiple conjugate trigonometric series

We have obtained an estimate, in terms of partial and mixed moduli, of the continuity of deviation of the Cesáro (C, ) means ( = (₁,...,_n),_i , ₁ > –1, ) of the sequence of rectangular partial sums ofn-multiple (n>1) conjugate trigonometric series from then-multiple truncated conjugate function. This estimate implies the result on them -convergence (1) of (C, ) means (₁ > 0, ) provided that the essential conditions are imposed on the partial moduli of continuity. Finally, it is shown that them -convergence cannot be replaced by ordinary convergence.     

On the dispersion spectrum

A measure for the denseness of sequences (an) mod 1, irrational, is the dispersion constantD() introduced byH. Niederreiter. In this paper the smallest accumulation point ₁ of the set of theD() is determined and all those are explicitely given for whichD () < ₁ holds.     

Superstable implicit Runge-Kutta methods for second order initial value problems

Using the well known properties of thes-stage implicit Runge-Kutta methods for first order differential equations, single step methods of arbitrary order can be obtained for the direct integration of the general second order initial value problemsy=f(x, y, y),y(x _o)=y _o,y(x _o)=y _o. These methods when applied to the test equationy+2y+ ² y=0, ,0, +>0, are superstable with the exception of a finite number of isolated values ofh. These methods can be successfully used for solving singular perturbation problems for which f/y and/or f/y are negative and large. Numerical results demonstrate the efficiency of these methods.     

On the Structure of Spaces of Polyanalytic Functions

Suppose that A_mL_p(D,) is the space of all m-analytic functions on the disk D={z:|z| < 1} which are pth power integrable over area with the weight (1-|z|²), > -1. In the paper, we introduce subspaces A_kL_p ⁰(D,), k=1,2,...,m, of the space A _mL_p(D,) and prove that A _mL_p(D,) is the direct sum of these subspaces. These results are used to obtain growth estimates of derivatives of polyanalytic functions near the boundary of arbitrary domains.     

Differentiability properties of the minimal average action

Given aZ ⁿ⁺¹-periodic variational principle onR ⁿ⁺¹ we look for solutionsu:R ⁿ R minimizing the variational integral with respect to compactly supported variations. To every vector R ⁿ we consider a subset of solutions which have an average slope when averaging overR ⁿ. The minimal average action A() is defined by the average value of the variational integral given by a solution with average slope . Our main result is:A is differentiable at if and only if the set is totally ordered (in the natural sense). In case that is not totally ordered,A is differentiable at in some direction R ⁿ{0} if and only if is orthogonal to the subspace defined by the rational dependency of . Assuming that the i^th component of is rational with denominator sⁱ N in lowest terms, we show: The difference of right- and left-sided derivative in the i^th standard unit direction is bounded by const · .     

Random reals and the relation 171-1171-1171-1

It is consistent that ₁(₁,(:n))² holds in any random extension for n finite and countable.