Single chain force spectroscopy - Reading the sequence of HP protein models

We study the elastic properties of single A/B random copolymer chains, with a specific sequence and use them as theoretical model for so called HP proteins. HP proteins carry hydrophilic (P) and hydrophobic (H) monomers. We predict a rich structure in the force-extension relations which can be attributed to the information in the sequence. The variational method is used to probe local minima on the path of stretching and releasing for the chain molecules. At a given force, we find multiple configurations which are separated by energy barriers. A collapsed globular configuration consists of several domains which unravel cooperatively. Upon stretching, the unfolding path shows a stepwise pattern corresponding to the unfolding of each domain. While releasing, several cores can be created simultaneously in the middle of the chain, resulting in a different path of collapse. The long-range interactions and stiffness of the chain simplify the potential landscape given by the disorder in sequence. Received 5 March 2002 / Received in final form 16 May 2002 Published online 13 August 2002     

Two classes of piecewise-linear difference equations with eventual periodicity three

In this paper, we will study two classes of difference equations which are piecewise-linear and of similar forms. We will show that all nontrivial solutions of one equation are eventually periodic with prime period three. We will show this result for one case of the second equation.     

Tangent cones and Dini derivatives

We prove a property of the Bouligand tangent cone to the epigraph (or to the graph) of a locally Lipschitz function. It is also shown how this result can be used in determining Dini sequences. Finally, some relationships between such a cone and Dini derivatives are provided.     

含k-次增生算子的Ishikawa迭代的收敛性问题

主要研究了非线性方程x Tx=f的Ishikawa迭代解．其中T为k-次增生的或增生的，并在一致光滑和任意的实Banach空间分别研究了上述方程的带误差的Ishikawa迭代解，从而推广了已知的一些结果。     

Simple Constructions of Almost k-wise Independent Random Variables

We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in the sample space is (2 + o(1)) (log log n + k/2 + log k + log 1/?), where ? is the statistical difference between the distribution induced on any k bit locations and the uniform distribution. This is asymptotically comparable to the construction recently presented by Naor and Naor (our size bound is better as long as ? < 1/(k log n)). An additional advantage of our constructions is their simplicity.     

Sigma function solution of the initial value problem for Somos 5 sequences

The Somos 5 sequences are a family of sequences defined by a fifth order bilinear recurrence relation with constant coefficients. For particular choices of coefficients and initial data, integer sequences arise. By making the connection with a second order nonlinear mapping with a first integral, we prove that the two subsequences of odd/even index terms each satisfy a Somos 4 (fourth order) recurrence. This leads directly to the explicit solution of the initial value problem for the Somos 5 sequences in terms of the Weierstrass sigma function for an associated elliptic curve.

     

Randomized UMD Banach spaces and decoupling inequalities for stochastic integrals

In this paper we prove the equivalence of decoupling inequalities for stochastic integrals and one-sided randomized versions of the UMD property of a Banach space as introduced by Garling.

     

On two--block--factor sequences and one--dependence

The distributions of two--block--factors arising from i.i.d. sequences are observed to coincide with the distributions of the superdiagonals of jointly exchangeable and dissociated arrays . An inequality for superdiagonal probabilities of the arrays is presented. It provides, together with the observation, a simple proof of the fact that a special one--dependent Markov sequence of Aaronson, Gilat and Keane (1992) is not a two--block factor.

     

Rare numbers

Suppose thatX ₁,X ₂,... is a sequence of iid random variables taking values inZ ⁺. Consider the random sequenceA(X)(X ₁,X ₂,...). LetY _n be the number of integers which appear exactly once in the firstn terms ofA(X). We investigate the limit behavior ofn ^–(1–) Y _n for [0, 1].