INDEX OF AN IMPLICIT DIFFERENTIAL EQUATION

In this paper we introduce the concept of the index of an implicit differential equation F(x,y,p) = 0, where F is a smooth function, p = dy/dx, F(p) = 0 and F(pp) = 0 at an isolated singular point. We also apply the results to study the geometry of surfaces in R(5).

3-manifolds in Euclidean space from a contact viewpoint

We study the geometry of 3-manifolds generically embedded in R(n) by means of the analysis of the singularities of the distance-squared and height functions on them. We describe the local structure of the discriminant (associated to the distribution of asymptotic directions), the ridges and the flat ridges.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

A NOTE ON THE COMPOSITE OF TWO IRREDUCIBLE MORPHISMS

In this note, we show that a composite of two irreducible morphisms between indecomposable modules cannot lie in R(3)\R(5).