Optimally Stable Multivariate Bases

We show that the tensor product B-spline basis and the triangular Bernstein basis are in some sense best conditioned among all nonnegative bases for the spaces of tensor product splines and multivariate polynomials, respectively. We also introduce some new condition numbers which are analogs of component-wise condition numbers for linear systems introduced by Skeel.     

On the Representation of Band-Dominant Functions on the Sphere Using Finitely Many Bits

A band-dominant function on the Euclidean sphere embedded in R ^q+1 is the restriction to this sphere of an entire function of q+1 complex variables having a finite exponential type in each of its variables. We develop a method to represent such a function using finitely many bits, using the values of the function at scattered sites on the sphere. The number of bits required in our representation is asymptotically the same as the metric entropy of the class of such functions with respect to any of the L ^p norms on the sphere.     

Zeros of functions with finite Dirichlet integral

In this paper, we refine a result of Nagel, Rudin, and Shapiro (1982) concerning the zeros of holomorphic functions on the unit disk with finite Dirichlet integral.

     

Allocating energy in a first-to-n match

This paper models a decision where a player must allocate limitedenergy over a contest of uncertain length. The motivating exampleis a squash match where one of the players is not as fit asthe other. Should a player's energy be concentrated in the earlygames of the match? Should it be spread evenly over all possiblegames? Or should it be conserved for the end of the match? Wemodel this as a decision problem where, in each game, the decision-makermust determine how much energy to expend. We assume that thereare only a small number of discrete energy choices for eachgame and that the more energy the decision-maker expends, themore likely he is to win that game. We solve for the optimaldecision with dynamic programming. With only two possible energychoices for each game, we show that it does not matter how energyis expended. In the case where there are three or more energychoices, we show how to take advantage of the structure of theproblem to determine the optimal sequence of decisions. As forpractical advice, the model suggests that when the decision-makerfalls behind in a match, he ought to switch to a more conservativeapproach by dividing his remaining energy evenly among all thepossible remaining games. Received 14 May 2003. Revised 5 January 2004.     

Numerical Modeling of Solitons in a Low Birefringent Optical Fiber

A numerical investigation, based on the split-step Fourier transform algorithm of all optical switching of solitons in a low birefringent optical fiber is presented. The numerical algorithm is described in detail. This revised version was published online in August 2006 with corrections to the Cover Date.     

Anisotropic giant magnetoresistance originating from the π-d interaction in a molecule

We synthesized TPP[Fe^III(Pc)(CN)₂]₂, PTMA_x[Fe^III(Pc)(CN)₂]·y(MeCN), and PXX [Fe^III(Pc)(CN)₂], a new series of charge-transfer salts containing the axially-substituted phthalocyanine (Pc), [Fe^III(Pc)(CN)₂]⁻. In this molecular unit, the π conduction electron derived from the Pc-ring coexists with the d electron which is a potential source of a local magnetic moment. Therefore various phenomena associated with the interplay between local magnetic moments and conduction electrons are expected. We observed the giant negative magnetoresistance (GNMR) in all the three salts. The GNMR is highly anisotropic for the magnetic-field direction, and reflects the g-tensor anisotropy of the local magnetic moment in the [Fe^III(Pc)(CN)₂]⁻ unit. This indicates that the GNMR in these salts originates from the strong π-d interaction in the [Fe^III(Pc)(CN)₂]⁻ unit.     

Phase Transitions in Traffic Models

It is suggested that the question of existence of a jamming phase transition in a broad class of single-lane cellular-automaton traffic models may be studied using a correspondence to the asymmetric chipping model. In models where such correspondence is applicable, jamming phase transition does not take place. Rather, the system exhibits a smooth crossover between free-flow and jammed states, as the car density is increased.     

Escape Through a Small Opening: Receptor Trafficking in a Synaptic Membrane

We model the motion of a receptor on the membrane surface of a synapse as free Brownian motion in a planar domain with intermittent trappings in and escapes out of corrals with narrow openings. We compute the mean confinement time of the Brownian particle in the asymptotic limit of a narrow opening and calculate the probability to exit through a given small opening, when the boundary contains more than one. Using this approach, it is possible to describe the Brownian motion of a random particle in an environment containing domains with small openings by a coarse grained diffusion process. We use the results to estimate the confinement time as a function of the parameters and also the time it takes for a diffusing receptor to be anchored at its final destination on the postsynaptic membrane, after it is inserted in the membrane. This approach provides a framework for the theoretical study of receptor trafficking on membranes. This process underlies synaptic plasticity, which relates to learning and memory. In particular, it is believed that the memory state in the brain is stored primarily in the pattern of synaptic weight values, which are controlled by neuronal activity. At a molecular level, the synaptic weight is determined by the number and properties of protein channels (receptors) on the synapse. The synaptic receptors are trafficked in and out of synapses by a diffusion process. Following their synthesis in the endoplasmic reticulum, receptors are trafficked to their postsynaptic sites on dendrites and axons. In this model the receptors are first inserted into the extrasynaptic plasma membrane and then random walk in and out of corrals through narrow openings on their way to their final destination.