Symmetries and conservation laws of partial differential equations: Basic notions and results

The main notions and results which are necessary for finding higher symmetries and conservation laws for general systems of partial differential equations are given. These constitute the starting point for the subsequent papers of this volume. Some problems are also discussed.     

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 the density of the space of continuous and uniformly continuous functions

For X a metrizable space and (Y,ρ) a metric space, with Y pathwise connected, we compute the density of (C(X,(Y,ρ)),σ)—the space of all continuous functions from X to (Y,ρ), endowed with the supremum metric σ. Also, for (X,d) a metric space and (Y,‖⋅‖) a normed space, we compute the density of (UC((X,d),(Y,ρ)),σ) (the space of all uniformly continuous functions from (X,d) to (Y,ρ), where ρ is the metric induced on Y by ‖⋅‖). We also prove that the latter result extends only partially to the case where (Y,ρ) is an arbitrary pathwise connected metric space.To carry such an investigation out, the notions of generalized compact and generalized totally bounded metric space, introduced by the author and A. Barbati in a former paper, turn out to play a crucial rôle. Moreover, we show that the first-mentioned concept provides a precise characterization of those metrizable spaces which attain their extent.     

Coxeter complexes and graph-associahedra

Given a graph Γ, we construct a simple, convex polytope, dubbed graph-associahedra, whose face poset is based on the connected subgraphs of Γ. This provides a natural generalization of the Stasheff associahedron and the Bott-Taubes cyclohedron. Moreover, we show that for any simplicial Coxeter system, the minimal blow-ups of its associated Coxeter complex has a tiling by graph-associahedra. The geometric and combinatorial properties of the complex as well as of the polyhedra are given. These spaces are natural generalizations of the Deligne-Knudsen-Mumford compactification of the real moduli space of curves.     

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.     

Spatial design matrices and associated quadratic forms: structure and properties

The paper provides significant simplifications and extensions of results obtained by Gorsich, Genton, and Strang (J. Multivariate Anal. 80 (2002) 138) on the structure of spatial design matrices. These are the matrices implicitly defined by quadratic forms that arise naturally in modelling intrinsically stationary and isotropic spatial processes. We give concise structural formulae for these matrices, and simple generating functions for them. The generating functions provide formulae for the cumulants of the quadratic forms of interest when the process is Gaussian, second-order stationary and isotropic. We use these to study the statistical properties of the associated quadratic forms, in particular those of the classical variogram estimator, under several assumptions about the actual variogram.     

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.