We treat a variation of graph domination which involves a partition (V1, V2,..., Vk) of the vertex set of a graph G and domination of each partition class Vi over distance d where all vertices and edges of G may be used in the domination process. Strict upper bounds and extremal graphs are presented; the results are collected in three handy tables. Further, we compare a high number of partition classes and the number of dominators needed.
In this paper we introduce the concept of the Hamilton triangle of a given triangle in an isotropic plane and investigate a number of important properties of this concept. We prove that the Hamilton triangle is homological with the observed triangle and with its contact and complementary triangles. We also consider some interesting statements about the relationships between the Hamilton triangle and some other significant elements of the triangle, like e.g. the Euler and the Feuerbach line, the Steiner ellipse and the tangential triangle.
Generalizing results of Schatte  and Atlagh and Weber , in this paper we give conditions for a sequence of random variables to satisfy the almost sure central limit theorem along a given sequence of integers.
In the 1980’s the author proved lower bounds for the mean value of the modulus of the error term of the prime number theorem and other important number theoretic functions whose oscillation is in connection with the zeros of the Riemann zeta function. In the present work a general theorem is shown in a simple way which gives a lower bound for the mentioned mean value as a function of a hypothetical pole of the Mellin transform of the function. The conditions are amply satisfied for the Riemann zeta function. In such a way the results recover the earlier ones (even in a slightly sharper form). The obtained estimates are often optimal apart from a constant factor, at least under reasonable conditions as the Riemann Hypothesis. This is the case, in particular, for the error term of the prime number theorem.
The ultrapower T* of an arbitrary ordered set T is introduced as an infinitesimal extension of T. It is obtained as the set of equivalence classes of the sequences in T, where the corresponding relation is generated by a free ultrafilter on the set of natural numbers. It is established that T* always satisfies Cantor’s property, while one can give the necessary and sufficient conditions for T so that T* would be complete or it would fulfill the open completeness property, respectively. Namely, the density of the original set determines the open completeness of the extension, while independently, the completeness of T* is determined by the cardinality of T.