Generalized dimensions,entropies, and Liapunov exponents from the pressure function for strange sets

For conformal mixing repellers such as Julia sets and nonlinear one-dimensional Cantor sets, we connect the pressure of a smooth transformation on the repeller with its generalized dimensions, entropies, and Liapunov exponents computed with respect to a set of equilibrium Gibbs measures. This allows us to compute the pressure by means of simple numerical algorithms. Our results are then extended to axiom-A attractors and to a nonhyperbolic invariant set of the line. In this last case, we show that a first-order phase transition appears in the pressure.     

Optimal stopping,exponential utility,and linear programming

This paper uses linear programming to compute an optimal policy for a stopping problem whose utility function is exponential. This is done by transforming the problem into an equivalent one having additive utility and nonnegative (not necessarily substochastic) transition matrices.Research was supported by NSF Grant ENG 76-15599.     

An improved Mordell type bound for exponential sums

For a sparse polynomial , with and , we show that

thus improving upon a bound of Mordell. Analogous results are obtained for Laurent polynomials and for mixed exponential sums.

     

Prox-regular functions in Hilbert spaces

This paper studies the prox-regularity concept for functions in the general context of Hilbert space. In particular, a subdifferential characterization is established as well as several other properties. It is also shown that the Moreau envelopes of such functions are continuously differentiable.     

Stochastic nonlinear beam equations

An extensible beam equation with a stochastic force of a white noise type is studied, Lyapunov functions techniques being used to prove existence of global mild solutions and asymptotic stability of the zero solution.This research was supported in part by the GA R Grants no. 201/98/1454, 201/01/1197 and by a Royal Society grant     

Sums of Five Almost Equal Prime Squares

Let Pi, 1≤i≤5, be prime numbers. It is proved that every integer N that satisfies N=5 （mod 24） can be written as N=p1^2＋p2^2＋P3^2＋p4^2 ＋p5^2, where │√N5-Pi│≤N^1/2-19/850＋∈.     

On stability of some linear and nonlinear delay differential equations

New explicit conditions of exponential stability are obtained for the nonautonomous equation with several delays

     

Stability of steady states of the Cauchy problem for the exponential reaction-diffusion equation

We consider the Cauchy problem

     

Exponential synchronization of complex networks with nonidentical time-delayed dynamical nodes

In this Letter, exponential synchronization of a complex network with nonidentical time-delayed dynamical nodes is considered. Two effective control schemes are proposed to drive the network to synchronize globally exponentially onto any smooth goal dynamics. By applying open-loop control to all nodes and adding some intermittent controllers to partial nodes, some simple criteria for exponential synchronization of such network are established. Meanwhile, a pinning scheme deciding which nodes need to be pinned and a simply approximate formula for estimating the least number of pinned nodes are also provided. By introducing impulsive effects to the open-loop controlled network, another synchronization scheme is developed for the network with nonidentical time-delayed dynamical nodes, and an estimate of the upper bound of impulsive intervals ensuring global exponential stability of the synchronization process is also given. Numerical simulations are presented finally to demonstrate the effectiveness of the theoretical results.     

Recursions associated to trapezoid,symmetric and rotation symmetric functions over Galois fields

Rotation symmetric Boolean functions are invariant under circular translation of indices. These functions have very rich cryptographic properties and have been used in different cryptosystems. Recently, Thomas Cusick proved that exponential sums of rotation symmetric Boolean functions satisfy homogeneous linear recurrences with integer coefficients. In this work, a generalization of this result is proved over any Galois field. That is, exponential sums over Galois fields of some rotation symmetric polynomials satisfy linear recurrences with integer coefficients. In the particular case of ${\mathbb{F}}_2$, an elementary method is used to obtain explicit recurrences for exponential sums of some of these functions. The concept of trapezoid Boolean function is also introduced and it is showed that the linear recurrences that exponential sums of trapezoid Boolean functions satisfy are the same as the ones satisfied by exponential sums of the corresponding rotations symmetric Boolean functions. Finally, it is proved that exponential sums of trapezoid and symmetric polynomials also satisfy linear recurrences with integer coefficients over any Galois field ${\mathbb{F}}_q$. Moreover, the Discrete Fourier Transform matrix and some Complex Hadamard matrices appear as examples in some of our explicit formulas of these recurrences.