A complete analysis of a model nonlinear singular perturbation problem having a continuous locus of singular points

Consider the boundary value problem ?y′′ = (y² ? t²)y′, ? 1 ≤ t ≤ 0, y(? 1) = A, y(0) = B. Depending on the choice of A and B, one can ensure the existence of “turning points,” $\text{t}\text{?}\text{; y(t, ?)}{}^2\text{?}\text{t}\text{?}{}^2\text{= 0}$. However, due to the nonlinear nature of the problem, one does not know the position or number of such turning points. In the case when A >f 0 = B Kedem, Parter and Steuerwalt gave a development of this problem based on an abstract bifurcation analysis which in turn was based on “degree theory.” In this paper we give a complete analysis of the problem based entirely on a priori estimates and the “shooting” method.     

Recognizing graphic matroids

There is no polynomially bounded algorithm to test if a matroid (presented by an “independence oracle”) is binary. However, there is one to test graphicness. Finding this extends work of previous authors, who have given algorithms to test binary matroids for graphicness. Our main tool is a new result that ifM′ is the polygon matroid of a graphG, andM is a different matroid onE(G) with the same rank, then there is a vertex ofG whose star is not a cocircuit ofM.     

On minors of non-binary matroids

No binary matroid has a minor isomorphic toU ₄ ² , the “four-point line”, and Tutte showed that, conversely, every non-binary matroid has aU ₄ ² minor. However, more can be said about the element sets ofU ₄ ² minors and their distribution. Bixby characterized those elements which are inU ₄ ² minors; a matroidM has aU ₄ ² minor using elementx if and only if the connected component ofM containingx is non-binary. We give a similar (but more complicated) characterization for pairs of elements. In particular, we prove that for every two elements of a 3-connected non-binary matroid, there is aU ₄ ² minor using them both.     

Darstellung von Slockcopolymeren von Vinylacetat in viskosen schlechten L?sungsmitteln

Ohne Zusammenfassung     

Every (p,p-2) graph is contained in its complement

The following is proved: If G is graph of order p (≥2) and size p-2, then there exists an isomorphic embedding of G into its complement.