On perfectly normal dense subspaces of products

Let M be a separable metric space consisting of more than one point. We construct perfectly normal dense subspaces Z⊂Mc² and (under additional set-theoretic assumption) Y⊂Mc which are not collectionwise Hausdorff.     

The way of Diophantus: Some clarifications on Diophantus' method of solution

In the introduction of the Arithmetica Diophantus says that in order to solve arithmetical problems one has to “follow the way he (Diophantus) will show.” The present paper has a threefold objective. Firstly, the meaning of this sentence is discussed, the conclusion being that Diophantus had elaborated a program for handling various arithmetical problems. Secondly, it is claimed that what is analyzed in the introduction is definitions of several terms, the exhibition of their symbolism, the way one may operate with them, but, most significantly, the main stages of the program itself. And thirdly, it is argued that Diophantus' intention in the Arithmetica is to show the way the stages of his program should be practically applied in various arithmetical problems.     

An explosion point space without the fixed point property

In 1988 A. Gutek proved that there exist one-point connectifications of hereditarily disconnected spaces that do not have the fixed point property. We improve on this result by constructing a one-point connectification of a totally disconnected space without the fixed point property.     

Roots,iterations and logarithms of formal automorphisms

In this paper it is proved that having a logarithm is equivalent to having roots of arbitrary order in the group of automorphisms of a formal power series ring, and in algebraic subgroups too     

Expandable network and covering properties for uniform Eberlein compacta

In this paper we characterize the class of uniform Eberlein compact spaces through a network condition and also in terms of covering properties for the square of the space.     

Complete systems, elementary submodels and the tightness of upper hyperspaces

We introduce and study some completeness properties for systems of open coverings of a given topological space. A Hausdorff space admitting a system of cardinality κ satisfying one of these properties is of type Gκ. Hence, we define several new variants of the ?ech number and use elementary submodels to determine further results. We introduce M-hulls and M-networks, for M elementary submodel. As an application, we give estimates for both the tightness and the Lindelöf number of a generic upper hyperspace. Two recent results of Costantini, Holá and Vitolo on the tightness of co-compact hyperspaces follow from ours as corollaries.     

Continuous time collocation methods for Volterra-Fredholm integral equations

Summary Integral equations of mixed Volterra-Fredholm type arise in various physical and biological problems. In the present paper we study continuous time collocation, time discretization and their global and discrete convergence properties.     

Removable singularities of CR functions on singular boundaries

The problem of analytic representation of integrable CR functions on hypersurfaces with singularities is treated. The nature of singularities does not matter while the set of singularities has surface measure zero. For simple singularities like cuspidal points, edges, corners, etc., also the behaviour of representing analytic functions near singular points is studied. Received: 8 December 2000; in final form: 24 June 2001/Published online: 1 February 2002     

Some new nonlinear inequalities and applications to boundary value problems

In this paper, we establish some new nonlinear integral inequalities of the Gronwall–Bellman–Ou-Iang-type in two variables. These on the one hand generalizes and on the other hand furnish a handy tool for the study of qualitative as well as quantitative properties of solutions of differential equations. We illustrate this by applying our new results to certain boundary value problem.     

Estimating the largest singular values of large sparse matrices via modified moments

We describe a procedure for determining a few of the largest singular values of a large sparse matrix. The method by Golub and Kent which uses the method of modified moments for estimating the eigenvalues of operators used in iterative methods for the solution of linear systems of equations is appropriately modified in order to generate a sequence of bidiagonal matrices whose singular values approximate those of the original sparse matrix. A simple Lanczos recursion is proposed for determining the corresponding left and right singular vectors. The potential asynchronous computation of the bidiagonal matrices using modified moments with the iterations of an adapted Chebyshev semi-iterative (CSI) method is an attractive feature for parallel computers. Comparisons in efficiency and accuracy with an appropriate Lanczos algorithm (with selective re-orthogonalization) are presented on large sparse (rectangular) matrices arising from applications such as information retrieval and seismic reflection tomography. This procedure is essentially motivated by the theory of moments and Gauss quadrature.This author's work was supported by the National Science Foundation under grants NSF CCR-8717492 and CCR-910000N (NCSA), the U.S. Department of Energy under grant DOE DE-FG02-85ER25001, and the Air Force Office of Scientific Research under grant AFOSR-90-0044 while at the University of Illinois at Urbana-Champaign Center for Supercomputing Research and Development.This author's work was supported by the U.S. Army Research Office under grant DAAL03-90-G-0105, and the National Science Foundation under grant NSF DCR-8412314.