Physical Sciences and Mathematics Commons^™

The Centrality Of Mathematics In The History Of Western Thought, Judith V. Grabiner

Pitzer Faculty Publications and Research

This article explores the interplay of mathematics and philosophy in Western thought as well as applications to other fields.

Multiple Solutions For A Dirichlet Problem With Jumping Nonlinearities Ii, Alfonso Castro, Ratnasingham Shivaji

All HMC Faculty Publications and Research

No abstract provided for this article.

Stability Of Steady Cross-Waves: Theory And Experiment, Seth Lichter, Andrew J. Bernoff

All HMC Faculty Publications and Research

A bifurcation analysis is performed in the neighborhood of neutral stability for cross waves as a function of forcing, detuning, and viscous damping. A transition is seen from a subcritical to a supercritical bifurcation at a critical value of the detuning. The predicted hysteretic behavior is observed experimentally. A similarity scaling in the inviscid limit is also predicted. The experimentally observed bifurcation curves agree with this scaling.

Nonnegative Solutions For A Class Of Nonpositone Problems, Alfonso Castro, Ratnasingham Shivaji

All HMC Faculty Publications and Research

In the recent past many results have been established on non-negative solutions to boundary value problems of the form

-u''(x) = λf(u(x)); 0 < x < 1,

u(0) = 0 = u(1)

where λ>0, f(0)>0 (positone problems). In this paper we consider the impact on the non-negative solutions when f(0)<0. We find that we need f(u) to be convex to guarantee uniqueness of positive solutions, and f(u) to be appropriately concave for multiple positive solutions. This is in contrast to the case of positone problems, where the roles of convexity and concavity were interchanged to obtain similar results. We further establish the existence of non-negative solutions with interior zeros, which did not exist in positone problems.

Reliable Computation By Formulas In The Presence Of Noise, Nicholas Pippenger

All HMC Faculty Publications and Research

It is shown that if formulas are used to compute Boolean functions in the presence of randomly occurring failures then: (1) there is a limit strictly less than 1/2 to the failure probability per gate that can be tolerated, and (2) formulas that tolerate failures must be deeper (and, therefore, compute more slowly) than those that do not. The heart of the proof is an information-theoretic argument that deals with computation and errors in very general terms. The strength of this argument is that it applies with equal ease no matter what types of gate are available. Its weaknesses is …