Ergodic averages on circles

LetT ₁ andT ₂ be commuting invertible ergodic measure preserving flows on a probability space (X, A, μ). For t = (u,ν) ∈ ℝ², letT ^t =T ₁ ^u T ₂ ^v . LetS ¹ denote the unit circle in ℝ² and σ the rotation invariant unit measure on it. Then, forf∈Lp(X) withp>2, the averagesA _t f(x) = ∫ _s ¹ f(T ^ts x)σ(ds) conver the integral off for a. e.x, ast tends to 0 or infinity. This extends a result of R. Jones [J], who treated the case of three or more dimensions.     

The perfectB-splines and a time-optimal control problem

Letx _v =cos (πν/n) (v=0, 1, …,n). It is shown that theB-splineM(x)=M(x; x ₀ ,x ₁ ,…, x _n ) is such thatM _n ⁽ⁿ⁾ (x) has a constant absolute value (=2 ⁿ⁻² (n−1)!) in [−1, 1]. Its integralf ₀(x)=∫ ₋₁ ^x M(t)dt is shown to have an optimal property that allows to solveexplicitly a certain time-optimal control problem.     

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 η

Bispectrality of Multivariable Racah–Wilson Polynomials

We construct a commutative algebra A_x{\mathcal{A}}_{x} of difference operators in ℝ ^p , depending on p+3 parameters, which is diagonalized by the multivariable Racah polynomials R _p (n;x) considered by Tratnik (J. Math. Phys. 32(9):2337–2342, 1991). It is shown that for specific values of the variables x=(x ₁,x ₂,…,x _p ) there is a hidden duality between n and x. Analytic continuation allows us to construct another commutative algebra A_n{\mathcal{A}}_{n} in the variables n=(n ₁,n ₂,…,n _p ) which is also diagonalized by R _p (n;x). Thus, R _p (n;x) solve a multivariable discrete bispectral problem in the sense of Duistermaat and Grünbaum (Commun. Math. Phys. 103(2):177–240, 1986). Since a change of the variables and the parameters in the Racah polynomials gives the multivariable Wilson polynomials (Tratnik in J. Math. Phys. 32(8):2065–2073, 1991), this change of variables and parameters in A_x{\mathcal{A}}_{x} and A_n{\mathcal{A}}_{n} leads to bispectral commutative algebras for the multivariable Wilson polynomials.     

On quasi-similarity of subnormal operators

For a compact subset K in the complex plane, let Rat(K) denote the set of the rational functions with poles off K. Given a finite positive measure with support contained in K, let R2(K,v) denote the closure of Rat(K) in L2(v) and let Sv denote the operator of multiplication by the independent variable z on R2(K, v), that is, Svf = zf for every f∈R2(K, v). SupposeΩis a bounded open subset in the complex plane whose complement has finitely many components and suppose Rat(Ω) is dense in the Hardy space H2(Ω). Letσdenote a harmonic measure forΩ. In this work, we characterize all subnormal operators quasi-similar to Sσ, the operators of the multiplication by z on R2(Ω,σ). We show that for a given v supported onΩ, Sv is quasi-similar to Sσif and only if v/■Ω■σ and log(dv/dσ)∈L1(σ). Our result extends a well-known result of Clary on the unit disk.     

Convergence of a non-monotone scheme for Hamilton–Jacobi–Bellman equations with discontinous initial data

We prove the convergence of a non-monotonous scheme for a one-dimensional first order Hamilton–Jacobi–Bellman equation of the form v _t + max _α (f(x, α)v _x ) = 0, v(0, x) = v ₀(x). The scheme is related to the HJB-UltraBee scheme suggested in Bokanowski and Zidani (J Sci Comput 30(1):1–33, 2007). We show for general discontinuous initial data a first-order convergence of the scheme, in L ¹-norm, towards the viscosity solution. We also illustrate the non-diffusive behavior of the scheme on several numerical examples.     

On Group Chromatic Number of Graphs

Let G be a graph and A an Abelian group. Denote by F(G, A) the set of all functions from E(G) to A. Denote by D an orientation of E(G). For f ∈ F(G,A), an (A,f)-coloring of G under the orientation D is a function c : V(G)↦A such that for every directed edge uv from u to v, c(u)−c(v) ≠ f(uv). G is A-colorable under the orientation D if for any function f ∈ F(G, A), G has an (A, f)-coloring. It is known that A-colorability is independent of the choice of the orientation. The group chromatic number of a graph G is defined to be the least positive integer m for which G is A-colorable for any Abelian group A of order ≥m, and is denoted by χ_g(G). In this note we will prove the following results. (1) Let H₁ and H₂ be two subgraphs of G such that V(H₁)∩V(H₂)=∅ and V(H₁)∪V(H₂)=V(G). Then χ_g(G)≤min{max{χ_g(H₁), max_v∈V(H2)deg(v,G)+1},max{χ_g(H₂), max_u∈V(H1) deg (u, G) + 1}}. We also show that this bound is best possible. (2) If G is a simple graph without a K_3,3-minor, then χ_g(G)≤5.     

