Algebraic independence of Mahler functions

Suppose that f₁, ?, f_mf_1, \ldots , f_m satisfy functional equations of type¶¶ f_i(z^d) = P_i(z, f_i(z))     or     f_i(z) = P_i(z, f_i(z^d))f_i({z^d}) = P_i(z, f_i(z)) \quad {or} \quad f_i(z) = P_i(z, f_i({z^d})) ¶for i = 1, ?, mi = 1, \ldots , m, an integer d > 1 and polynomials P_i ? \Bbb C (z)[ y]P_i \in \Bbb C (z)[ {y}] with pairwise distinct partial degrees deg_y( P₁), ?, deg_y( P_m)\deg _y( {P_1}), \ldots , \deg _y( {P_m}). Generalizing a result of Keiji Nishioka and using an idea of Kumiko Nishioka we show, that f₁, ?, f_mf_1, \ldots , f_m can only be algebraically dependent over \Bbb C (z)\Bbb C (z), if there is an index k ? { 1, ?, m}\kappa \in \{ {1, \ldots , m}\} such that f_kf_{\kappa } is rational.     

On generalized shift bases for the wiener disc algebra

LetW(D) denote the set of functionsf(z)=Σ _n=0 ^∞ A _n Z ⁿ a _nzⁿ for which Σ_n=0 ^∞|a _n |<+∞. Given any finite set lcub;f _i (z)rcub; _i=1 ⁿ inW(D) the following are equivalent: (i) The generalized shift sequence lcub;f ₁(z)z ^kn ,f ₂(z)z ^kn+1, …,f _n (z)z ^(k+1)n−1rcub; _k=0 ^∞ is a basis forW(D) which is equivalent to the basis lcub;z ^m rcub; _m=0 ^∞ . (ii) The generalized shift sequence is complete inW(D), (iii) The function has no zero in |z|≦1, wherew=e ^2πiti /n.     

Asymptotic Behavior of Sobolev-Type Orthogonal Polynomials on the Unit Circle

We study the asymptotic behavior of the sequence of polynomials orthogonal with respect to the discrete Sobolev inner product on the unit circle

Full-size image

where f(Z)=(f(z₁), …, f^(l₁)(z₁), …, f(z_m), …, f^(l_m)(z_m)), A is a M×M positive definite matrix or a positive semidefinite diagonal block matrix, M=l₁+…+l_m+m, dμ belongs to a certain class of measures, and |z_i|>1, i=1, 2, …, m.     

Isometric Equivalence of Integration Operators

We are interested in the isometric equivalence problem for the Cesàro operator C(f) (z) = \frac1z ò₀^zf(x) \frac11-xd x{C(f) (z) =\frac{1}{z} \int_{0}^{z}f(\xi) \frac{1}{1-\xi}d \xi} and an operator T_g(f)(z)=\frac1zò₀^zf(x) g^￠(x) d x{T_{g}(f)(z)=\frac{1}{z}\int_{0}^{z}f(\xi) g^{\prime}(\xi) d \xi}, where g is an analytic function on the disc, on the Hardy and Bergman spaces. Then we generalize this to the isometric equivalence problem of two operators T_g1{T_{g_{1}}} and T_g2{T_{g_{2}}} on the Hardy space and Bergman space. We show that the operators T_g1{T_{g_{1}}} and T_g2{T_{g_{2}}} satisfy T_g1U₁=U₂T_g2{T_{g_{1}}U_{1}=U_{2}T_{g_{2}}} on H ^p , 1 ≤ p < ∞, p ≠ 2 if and only if g₂(z) = lg₁(e^iqz){g_{2}(z) =\lambda g_{1}(e^{i\theta}z) }, where λ is a modulus one constant and U _i , i = 1, 2 are surjective isometries of the Hardy Space. This is analogous to the Campbell-Wright result on isometrically equivalence of composition operators on the Hardy space.     

On Classes of Functions Related to Starlike Functions with Respect to Symmetric Conjugate Points Defined by a Fractional Differential Operator

Let A denote the class of analytic functions f, in the open unit disk E = {z : |z| < 1}, normalized by f(0) = f′(0) − 1 = 0. In this paper, we introduce and study the class ST^n,a_l,m(h){ST^{n,\alpha}_{\lambda,m}(h)} of functions f ? A{f\in A}, with \fracD^n,a_l f_m(z)z 1 0{\frac{D^{n,\alpha}_\lambda f_m(z)}{z}\neq 0}, satisfying

Coin flipping from a cosmic source: On error correction of truly random bits

