Das 0-1-Gesetz der terminalen σ-Algebra bei Harrisirrfahrten

Für homogene M.K., bestehend aus einer aperiodischen rekurrenten Klasse, ist bekannt, da\ die terminale -Algebra das 0–1-Gesetz erfüllt. Der erste Teil dieser Arbeit behandelt die Gültigkeit des 0–1-Gesetzes für transiente Ketten, für die eine Folge ₀, ₁, ₂, ₃,... von ZustÄnden existiert mit P(nX_n= _l+1¦X₀= _l) = 1, N. Das herzuleitende Kriterium wird nur von dieser Folge und den Stoppzeiten, von _l nach _l+1 zu gelangen, abhÄngen. Eine Anwendung auf Harrisirrfahrten wird uns dort konkrete Aussagen liefern.     

Der Beweis eines Satzes von G. Choodnovsky

1. If is a weakly compact cardinal then ( ⁺)( ). 2. If is measurable andU a normal ultrafilter then ( ⁺)(U ).

---

---

Diese Arbeit ist ein Teil der Dissertation des Autors. Teilweise gefördert von der DFG.     

Mad families, forcing and the Suslin Hypothesis

Let be a regular cardinal and P a partial ordering preserving the regularity of . If P is (-Baire and) of density , then there is a mad family on killed in all generic extensions (if and) only if below each pP there exists a -sized antichain. In this case a mad family on is killed (if and) only if there exists an injection from onto a dense subset of Ult(P) mapping the elements of onto nowhere dense sets. If 2^<=, then in each generic extension of V, in which is the minimal cardinal obtaining new subsets, some mad family on is killed or an independent subset of appears. Also, the -Suslin Hypothesis holds iff there exists a mad family on which is killed in each generic extension containing new subsets of and preserving P() for <.Mathematics Subject Classification (2000): 03E35, 03E40, 03E65     

A certain class of functions that are univalent in an annulus

In the class F₁ of functions f(), regular and univalent in the annulus ={<||<1} and satisfying the conditions ¦f()¦ < 1 and f() 0 for , ¦f()¦=1 ¦¦=1, for f(l)=1, one finds the set of the values D(A)=f(A): f for an arbitrary fixed point A. One makes use of the method of variations and certain facts from the theory of the moduli of families of curves.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 144, pp. 82–92, 1985.     

On the free subset property at singular cardinals

We give a proof ofTheorem 1. Let be the smallest cardinal such that the free subset property Fr (, ₁)holds. Assume is singular. Then there is an inner model with ₁ measurable cardinals.     

The Milnor–Totaro Theorem for Space Polygons

If denotes the curvature and the torsion of a closed, generic, and oriented polygonal space curve X in , then we show that _X (² + ²) ds = _X ds + _X | | ds > 4 if is positive. We also show that _X (² + ²) ds 2n if no four consecutive vertices lie in a plane and X has linking number n with a straight line. These extend theorems of Milnor and Totaro.     

Coproducts in the Category <Emphasis Type="Bold">M</Emphasis>κ<Emphasis Type="Bold">Frm</Emphasis>

The purpose of this paper is to study coproducts in the category MFrm (resp. M_cFrm), of metric -frames and uniform (resp. contractive) -frame maps. First, by applying the same technic that was used to find coproducts in Frm, we construct coproducts in the category Frm of -frames and -frame maps. Then, we define a metric diameter on the coproduct in Frm of a family of metric -frames and show that coproduct in Frm preserves metrizability.Mathematics Subject Classifications (2000) 06B23, 06D22, 18A30.     

Quadrature formulas obtained by variable transformation

Quadrature formulas suitable for evaluation of improper integrals such as are obtained by means of variable transformations =tanhu and =erfu, and subsequent use of trapezoidal quadrature rule. Error analysis is carried out by the method of contour integral, and the results are confirmed on several concrete examples. Similar formulas are also obtained to accelerate the convergence of infinite integrals by means of variable transformations =sinhu and =tanu.     

Lacunary (0; 0, 1) interpolation on the roots of Jacobi polynomials and their derivatives,respectively. I (Existence,explicit formulae,unicity)

(0; 0, 1) , {x _k <x _k ^* <x _k+1} _k=1 ^n–1 {x _{k k=1} ⁿ }., I, , _n (x)=P _n ^{(, )} (x)–n- , =, n3 . , x ₀=+1 x _n+1= –1. II .

---

---

To the memory of Paul Erds

---

The research was supported by the Hungarian National Foundation for Scientific Research under Grant # T 914 244.     

Interpolation of monotone functions in lattices

We show that for every latticeL ₀ and for every cardinal there is a lattice on which every monotone function can be interpolated by a polynomial on any set of size .Presented by G. Grätzer.Dedicated to '"N     

Inequalities in Products of Minors of Totally Nonnegative Matrices

Let _I,I be the minor of a matrix which corresponds to row set I and column set I. We give a characterization of the inequalities of the form _{I,I K,K J,J L,L} which hold for all totally nonnegative matrices. This generalizes a recent result of Fallat, Gekhtman, and Johnson.     

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 <}.     

Quasi-coproducts and accessible categories with wide pullbacks

We establish a 2-categorical duality involving the 2-category A of all -accessible categories with wide pullbacks, also known as locally -polypresentable categories, and of functors preserving -filtered colimits and wide pullbacks. Commutation of wide pullbacks with so-called quasi-coproducts in Set is the basic ingredient to this duality, which leads to a full characterization of categories of type Wdpb Filt (A, Set)=A The first author acknowledges financial assistance from a special research grant of the Faculty of Arts at York University. The second author is partially supported by an NSERC operating grant.Presented at the European Colloquium of Category Theory, Tours, France, 25–31 July 1994.     

