Almost automorphic solutions to integral equations on the line

Given a∈L ¹(ℝ) and A the generator of an L ¹-integrable family of bounded and linear operators defined on a Banach space X, we prove the existence of almost automorphic solution to the semilinear integral equation u(t)=∫ _−∞ ^t a(t−s)[Au(s)+f(s,u(s))]ds for each f:ℝ×X→X almost automorphic in t, uniformly in x∈X, and satisfying diverse Lipschitz type conditions. In the scalar case, we prove that a∈L ¹(ℝ) positive, nonincreasing and log-convex is already sufficient.     

Approximation of the effective conductivity of ergodic media by periodization

 This paper is concerned with the approximation of the effective conductivity σ(A, μ) associated to an elliptic operator ∇ _xA (x,η)∇ _x where for xℝ ^d , d≥1, A(x,η) is a bounded elliptic random symmetric d×d matrix and η takes value in an ergodic probability space (X, μ). Writing A ^N (x, η) the periodization of A(x, η) on the torus T ^d _N of dimension d and side N we prove that for μ-almost all η

Reciprocal polynomials with all zeros on the unit circle

Let f(x)=a _d x ^d +a _d−1 x ^d−1+⋅⋅⋅+a ₀∈ℝ[x] be a reciprocal polynomial of degree d. We prove that if the coefficient vector (a _d ,a _d−1,…,a ₀) or (a _d−1,a _d−2,…,a ₁) is close enough, in the l ¹-distance, to the constant vector (b,b,…,b)∈ℝ ^d+1 or ℝ ^d−1, then all of its zeros have moduli 1.     

Multiple points of trajectories of multiparameter fractional Brownian motion

Consider 0<α<1 and the Gaussian process Y(t) on ℝ ^N with covariance E(Y(s)Y(t))=|t|^2α+|s|^2α−|t−s|^2α, where |t| is the Euclidean norm of t. Consider independent copies X ¹,…,X ^d of Y and␣the process X(t)=(X ¹(t),…,X ^d (t)) valued in ℝ ^d . When kN≤␣(k−1)αd, we show that the trajectories of X do not have k-multiple points. If N<αd and kN>(k−1)αd, the set of k-multiple points of the trajectories X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^{k N /α−( k −1) d} (loglog(1/ɛ)) ^k . If N=αd, we show that the set of k-multiple points of the trajectories of X is a countable union of sets of finite Hausdorff measure associated with the function ϕ(ɛ)=ɛ ^d (log(1/ɛ) logloglog 1/ɛ) ^k . (This includes the case k=1.) Received: 20 May 1997 / Revised version: 15 May 1998     

On polynomial symbols for subdivision schemes

Given a dilation matrix A :ℤ^d→ℤ^d, and G a complete set of coset representatives of 2π(A ^−Tℤ^d/ℤ^d), we consider polynomial solutions M to the equation ∑ _g∈G M(ξ+g)=1 with the constraints that M≥0 and M(0)=1. We prove that the full class of such functions can be generated using polynomial convolution kernels. Trigonometric polynomials of this type play an important role as symbols for interpolatory subdivision schemes. For isotropic dilation matrices, we use the method introduced to construct symbols for interpolatory subdivision schemes satisfying Strang–Fix conditions of arbitrary order. Research partially supported by the Danish Technical Science Foundation, Grant No. 9701481, and by the Danish SNF-PDE network.     

A simple map with no prime factors

An ergodic measure-preserving transformationT of a probability space is said to be simple (of order 2) if every ergodic joining λ ofT with itself is eitherμ×μ or an off-diagonal measureμ _S , i.e.,μ _S (A×B)=μ(A∩S ^;−n ;B) for some invertible, measure preservingS commuting withT. Veech proved that ifT is simple thenT is a group extension of any of its non-trivial factors. Here we construct an example of a weakly mixing simpleT which has no prime factors. This is achieved by constructing an action of the countable Abelian group ℤ⊕G, whereG=⊕ _i=1 ^∞ ℤ₂, such that the ℤ-subaction is simple and has centralizer coinciding with the full ℤ⊕G-action.     