We study a problem related to coin flipping, coding theory, and noise sensitivity. Consider a source of truly random bits x ∈ {0, 1}ⁿ, and k parties, who have noisy version of the source bits yⁱ ∈ {0, 1}ⁿ, when for all i and j, it holds that P [y = x_j] = 1 ? ?, independently for all i and j. That is, each party sees each bit correctly with probability 1 ? ?, and incorrectly (flipped) with probability ?, independently for all bits and all parties. The parties, who cannot communicate, wish to agree beforehand on balanced functions f_i: {0, 1}ⁿ → {0, 1} such that P [f₁(y¹) = … = f_k(y^k)] is maximized. In other words, each party wants to toss a fair coin so that the probability that all parties have the same coin is maximized. The function f_i may be thought of as an error correcting procedure for the source x. When k = 2,3, no error correction is possible, as the optimal protocol is given by f_i(yⁱ) = y. On the other hand, for large values of k, better protocols exist. We study general properties of the optimal protocols and the asymptotic behavior of the problem with respect to k, n, and ?. Our analysis uses tools from probability, discrete Fourier analysis, convexity, and discrete symmetrization. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2005     

Eigenvalue Intervals for 2mth Order Sturm—Liouville Boundary Value Problems

Values of λ are determined for which there exist positive solutions of the 2mth order differential equation on a measure chain, (-1)^m x ^?2m (t)=λa(t)f(u(σ(t))), y? [0,1], satisfying α _i+1 u ^?21(0)+0, γ _i+1 u ^?21(σ(1))=0, 0≤i≤m?1 with αi,βi,γi,δi≥0, where a and f are positive valued, and both lim _x-0+ (f(x)/x) and lim _x-0+ (f(x)/x) exist.     

Buffons Nadelproblem und verwandte probleme behandelt mit der Theorie der Gleichverteilung: Teil II

We denote with PC ^m the m-dimensional complex projective space, with U the unitary group acting on it with z _i(j=0, 1,..., m) the homogenous coordinates of a point [z] of PC ^m and assume that the z _i are normalized such that z ₀z₀ +...+z _mz_m=1. Furthermore we denote the U-invariant metric on PC ^m with d. We consider now a uniformly distributed sequence ([z] _k ; k=1,2,...) of points on PC ^m and study the sequence (d ^l([z] _k , [z]₀)), l0, [z]₀ a fixed point. We prove with the help of the theory of uniform distribution properties of this sequence. We consider furthermore a dual sequence suggested by the theory of H. Weyl and L. V. Ahlfors on meromorphic curves.     

Limit distributions of U-statistics resampled by symmetric stable laws

Summary If (Y _i) and (V _i) are independent random sequences such thatY _i are i.i.d. random variables belonging to the normal domain of attraction of a symmetric -stable law, 0<<2, andV _i are i.i.d. random variables, then the limit distributions of U-statistics , coincide with the probability laws of multiple stochastic integralsX ^d f = ... f (t ₁, ... ,t _d)dX(t _d) with respect to a symmetric -stable processX(t).The research was originated during author's visit at ORIE, Cornell University     

Learning Functions of Few Arbitrary Linear Parameters in High Dimensions

Let us assume that f is a continuous function defined on the unit ball of ℝ ^d , of the form f(x)=g(Ax), where A is a k×d matrix and g is a function of k variables for k≪d. We are given a budget m∈ℕ of possible point evaluations f(x _i ), i=1,…,m, of f, which we are allowed to query in order to construct a uniform approximating function. Under certain smoothness and variation assumptions on the function g, and an arbitrary choice of the matrix A, we present in this paper

Exponential convergence in probability for empirical means of Lévy processes

Let （Xt）t≥0 be a Lévy process taking values in R^d with absolutely continuous marginal distributions. Given a real measurable function f on R^d in Kato＇s class, we show that the empirical mean 1/t ∫ f（Xs）ds converges to a constant z in probability with an exponential rate if and only if f has a uniform mean z. This result improves a classical result of Kahane et al. and generalizes a similar result of L. Wu from the Brownian Motion to general Lévy processes.     

Multidimensional analog of the Hardy condition for power series

In the middle of the 20th century Hardy obtained a condition which must be imposed on a formal power series f(x) with positive coefficients in order that the series f ⁻¹(x) = $ \sum\limits_{n = 0}^\infty {b_n x^n } $ \sum\limits_{n = 0}^\infty {b_n x^n } b _n x ⁿ be such that b ₀ > 0 and b _n ≤ 0, n ≥ 1. In this paper we find conditions which must be imposed on a multidimensional series f(x ₁, x ₂, …, x _m ) with positive coefficients in order that the series f ⁻¹(x ₁, x ₂, …, x _m ) = $ \sum i_1 ,i_2 , \ldots ,i_m \geqslant 0^b i_1 ,i_2 , \ldots ,i_m ^{x_1^{i_1 } x_2^{i_2 } \ldots x_m^{i_m } } $ \sum i_1 ,i_2 , \ldots ,i_m \geqslant 0^b i_1 ,i_2 , \ldots ,i_m ^{x_1^{i_1 } x_2^{i_2 } \ldots x_m^{i_m } } satisfies the property b _{0, …, 0} > 0, $ bi_1 ,i_2 , \ldots ,i_m $ bi_1 ,i_2 , \ldots ,i_m ≤ 0, i ₁² + i ₂² + … + i _m ² > 0, which is similar to the one-dimensional case.     