On the Local Distance between Arithmetical Distributions

We obtain upper and lower bounds for the local distance ρ(v _x , P _x ). Here v _x is the distribution of a set of strongly additive functions f _x with respect to the usual frequency on the set of positive integers, and P _x is the distribution of the sum of suitably chosen independent random variables. We only consider the case where f _x (p) ∈ {0, 1} for all primes p. __________ Translated from Lietuvos Matematikos Rinkinys, Vol. 45, No. 4, pp. 603–610, October–December, 2005.     

Maximum flows and minimum cuts in the plane

A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint ||(v ₁, v ₂)|| ≤ c(x, y). The dual problem finds a minimum cut ∂ S which is filled to capacity by the flow through it. This model problem has found increasing application in medical imaging, and the theory continues to develop (along with new algorithms). Remaining difficulties include explicit streamlines for the maximum flow, and constraints that are analogous to a directed graph.     

Permutation groups,simple groups,and sieve methods

We show that the number of integersn≤x which occur as indices of subgroups of nonabelian finite simple groups, excluding that ofA _n−1 inA _n , is ∼hx/logx, for some given constanth. This might be regarded as a noncommutative analogue of the Prime Number Theorem (which counts indicesn≤x of subgroups of abelian simple groups). We conclude that for most positive integersn, the only quasiprimitive permutation groups of degreen areS _n andA _n in their natural action. This extends a similar result for primitive permutation groups obtained by Cameron, Neumann and Teague in 1982. Our proof combines group-theoretic and number-theoretic methods. In particular, we use the classification of finite simple groups, and we also apply sieve methods to estimate the size of some interesting sets of primes. Research partially supported by the Australian Research Council for C.E.P. and by the Bi-National Science Foundation United States-Israel Grant 2000-053 for A.S.     

Hamiltonism and Partially Square Graphs

 Given a graph G, we define its partially square graph G ^* as the graph obtained by adding edges uv whenever the vertices u and v have a common neighbor x satisfying the condition N _G[x]⊆N _G[u]∪N _G [v], where N _G[x]=N _G(x)∪{x}. In particular, this condition is satisfied if x does not center a claw (an induced K _1,3). Obviously G⊆G ^*⊆G ², where G ² is the square of G. We prove that a k-connected graph (k≥2) G is hamiltonian if the independence number α(G ^*) of G ^* does not exceed k. If we replace G ^* by G we get a well known result of Chvátal and Erdo?s. If G is claw-free and G ^* is replaced by G ² then we obtain a result of Ainouche, Broersma and Veldman. Relationships between connectivity of G and independence number of G ^* for other hamiltonian properties are also given in this paper. Received: June 17, 1996 Revised: October 30, 1998     

Canonical form with respect to semiscalar equivalence for a matrix pencil with nonsingular first matrix

Polynomial n × n matrices A(x) and B(x) over a field \mathbbF \mathbb{F} are called semiscalar equivalent if there exist a nonsingular n × n matrix P over \mathbbF \mathbb{F} and an invertible n × n matrix Q(x) over \mathbbF \mathbb{F} [x] such that A(x) = PB(x)Q(x). We give a canonical form with respect to semiscalar equivalence for a matrix pencil A(x) = A _0x - A ₁, where A ₀ and A ₁ are n × n matrices over \mathbbF \mathbb{F} , and A ₀ is nonsingular.     

Rate of convergence for Szász-Bézier operators

We estimate the rate of convergence for functions of bounded variation for the Bézier variant of the Szász operators S _n,α (f,x). We study the rate of convergence of S _n,α (f,x) in the case 0 < α < 1. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 57, No. 12, pp. 1619–1624, December, 2005.     

Valuations on algebras with involution

