For an r-graph H, let C(H) = minS d(S), where the minimum is taken over all (r − 1)-sets of vertices of H, and d(S) is the number of vertices v such that S ∪ {v} is an edge of...
We enumerate all totally real number fields F with root discriminant F 14. There are 1229 such fields, each with degree [F : Q] 9. In this article, we consider the following prob...
Abstract. We consider numerical methods for a “quasi-boundary value” regularization of the backward parabolic problem given by ut + Au = 0 , 0 < t < T u(T ) = f, where A ...
Karen A. Ames, Gordon W. Clark, James F. Epperson,...
Abstract. We say the endomorphism problem is solvable for an element W in a free group F if it can be decided effectively whether, given U in F , there is an endomorphism φ of F ...