Multidimensional Oscillations for Non-linear Hyperbolic Mixed Problem: The Justified Non-linear Geometric Optics Method

The mixed-Neumann problem for the non-linear wave equation □u−a(u)(∣∂_tu)∣²−∣∇u∣² = f_ε(z) is studied. The function f_ε(z) = ∑_k∈Kf_k(z,ε⁻¹ϕ_k(z),ε), ε∈[0,1], K is finite, f_k(z,θ_k,ε) are 2π-periodic with respect to θ_k. The existence of solution u_ε on a domain z = (t,x,y)∈[0,T]×ℝ₊×ℝ^d, d = 1 or 2, is proved when ε is sufficiently small; T does not depend on ε. By the non-linear geometric optics method the asymptotic (with respect to ε→0) solution ũ _ε is constructed. The estimation for the rest ε²r_ε = u_ε−ũ_ε is derived and the limit r_ε, ε→0, is studied.     

A fast and simple algorithm for the computation of Legendre coefficients

We present an O(N log N){\mathcal{O}({N\,{\rm log}\,N})} algorithm for the calculation of the first N coefficients in an expansion of an analytic function in Legendre polynomials. In essence, the algorithm consists of an integration of a suitably weighted function along an ellipse, a task which can be accomplished with Fast Fourier Transform, followed by some post-processing. The mathematical underpinning of this algorithm is an old formula that expresses expansion coefficients [^(f)]_m{\hat{f}_m} as infinite linear combinations of derivatives. We evaluate the latter with the Cauchy theorem, thereby expressing each [^(f)]_m{\hat{f}_m} as a scaled integral of f(z)j_m(z)/z^m+1{f(z)\varphi_m(z)/z^{m+1}} along an appropriate contour, where j_m{\varphi_m} is a slowly converging hypergeometric function. Next, we transform j_m{\varphi_m} into another hypergeometric function which converges rapidly. Once we replace the latter function by its truncated Taylor expansion and choose an appropriate elliptic contour, we obtain an expression for the [^(f)]_m{\hat{f}_m}s which is amenable to rapid computation.     

Distance-Regular Graph with <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript> > 1 and <Emphasis Type="Italic">a</Emphasis><Subscript>1</Subscript> = 0 < <Emphasis Type="Italic">a</Emphasis><Subscript>2</Subscript>

Let Γ be a distance-regular graph of diameter d ≥ 3 with c ₂ > 1. Let m be an integer with 1 ≤ m ≤ d − 1. We consider the following conditions:

The homology and cohomology of the complements to some arrangements of codimension two complex planes

We consider the homology and cohomology of the complement to the arrangement Z = ∪_{1<|i−j|<d−1}{z _i = z _j = 0} of coordinate planes in ℂ ^d , and explicitly construct a basis for these groups as well as a basis for the homology groups of the one-point compactification of Z.     

Extraction of subsystems “Majorized” by the rademacher system

In this paper it is proved that from any uniformly bounded orthonormal system {f _n} _n=1 ^∞ of random variables defined on the probability space (Ω, ε, P), one can extract a subsystem {fni} _i ^{Emphasis>=1/∞} majorized in distribution by the Rademacher system on [0, 1]. This means that {

On the Fine Structure of Stationary Measures in Systems Which Contract-on-Average

Suppose {f ₁,...,f _m } is a set of Lipschitz maps of ^d . We form the iterated function system (IFS) by independently choosing the maps so that the map f _i is chosen with probability p _i ( ^m _i=1 p _i =1). We assume that the IFS contracts on average. We give an upper bound for the upper Hausdorff dimension of the invariant measure induced on ^d and as a corollary show that the measure will be singular if the modulus of the entropy _i p _i log p _i is less than d times the modulus of the Lyapunov exponent of the system. Using a version of Shannon's Theorem for random walks on semigroups we improve this estimate and show that it is actually attainable for certain cases of affine mappings of .     

The Vector QD Algorithm for Smooth Functions (f, f′)

We deal with the functionz(f(z), f′(z)) wheref(z)=∑_i0 a_izⁱ, (a_i ) with lim_i→∞ a_i+1×a_i−1/(a_i)²=q. We investigate the convergence of the vector QD algorithm. We give the asymptotic behaviour of the generalized Hankel determinants. A convergence result on the vector orthogonal polynomials is proved.