We provide a fairly general method, which is straightforward and widely applicable, for constructing some coreflections in the category of nearness frames. The method captures all coreflective subcategories with 1 1 coreflection maps; this includes the well-known uniform, totally bounded and separable coreflections. The primary application of this method answers in the affirmative the question ...

In this paper, we explore completely regular codes in the Hamming graphs and related graphs. Experimental evidence suggests that many completely regular codes have the property that the eigenvalues of the code are in arithmetic progression. In order to better understand these “arithmetic completely regular codes”, we focus on cartesian products of completely regular codes and products of their ...

We are going to give necessary and suucient conditions for a multivariate stationary stochastic process to be completely regular. We also give the answer to a question of V.V. Peller concerning the spectral measure characterization of such processes .