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.     

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.     

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.     

On Some Integral Equations in Hilbert Space with an Application to the Theory of Elasticity

A Volterra type integral equation in a Hilbert space with an additional linear operator L and a spectral parameter depending on time is considered. If the parameter does not belong to the spectrum of L unconditional solvability of the considered problem is proved. In the case where the initial value of the parameter coincides with some isolated point of the spectrum of the operator L sufficient conditions for solvability are established. The obtained results are applied to the partial integral equations associated with a contact problem of the theory of elasticity.     

Commutant Lifting Theorem for the Bergman Space

The central question of this paper is the one of finding the right analogue of the Commutant Lifting Theorem for the Bergman space L_a². We also analyze the analogous problem for weighted Bergman spaces L_a,α², − 1 < α < ∞.     

Syntactic characterization of closure under connected limits

Summary We give a syntactic characterization of (finitary) theories whose categories of models are closed under the formation of connected limits (respectively the formation of pullbacks and substructures) in the category of all structures. They are also those theories whose consistent extensions by new atomic facts admit in each component an initial structure (respectively an initial term structure), and also thoseT for whichM(T) is locally finitely multi-presentable in a canonical way. We also show that these two properties of theories are nonuniform.     

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.     

On isomorphic factorizations of circulant graphs

We investigate the conjecture that every circulant graph X admits a k‐isofactorization for every k dividing |E(X)|. We obtain partial results with an emphasis on small values of k. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006