Many chapters in this book provide a good sense of what writing to learn is and how it works. I will explain in this chapter how I use writing-to-learn techniques to help students to think through an idea more clearly. Two aspects of writing to learn are very important: it helps students to understand content better, and it shows them that writing is a process with various stages. When students...

Sharp Grüss-type inequalities for functions whose derivatives are of bounded variation (Lipschitzian or monotonic) are given. Applications in relation with the well-known Čebyšev, Grüss, Ostrowski and Lupaş inequalities are provided as well.

Let Z be the Rosenblatt process with the representation Z t = ∫ t

For a square matrix A, let S(A) be an eigenvalue inclusion set such as the Gershgorin region, the union of Cassini ovals, and the Ostrowski’s set. Characterization is obtained for maps Φ on n×n matrices satisfying S(Φ(A)Φ(B)) = S(AB) for all matrices A and B.

In this paper we obtain some inequalities related to the generalized triangle and quadratic triangle inequalities for vectors in inner product spaces. Some results that employ the Ostrowski discrete inequality for vectors in normed linear spaces are also obtained.

We determine the minimum size of n-factor-critical graphs and that of k-extendable bipartite graphs, by considering Harary graphs and related graphs. Moreover, we determine the minimum size of k-extendable non-bipartite graphs for k = 1, 2, and pose a related conjecture for general k.

A.M. Ostrowski in 1951 gave two well-known upper bounds for the spectral radius of nonnegative matrices. However, the bounds are not of much practical use because they all involve a parameter α in the interval [0, 1], and it is not easy to decide the optimum value of α. In this paper, their equivalent forms which can be computed with the entries of matrix and without having to minimize the expr...

We study an impartial game introduced by Anderson and Harary. This game is played by two players who alternately choose previously-unselected elements of a finite group. The first player who builds a generating set from the jointly-selected elements wins. We determine the nimnumbers of this game for generalized dihedral groups, which are of the form Dih(A) = Z2 n A for a finite abelian group A.