Large deviations for the invariant measure of a reaction-diffusion equation with non-Gaussian perturbations

Summary In this paper we establish a large deviations principle for the invariant measure of the non-Gaussian stochastic partial differential equation (SPDE) _t v =v +f(x,v )+(x,v ) . Here is a strongly-elliptic second-order operator with constant coefficients, h:=DH _xx-h, and the space variablex takes values on the unit circleS ¹. The functionsf and are of sufficient regularity to ensure existence and uniqueness of a solution of the stochastic PDE, and in particular we require that 0<mM wherem andM are some finite positive constants. The perturbationW is a Brownian sheet. It is well-known that under some simple assumptions, the solutionv ² is aC ^k (S ¹)-valued Markov process for each 0<1/2, whereC (S ¹) is the Banach space of real-valued continuous functions onS ¹ which are Hölder-continuous of exponent . We prove, under some further natural assumptions onf and which imply that the zero element ofC (S ¹) is a globally exponentially stable critical point of the unperturbed equation _t ⁰ = ⁰ +f(x,⁰), that has a unique stationary distributionv ^K, on (C (S ¹), (C ^K (S ¹))) when the perturbation parameter is small enough. Some further calculations show that as tends to zero,v ^K, tends tov ^K,0, the point mass centered on the zero element ofC (S ¹). The main goal of this paper is to show that in factv ^K, is governed by a large deviations principle (LDP). Our starting point in establishing the LDP forv ^K, is the LDP for the process , which has been shown in an earlier paper. Our methods of deriving the LDP forv ^K, based on the LDP for are slightly non-standard compared to the corresponding proofs for finite-dimensional stochastic differential equations, since the state spaceC (S ¹) is inherently infinite-dimensional.This work was performed while the author was with the Department of Mathematics, University of Maryland, College Park, MD 20742, USA     

On the solution of a generalized Schrödinger-type equation

Lu(t)+(u,F)g(t)=f(t), tS. , ( F, g). .

---

---

The authors wish to thank Professor Yu. A. Rozanov for his help and discussions.     

On graphs that can be oriented as diagrams of ordered sets

We study some equivalent and necessary conditions for a finite graph to be the covering graph of a (partially) ordered set. For each 1, M. Aigner and G. Prins have introduced a notion of a vertex colouring, here called -good colouring, such that a 1-good colouring is the usual concept and graphs that have a 2-good colouring are precisely covering graphs. We present some inequalities for the corresponding chromatic numbers , especially for x ₂. There exist graphs that satisfy these inequalities for =2 but are not covering graphs. We show also that x ₂ cannot be bounded by a function of x=x ₁. A construction of Neetil and Rödl is used to show that x ₂ is not bounded by a function of the girth.     

Boundary Functionals for the Difference of Nonordinary Renewal Processes with Discrete Time

For the difference of nonordinary renewal processes, we find the distribution of the main boundary functionals. For the queuing system D |D |1, we determine the distribution of the number of calls in transient and stationary modes.     

On condition numbers and the distance to the nearest ill-posed problem

Summary The condition number of a problem measures the sensitivity of the answer to small changes in the input. We call the problem ill-posed if its condition number is infinite. It turns out that for many problems of numerical analysis, there is a simple relationship between the condition number of a problem and the shortest distance from that problem to an ill-posed one: the shortest distance is proportional to the reciprocal of the condition number (or bounded by the reciprocal of the condition number). This is true for matrix inversion, computing eigenvalues and eigenvectors, finding zeros of polynomials, and pole assignment in linear control systems. In this paper we explain this phenomenon by showing that in all these cases, the condition number satisfies one or both of the diffrential inequalitiesm·²DM·², where D is the norm of the gradient of . The lower bound on D leads to an upper bound 1/m(x) on the distance. fromx to the nearest ill-posed problem, and the upper bound on D leads to a lower bound 1/(M(X)) on the distance. The attraction of this approach is that it uses local information (the gradient of a condition number) to answer a global question: how far away is the nearest ill-posed problem? The above differential inequalities also have a simple interpretation: they imply that computing the condition number of a problem is approximately as hard as computing the solution of the problem itself. In addition to deriving many of the best known bounds for matrix inversion, eigendecompositions and polynomial zero finding, we derive new bounds on the distance to the nearest polynomial with multiple zeros and a new perturbation result on pole assignment.     

Superlinearly Convergent Infeasible-Interior-Point Algorithm for Degenerate LCP

A large-step infeasible path-following method is proposed for solving general linear complementarity problems with sufficient matrices. If the problem has a solution, the algorithm is superlinearly convergent from any positive starting points, even for degenerate problems. The algorithm generates points in a large neighborhood of the central path. Each iteration requires only one matrix factorization and at most three (asymptotically only two) backsolves. It has been recently proved that any sufficient matrix is a P _*()-matrix for some 0. The computational complexity of the algorithm depends on as well as on a feasibility measure of the starting point. If the starting point is feasible or close to being feasible, then the iteration complexity is . Otherwise, for arbitrary positive and large enough starting points, the iteration complexity is O((1 + )² nL). We note that, while computational complexity depends on , the algorithm itself does not.     

Converse theorems for multidimensional Kantorovich operators

L _p [0, l]. . . - .

---

---

Supported by National Science Foundation, Zhejiang Provincial Science Foundation of China, and Alexander von Humboldt Foundation of Germany.