Sharp estimates in terms of moduli of smoothness for compound cubature rules

Summary In 1980 Dahmen-DeVore-Scherer introduced a modulus of continuity which turns out to reflect invariance properties of compound cubature rules effectively. Accordingly, sharp error bounds are derived, the existence of relevant counterexamples being a consequence of a quantitative resonance principle, established previously.     

On extremally disconnected topological groups

We introduce the notion of a partially selective ultrafilter and prove that (a) if G is an extremally disconnected topological group and p is a converging nonprincipal ultrafilter on G containing a countable discrete subset, then p is partially selective, and (b) the existence of a nonprincipal partially selective ultrafilter on a countable set implies the existence of a P-point in ω^∗. Thus it is consistent with ZFC that there is no extremally disconnected topological group containing a countable discrete nonclosed subset.     

关于康托集类光栅的实验探究

设计制作了康托集分形衍射光栅,通过对康托集分形光栅3个阶段的夫琅禾费衍射现象的观察,根据惠更斯-菲涅耳原理,得到了一维康托集分形光栅的夫琅禾费衍射光强分布特性.     

Rehabilitation of the Gauss-Jordan algorithm

Summary In this paper a Gauss-Jordan algorithm with column interchanges is presented and analysed. We show that, in contrast with Gaussian elimination, the Gauss-Jordan algorithm has essentially differing properties when using column interchanges instead of row interchanges for improving the numerical stability. For solutions obtained by Gauss-Jordan with column interchanges, a more satisfactory bound for the residual norm can be given. The analysis gives theoretical evidence that the algorithm yields numerical solutions as good as those obtained by Gaussian elimination and that, in most practical situations, the residuals are equally small. This is confirmed by numerical experiments. Moreover, timing experiments on a Cyber 205 vector computer show that the algorithm presented has good vectorisation properties.     

Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

Analysis of two-sample truncated data using generalized logistic models

Parallel to Cox's [JRSS B34 (1972) 187-230] proportional hazards model, generalized logistic models have been discussed by Anderson [Bull. Int. Statist. Inst. 48 (1979) 35-53] and others. The essential assumption is that the two densities ratio has a known parametric form. A nice property of this model is that it naturally relates to the logistic regression model for categorical data. In astronomic, demographic, epidemiological, and other studies the variable of interest is often truncated by an associated variable. This paper studies generalized logistic models for the two-sample truncated data problem, where the two lifetime densities ratio is assumed to have the form exp{α+φ(x;β)}. Here φ is a known function of x and β, and the baseline density is unspecified. We develop a semiparametric maximum likelihood method for the case where the two samples have a common truncation distribution. It is shown that inferences for β do not depend the nonparametric components. We also derive an iterative algorithm to maximize the semiparametric likelihood for the general case where different truncation distributions are allowed. We further discuss how to check goodness of fit of the generalized logistic model. The developed methods are illustrated and evaluated using both simulated and real data.     

Coset extensions of <Emphasis Type=”Italic”>S</Emphasis>-sets

Summary Three weak variants of compactness which lie strictly between compactness and quasicompactness, are introduced. Their basic properties are studied. The interplay with mapping and their direct and inverse preservation under mappings are investigated. In the process three decompositions of compactness are observed.     

Admissible slopes for monotone and convex interpolation

Summary In many applications, interpolation of experimental data exhibiting some geometric property such as nonnegativity, monotonicity or convexity is unacceptable unless the interpolant reflects these characteristics. This paper identifies admissible slopes at data points of variousC ¹ interpolants which ensure a desirable shape. We discuss this question, in turn for the following function classes commonly used for shape preserving interpolations: monotone polynomials,C ¹ monotone piecewise polynomials, convex polynomials, parametric cubic curves and rational functions.     

Normalization of complex-valued planar vector fields which degenerate along a real curve

Taking as a start point the recent article of Meziani [7], we present several results concerning the normalization of a class of complex vector fields in the plane which degenerate along a real curve. We mainly deal with operators with finite regularity and analyze both the local situation as well as the case of normalization near a circle. Some related questions (e.g., on semi-global solvability and on the normalization of a class of generalized Mizohata operators) are also discussed.