Let A be a central simple algebra with involution σ of the first or second kind. Let v be a valuation on the σ-fixed part F of Z(A). A σ-special v-gauge g on A is a kind of value function on A extending v on F, such that g(σ(x)x) = 2g(x) for all x in A. It is shown (under certain restrictions if the residue characteristic is 2) that if v is Henselian, then there is a σ-special v-gauge g if and only if σ is anisotropic, and g is unique. If v is not Henselian, it is shown that there is a σ-special v-gauge g if and only if σ remains anisotropic after scalar extension from F to the Henselization of F with respect to v; when this occurs, g is the unique σ-invariant v-gauge on A.     

Positive linear operators generated by analytic functions

Let φ be a power series with positive Taylor coefficients {a _k } _k=0^∞ and non-zero radius of convergence r ≤ ∞. Let ξ _x , 0 ≤ x < r be a random variable whose values α _k , k = 0, 1, …, are independent of x and taken with probabilities a _k x ^k /φ(x), k = 0, 1, …. The positive linear operator (A _φ f)(x):= E[f(ξ _x )] is studied. It is proved that if E(ξ _x ) = x, E(ξ _x ²) = qx ² + bx + c, q, b, c ∈ R, q > 0, then A _φ reduces to the Szász-Mirakyan operator in the case q = 1, to the limit q-Bernstein operator in the case 0 < q < 1, and to a modification of the Lupaş operator in the case q > 1.     

Dense analytic subspaces in fractalL 2-spaces

We show that for certain self-similar measures μ with support in the interval 0≤x≤1, the analytic functions {e ^i2πnx :n=0,1,2, …} contain an orthonormal basis inL ² (μ). Moreover, we identify subsetsP ⊂ ℕ₀ = {0,1,2,...} such that the functions {e _n :n ∈ P} form an orthonormal basis forL ² (μ). We also give a higher-dimensional affine construction leading to self-similar measures μ with support in ℝ ^ν , obtained from a given expansivev-by-v matrix and a finite set of translation vectors. We show that the correspondingL ² (μ) has an orthonormal basis of exponentialse ^i2πλ·x , indexed by vectors λ in ℝ ^ν , provided certain geometric conditions (involving the Ruelle transfer operator) hold for the affine system. Work supported by the National Science Foundation.     

Stability of <Emphasis Type="Italic">C</Emphasis>-regularized Semigroups

Let T = (T(t))t≥0 be a bounded C-regularized semigroup generated by A on a Banach space X and R(C) be dense in X. We show that if there is a dense subspace Y of X such that for every x ∈ Y, σu(A, Cx), the set of all points λ ∈ iR to which (λ - A)^-1 Cx can not be extended holomorphically, is at most countable and σr(A) N iR = Ф, then T is stable. A stability result for the case of R(C) being non-dense is also given. Our results generalize the work on the stability of strongly continuous senfigroups.     

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     

An Exceptional Set in the Ergodic Theory of Expanding Maps on Manifolds

Under a general hypothesis an expanding map T of a Riemannian manifold M is known to preserve a measure equivalent to the Liouville measure on that manifold. As a consequence of this and Birkhoff’s pointwise ergodic theorem, the orbits of almost all points on the manifold are asymptotically distributed with regard to this Liouville measure. Let T be Lipschitz of class τ for some τ in (0,1], let Ω(x) denote the forward orbit closure of x and for a positive real number δ and let E(x₀, δ) denote the set of points x in M such that the distance from x₀ to Ω is at least δ. Let dim A denote the Hausdorff dimension of the set A. In this paper we prove a result which implies that there is a constant C(T) > 0 such that dimE(x₀,d) 3 dimM - \fracC(T)|logd| \dim E(x_0,\delta) \ge \dim M - \frac{C(T)}{\vert\!\log \delta \vert} if τ = 1 and dimE(x₀,d) 3 dimM - \fracC(T)log|logd|\dim E(x_0,\delta) \ge \dim M - \frac{C(T)}{\log \vert \log \delta \vert} if τ < 1. This gives a quantitative converse to the above asymptotic distribution phenomenon. The result we prove is of sufficient generality that a similar result for expanding hyperbolic rational maps of degree not less than two follows as a special case.     

Set vertex colorings and joins of graphs

For a nontrivial connected graph G, let c: V (G) → ℕ be a vertex coloring of G where adjacent vertices may be colored the same. For a vertex v of G, the neighborhood color set NC(v) is the set of colors of the neighbors of v. The coloring c is called a set coloring if NC(u) ≠ NC(v) for every pair u, v of adjacent vertices of G. The minimum number of colors required of such a coloring is called the set chromatic number x _s (G). A study is made of the set chromatic number of the join G+H of two graphs G and H. Sharp lower and upper bounds are established for x _s (G + H) in terms of x _s (G), x _s (H), and the clique numbers ω(G) and ω(H).