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.     

On ηα-groups and fields

Let :=. The following are known: two -sets of power are isomorphic. Let >0. Two ordered divisible Abelian groups that are -sets of power are isomorphic, two real closed fields that are -sets of power are isomorphic. The following is shown: (1) there exist 2 nonisomorphic ordered Abelian groups (respectively ordered fields) that are -sets of power ; (2) there exist 2 nonisomorphic ordered divisible Abelian groups (respectively real closed fields) of power all having the same order type; (3) there exist 2 nonisomorphic ordered divisible Abelian groups (respectively real closed fields) that are -sets having the same order type.     

Almost convex groups and the eight geometries

IfM is a closed Nil geometry 3-manifold then ₁(M) is almost convex with respect to a fairly simple geometric generating set. IfG is a central extension or a extension of a word hyperbolic group, thenG is also almost convex with respect to some generating set. Combining these with previously known results shows that ifM is a closed 3-manifold with one of Thurston's eight geometries, ₁(M) is almost convex with respect to some generating set if and only if the geometry in question is not Sol.     

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.     

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

Spinc Structures and Scalar Curvature Estimates

In this note, we look at estimates for the scalar curvature of a compact, connected Riemannian manifold Mwhich are related to spin ^c Dirac operators.We show that one may not enlarge a Kähler metric with positiveRicci curvature without making smaller somewhere on M.More generally, if f: N M is an area-nonincreasing map of a certain topological type,then the scalar curvature k of Ncannot be everywhere larger than f.If k f, then N is isometric to M × F, where F possesses a parallel untwisted spinor.We also give explicit upper bounds for min for arbitrary Riemannian metrics on certainsubmanifolds of complex projective space.In certain cases, these estimates are sharp:we give examples where equality is obtained.     

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.     

Generation of alternating groups by pairs of conjugates

Considering the conjugacy classes of the alternating group of degreen, those classes that contain a pair of generators are in the majority. In fact, the proportion of such classes is 1 –(n), and(n) 0 asn .     

Estimation of an Exponential Quantile under a General Loss and an Alternative Estimator under Quadratic Loss

Estimation of the quantile + of an exponential distribution with parameters (, ) is considered under an arbitrary strictly convex loss function. For obeying a certain condition, the inadmissibility of the best affine equivariant procedure is established by exhibiting a better estimator. The LINEX loss is studied in detail. For quadratic loss, sufficient conditions are given for a scale equivariant estimator to dominate the best affine equivariant one and, when exceeds a lower bound specified below, a new minimax estimator is identified.     

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.     

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.     

Fourier transforms of functions in Herz spaces on certain groups

G— - {G _n } _n =– , G _n =G G _n ={0}. G. K(,p,q;G) K(,p,q;) - G , . , G - (. . sup {order (G _n /G _n +1):=0, ± 1, ...<), K(.,p,q;G) L ^{p/(p–p–1),q} () L ^{p/(p–p–1),q} () K(-,p,q; ), 1<p2, 0<<1/p=1–1/p, 0<q. . . . .     

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     

Approximate maximum likelihood estimation in linear regression

The application of the ML method in linear regression requires a parametric form for the error density. When this is not available, the density may be parameterized by its cumulants ( _i ) and the ML then applied. Results are obtained when the standardized cumulants ( _i ) satisfy _i = _i+2/ ₂ ^(i+2)/2 =O(v ⁱ ) asv 0 fori>0.Research financed in part by the Research Center of the Athens University of Economics and Business.     

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.     

When is the graph product of hyperbolic groups hyperbolic?

Given a finite simplicial graph , and an assignment of groups to the verticles of , the graph product is the free product of the vertex groups modulo relations implying that adjacent vertex groups commute. We use Gromov's link criteria for cubical complexes and techniques of Davis and Moussang to study the curvature of graph products of groups. By constructing a CAT(–1) cubical complex, it is shown that the graph product of word hyperbolic groups is itself word hyperbolic if and only if the full subgraph in , generated by vertices whose associated groups are finite, satisfies three specific criteria. The construction shows that arbitrary graph products of finite groups are Bridson groups.     

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.     

Extension of Locally Defined Indefinite Functions on Ordered Groups

We give a definition of -indefinite function of archimedean type, on an interval of an ordered group with an archimedean point. We say that has the indefinite extension property if every continuous -indefinite function of archimedean type, on an interval of , can be extended to a continuous -indefinite function on the whole group .We show that if a group is semi-archimedean and it has the indefinite extension property, then with the lexicographic order and the product topology has the indefinite extension property. As a corollary it is obtained that the groups and with the lexicographic order and the usual topologies, have the indefinite extension property.To Professor José R. León, for his kind encouragement.Both authors were supported in part by the CDCH of the Univ. Central de Venezuela and by CONICIT grant G-97000668. Both authors were visitors at IVIC during the realization of this paper.Submitted: August 8, 2002 Revised: January 30, 2003     

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.     

Circularity of Finite Groups without Fixed Points

Let be a fixed point free group given by the presentation where and are relative prime numbers, t = /s and s = gcd( – 1,), and is the order of modulo . We prove that if (1) = 2, and (2) is embeddable into the multiplicative group of some skew field, then is circular. This means that there is some additive group N on which acts fixed point freely, and |((a)+b)((c)+d)| 2 whenever a,b,c,d N, a0c, are such that (a)+b(c)+d.