We show that the usual variational formulation of the problem of analytic continuation from an arc on the boundary of a plane domain does not lead to a relaxation of this overdetermined problem. To attain such a relaxation, we bound the domain of the functional, thus changing the Euler equations.

A connected graph is total domination stable upon edge removal, if the removal of an arbitrary edge does not change the total domination number. We determine the minimum number of edges required for a total domination stable graph in terms of its order and total domination number.

We prove several inequalities involving the Fourier transform of functions which are compactly supported. The constraint that the functions have compact support is a simplifying feature which is desirable in applications, but there is a trade-off in control of other relevant quantities-- such as the mass of the function. With applications in mind, we prove inequalities which quantify these types of trade-offs. / text