Bounding the number of connected components of a real algebraic set

For every polynomial mapf=(f ₁,…,f _k): ℝ ⁿ →ℝ ^k , we consider the number of connected components of its zero set,B(Z _f) and two natural “measures of the complexity off,” that is the triple(n, k, d), d being equal to max(degree off _i), and thek-tuple (Δ₁,...,Δ₄), Δ _k being the Newton polyhedron off _i respectively. Our aim is to boundB(Z _f) by recursive functions of these measures of complexity. In particular, with respect to (n, k, d) we shall improve the well-known Milnor-Thom’s bound μ _d (n)=d(2d−1) ⁿ⁻¹. Considered as a polynomial ind, μ _d (n) has leading coefficient equal to 2 ⁿ⁻¹. We obtain a bound depending onn, d, andk such that ifn is sufficiently larger thank, then it improves μ _d (n) for everyd. In particular, it is asymptotically equal to 1/2(k+1)n ^k−1 dⁿ, ifk is fixed andn tends to infinity. The two bounds are obtained by a similar technique involving a slight modification of Milnor-Thom's argument, Smith's theory, and information about the sum of Betti numbers of complex complete intersections.     

Possible limit laws for entrance times of an ergodic aperiodic dynamical system

LetG denote the set of decreasingG: ℝ→ℝ withGэ1 on ]−∞,0], and ƒ ₀ ^∞ G(t)dt⩽1. LetX be a compact metric space, andT: X→X a continuous map. Let μ denone aT-invariant ergodic probability measure onX, and assume (X, T, μ) to be aperiodic. LetU⊂X be such that μ(U)>0. Let τ _U (x)=inf{k⩾1:T ^k xεU}, and defineG _U (t)=1/u(U)u({xεU:u(U)τU(x)>t),tεℝ We prove that for μ-a.e.x∈X, there exists a sequence (U _n ) _n≥1 of neighbourhoods ofx such that {x}=∩ _n U _n , and for anyG ∈G, there exists a subsequence (n _k ) _k≥1 withG _{U n k} ↑U weakly. We also construct a uniquely ergodic Toeplitz flowO(x ^∞,S, μ), the orbit closure of a Toeplitz sequencex ^∞, such that the above conclusion still holds, with moreover the requirement that eachU _n be a cylinder set. In memory of Anzelm Iwanik     

Substitution tilings and separated nets with similarities to the integer lattice

We show that any primitive substitution tiling of ℝ² creates a separated net which is biLipschitz to ℤ². Then we show that if H is a primitive Pisot substitution in ℝ ^d , for every separated net Y, that corresponds to some tiling τ ∈ X _H , there exists a bijection Φ between Y and the integer lattice such that sup _y∈Y ∥Φ(y) − y∥ < ∞. As a corollary, we get that we have such a Φ for any separated net that corresponds to a Penrose Tiling. The proofs rely on results of Laczkovich, and Burago and Kleiner.     

Sur le 2-groupe de classes d'idéaux de ℚ(√d,i)

Let ℕ,i=√−1,k=ℚ(√d,i) andC ₂ the 2-part of the class group ofk. Our goal is to determine alld such thatC ₂⋍ℤ/2ℤ×ℤ/2ℤ. Soientd∈ℕ,i=√−1,k=ℚ(√d,i), etC ₂ la 2-partie du groupe de classes dek. On s'intéresse à déterminer tous lesd tel queC ₂⋍ℤ/2ℤ×ℤ/2ℤ.      

Gradient algorithms for quadratic optimization with fast convergence rates

We propose a family of gradient algorithms for minimizing a quadratic function f(x)=(Ax,x)/2−(x,y) in ℝ ^d or a Hilbert space, with simple rules for choosing the step-size at each iteration. We show that when the step-sizes are generated by a dynamical system with ergodic distribution having the arcsine density on a subinterval of the spectrum of A, the asymptotic rate of convergence of the algorithm can approach the (tight) bound on the rate of convergence of a conjugate gradient algorithm stopped before d iterations, with d≤∞ the space dimension.     

Adjoints of semigroups acting on vector-valued function spaces

LetT(t) be the translation group onY=C ₀(ℝ×K)=C ₀(ℝ)⊗C(K),K compact Hausdorff, defined byT(t)f(x, y)=f(x+t, y). In this paper we give several representations of the sun-dialY ^⊙ corresponding to this group. Motivated by the solution of this problem, viz.Y ^⊙=L ¹(ℝ)⊗M(K), we develop a duality theorem for semigroups of the formT ₀(t)⊗id on tensor productsZ⊗X of Banach spaces, whereT ₀(t) is a semigroup onZ. Under appropriate compactness assumptions, depending on the kind of tensor product taken, we show that the sun-dial ofZ⊗X is given byZ ^⊙⊗X*. These results are applied to determine the sun-dials for semigroups induced on spaces of vector-valued functions, e.g.C ₀(Ω;X) andL ^p (μ;X). This paper was written during a half-year stay at the Centre for Mathematics and Computer Science CWI in Amsterdam. I am grateful to the CWI and the Dutch National Science Foundation NWO for financial support.     

Correlation structure of intermittency in the parabolic Anderson model

Consider the Cauchy problem ∂u(x, t)/∂t = ℋu(x, t) (x∈ℤ^d, t≥ 0) with initial condition u(x, 0) ≡ 1 and with ℋ the Anderson Hamiltonian ℋ = κΔ + ξ. Here Δ is the discrete Laplacian, κ∈ (0, ∞) is a diffusion constant, and ξ = {ξ(x): x∈ℤ ^d } is an i.i.d.random field taking values in ℝ. G?rtner and Molchanov (1990) have shown that if the law of ξ(0) is nondegenerate, then the solution u is asymptotically intermittent. In the present paper we study the structure of the intermittent peaks for the special case where the law of ξ(0) is (in the vicinity of) the double exponential Prob(ξ(0) > s) = exp[−e ^{s /θ}] (s∈ℝ). Here θ∈ (0, ∞) is a parameter that can be thought of as measuring the degree of disorder in the ξ-field. Our main result is that, for fixed x, y∈ℤ ^d and t→∈, the correlation coefficient of u(x, t) and u(y, t) converges to ∥w _ρ∥⁻² _ℓ2Σ_{z ∈ℤd} w _ρ(x+z)w _ρ(y+z). In this expression, ρ = θ/κ while w _ρ:ℤ^d→ℝ⁺ is given by w _ρ = (v _ρ)^{⊗ d} with v _ρ: ℤ→ℝ⁺ the unique centered ground state (i.e., the solution in ℓ²(ℤ) with minimal l ²-norm) of the 1-dimensional nonlinear equation Δv + 2ρv log v = 0. The uniqueness of the ground state is actually proved only for large ρ, but is conjectured to hold for any ρ∈ (0, ∞). empty It turns out that if the right tail of the law of ξ(0) is thicker (or thinner) than the double exponential, then the correlation coefficient of u(x, t) and u(y, t) converges to δ _{x, y} (resp.the constant function 1). Thus, the double exponential family is the critical class exhibiting a nondegenerate correlation structure. Received: 5 March 1997 / Revised version: 21 September 1998     

Asymptotic behavior of solutions to viscous conservation laws with slowly varying external forces

This paper considers the existence and large time behavior of solutions to the convection-diffusion equation u _t −Δu+b(x)·∇(u|u| ^{q −1})=f(x, t) in ℝ ⁿ ×[0,∞), where f(x, t) is slowly decaying and q≥1+1/n (or in some particular cases q≥1). The initial condition u ₀ is supposed to be in an appropriate L ^p space. Uniform and nonuniform decay of the solutions will be established depending on the data and the forcing term.This work is partially supported by an AMO Grant     

Invertibility and the fredholm property of difference operators

We obtain conditions for the invertibility and the Fredholm property of the difference operator (Dx)(n)=x(n) -U(n)x(n − 1),n ε ℤ, in the Banach space l _p (ℤ, X),p ε [1, ∞], of vector sequences, whereX is a Banach space andU is a bounded operator function. Translated fromMatematicheskie Zametki, Vol. 67, No. 6, pp. 816–827, June, 2000.     

Modules of vector fields,differential forms and degenerations of differential systems

We deal with (n−1)-generated modules of smooth (analytic, holomorphic) vector fieldsV=(X ₁,..., X_n−1) (codimension 1 differential systems) defined locally on ℝ ⁿ or ℂ ⁿ , and extend the standard duality(X ₁,..., X_n−1)↦(ω), ω=Ω(X₁,...,X_n−1,.,) (Ω−a volume form) betweenV′s and 1-generated modules of differential 1-forms (Pfaffian equations)—when the generatorsX _i are linearly independent—onto substantially wider classes of codimension 1 differential systems. We prove that two codimension 1 differential systemsV and are equivalent if and only if so are the corresponding Pfaffian equations (ω) and provided that ω has1-division property: ωΛμ=0, μ—any 1-form ⇒ μ=fω for certain function germf. The 1-division property of ω turns out to be equivalent to the following properties ofV: (a)fX∈V, f—not a 0-divisor function germ ⇒X∈V (thedivision property); (b) (V ^⊥)^⊥=V; (c)V ^⊥=(ω); (d) (ω)^⊥=V, where ⊥ denotes the passing from a module (of vector fields or differential 1-forms) to its annihilator. Supported by Polish KBN grant N^o 2 1090 91 01. Partially supported by the fund for the promotion of research at the Technion, 100–942.     

Joint ergodicity and mixing

The study of jointly ergodic measure preserving transformations of probability spaces, begun in [1], is continued, and notions of joint weak and strong mixing are introduced. Various properties of ergodic and mixing transformations are shown to admit analogues for several transformations. The case of endomorphisms of compact abelian groups is particularly emphasized. The main result is that, given such commuting endomorphisms σ₁σ₂,...,σ, ofG, the sequence ((1/N)Σ _n=0 ^N−1 σ ₁ ⁿ f ¹·σ ₂ ⁿ f ²· ··· · σ _s ⁿ f ^sconverges inL ²(G) for everyf ₁,f ₂,…,f _s∈L ^∞(G). If, moreover, the endomorphisms are jointly ergodic, i.e., if the limit of any sequence as above is Π _i=1 ^s ∫ _G f ₁ d μ, where μ is the Haar measure, then the convergence holds also μ-a.e.     

Order of a function on the Bruschlinsky group of a two-dimensional polyhedron

Homotopy classes of mappings of a compact polyhedron X to the circle T form an Abelian group B(X), which is called the Bruschlinsky group and is cananically isomorphic to H ¹ (X; ℤ), Let L be an Abelian group, and let f: B(X) → L be a function. One says that the order of f does not exceed r if for each mapping a: X → T the value f([a]) is ℤ-linearly expressed via the characteristic function I _r (a): (X × T) ^r → ℤ of (Γ _a ) ^r , where Γ _a ⊂ X × T is the graph of a. The (algebraic) degree of f is not greater than r if the finite differences of f of order r + 1 vanish. Conjecturally, the order of f is equal to the algebraic degree of f. The conjecture is proved in the case where dim X ≤ 2. Bibliography: 1 title.     

Construction of a class of multivariate compactly supported wavelet bases for L 2(? d )

In this paper, for a given d×d expansive matrix M with |detM| = 2, we investigate the compactly supported M-wavelets for L ²(ℝ ^d ). Starting with a pair of compactly supported refinable functions ϕ and [(j)\tilde]\tilde \varphi satisfying a mild condition, we obtain an explicit construction of a compactly supported wavelet ψ such that {2 ^j/2 ψ(M ^j · −k): j ∈ ℤ, k ∈ ℤd} forms a Riesz basis for L ²(ℝ ^d ). The (anti-)symmetry of such ψ is studied, and some examples are also provided.     

Measure concentration for a class of random processes

Summary.   Let X={X _i } _{i =−∞} ^∞ be a stationary random process with a countable alphabet and distribution q. Let q ^∞(·|x _{− k} ⁰) denote the conditional distribution of X ^∞=(X ₁,X ₂,…,X _n ,…) given the k-length past: