The evaluation of Cauchy principal value integrals involving unknown poles

A method is described for the evaluation of a Cauchy principal value integral of the formf ₀ ^p f(t)dt, wheref is analytic in the interval [0,p] except at a simple pole at an unknown point in (0,p), with an unknown residue. The method is based on the trapezoidal rule.     

Geometric techniques in representation theory

A discussion of results and conjectures, focussed around the extension of the modular representation theory for finite Lie-type groups to more general groups that act on building-like geometries.Based on a lecture given at the conference Groups and Geometries-Finite and Algebraic, on 26 March 1986 at Noordwijkerhout, Netherlands (a NATO Advanced Research Workshop).Partially supported by NSF Grant MCS 83-00855.     

Algorithmic aspects of intersection graphs and representation hypergraphs

Let be a family of sets. The intersection graph of is obtained by representing each set in by a vertex and connecting two vertices by an edge if and only if their corresponding sets intersect. Of primary interest are those classes of intersection graphs of families of sets having some specific topological or other structure. The grandfather of all intersection graphs is the class of interval graphs, that is, the intersection graphs of intervals on a line.The scope of research that has been going on in this general area extends from the mathematical and algorithmic properties of intersection graphs, to their generalizations and graph parameters motivated by them. In addition, many real-world applications involve the solution of problems on such graphs.In this paper a number of topics in algorithmic combinatorics which involve intersection graphs and their representative families of sets are presented. Recent applications to computer science are also discussed. The intention of this presentation is to provide an understanding of the main research directions which have been investigated and to suggest possible new directions of research.