Independence and graph homomorphisms graph homomorphisms

A graph with n vertices that contains no triangle and no 5-cycle and minimum degree exceeding n/4 contains an independent set with at least (3n)/7 vertices. This is best possible. The proof proceeds by producing a homomorphism to the 7-cycle and invoking the No Homomorphism Lemma. For k ≥ 4, a graph with n vertices, odd girth 2k+1, and minimum degree exceeding n/(k+1) contains an independent set with at least kn/(2k+1) vertices; however, we suspect this is not best possible. © 1993 John Wiley & Sons, Inc.     

On the free boundary of surfaces with bounded mean curvature: the non-perpendicular case

H?lder continuity up to the free boundary is proved for minimizing solutions if they meet the supporting surface in an angle which is bounded away from zero. The problem is localized by proving the continuity of the distance function, a result which is also true for stationary points. Received: 14 April 1998     

Sample path analysis of level crossings for the workload process

We examine level crossings of sample paths of queueing processes and investigate the conditions under which the limiting empirical distribution for the workload process exists and is absolutely continuous. The connection between the density of the workload distribution and the rate of downcrossings is established as a sample path result that does not depend on any stochastic assumptions. As a corollary, we obtain the sample path version of the Takács formula connecting the time and customer stationary distributions in a queue. Defective limiting empirical distributions are considered and an expression for the mass at infinity is derived.This research has been supported in part by NSF Grants ECS-8811003 and DDM-8905638.     

How History and Philosophy in the US Science Education Standards Could Have Promoted Multidisciplinary Teaching

Based on the forthcoming book, Time for Science Education ( Matthews, in press ), this article notes that the US National Science Education Standards advocate liberal, contextual, or cultural goals for science education, including the expectation that students will understand a certain amount of the historical and cultural significance of science. After mentioning something of the rich role played by the pendulum in the foundation of modern science, in solving the longitude problem, in establishing a universal length standard, and in allowing the creation of an accurate timekeeper, as well as the pendulum clock's function in philosophy and theology, the article draws attention to the scant treatment given the pendulum in the Standards. Opportunities are thus lost for realizing the Standards' laudable goals for US science education. Finally, it is claimed that realizing these cultural goals for science education requires more routine incorporation of the history and philosophy of science into preservice and inservice courses for science teachers.     

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

Goldfarb and Hao (1990) have proposed a pivot rule for the primal network simplex algorithm that will solve a maximum flow problem on ann-vertex,m-arc network in at mostnm pivots and O(n ² m) time. In this paper we describe how to extend the dynamic tree data structure of Sleator and Tarjan (1983, 1985) to reduce the running time of this algorithm to O(nm logn). This bound is less than a logarithmic factor larger than those of the fastest known algorithms for the problem. Our extension of dynamic trees is interesting in its own right and may well have additional applications.Research partially supported by a Presidential Young Investigator Award from the National Science Foundation, Grant No. CCR-8858097, an IBM Faculty Development Award, and AT&T Bell Laboratories.Research partially supported by the Office of Naval Research, Contract No. N00014-87-K-0467.Research partially supported by the National Science Foundation, Grant No. DCR-8605961, and the Office of Naval Research, Contract No. N00014-87-K-0467.     

Algebras with Collapsing Monomials

A semigroup S is called collapsing if there exists a positiveinteger n such that for every subset of n elements in S, atleast two distinct words of length n on these letters are equalin S. In particular, S is collapsing whenever it satisfies alaw. Let U(A) denote the group of units of a unitary associativealgebra A over a field k of characteristic zero. If A is generatedby its nilpotent elements, then the following conditions areequivalent: U(A) is collapsing; U(A) satisfies some semigrouplaw; U(A) satisfies the Engel condition; U(A) is nilpotent;A is nilpotent when considered as a Lie algebra.     

Taylor-Galerkin algorithms for viscoelastic flow: Application to a model problem

Coupled and decoupled Taylor-Galerkin algorithms are considered for viscoelastic flow and a model problem—transient startup Poiseuille flow in a channel under a fixed pressure gradient. All algorithms reproduce the steady-state solutions and are stable at high elasticity numbers (E). For a fixed mesh, the coupled and decoupled versions (TGC and TGD) give exceptional time-accuracy at low elasticity numbers [to within O(1%) at E = 1] and reasonable accuracy at high elasticity numbers [to within O(10%) at E = 10, 100]. By definition, the decoupled false-transient scheme (TGF), which uses different time scales for velocity and stress time stepping, provides a poor transient history. Where the main requirement is to compute a steady-state algorithm efficiency is crucial. The TGF scheme attains a steady state between six to eight times faster than does the TGC scheme, and the latter is over twice as fast as the TGD form. © 1994 John Wiley & Sons, Inc.