On almost sure convergence of amarts and martingales without the Radon-Nikodym property

It is shown here that for any Banach spaceE-valued amart (X _n) of classB, almost sure convergence off(X_n) tof(X) for eachf in a total subset ofE ^* implies scalar convergence toX.     

A counterexample in copositive approximation

The present paper gives a converse result by showing that there exists a functionf ∈C _[−1,1], which satisfies that sgn(x)f(x) ≥ 0 forx ∈ [−1, 1], such that {fx75-1} whereE _n ⁽⁰⁾ (f, 1) is the best approximation of degreen tof by polynomials which are copositive with it, that is, polynomialsP withP(x(f(x) ≥ 0 for allx ∈ [−1, 1],E _n(f) is the ordinary best polynomial approximation off of degreen.     

The law of the Euler scheme for stochastic differential equations

Summary We study the approximation problem ofE f(X _T ) byE f(X _T ⁿ ), where (X _t ) is the solution of a stochastic differential equation, (X _T ⁿ ) is defined by the Euler discretization scheme with stepT/n, andf is a given function. For smoothf's, Talay and Tubaro have shown that the errorE f(X _T ) –f(X _T ⁿ ) can be expanded in powers of 1/n, which permits to construct Romberg extrapolation precedures to accelerate the convergence rate. Here, we prove that the expansion exists also whenf is only supposed measurable and bounded, under an additional nondegeneracy condition of Hörmander type for the infinitesimal generator of (X _t ): to obtain this result, we use the stochastic variations calculus. In the second part of this work, we will consider the density of the law ofX _T ⁿ and compare it to the density of the law ofX _T .     

On best rational approximation of analytic functions

This paper contains some theorems related to the best approximation ρ_n(f;E) to a function f in the uniform metric on a compact set by rational functions of degree at most n. We obtain results characterizing the relationship between ρ_n(f;K) and ρ_n(f;E) in the case when complements of compact sets K and E are connected, K is a subset of the interior Ω of E, and f is analytic in Ω and continuous on E.     

Super magic strength of a graph

By G(p, q) we denote a graph having p vertices and q edges, by V and E the vertex set and edge set of G respectively. A graph G(p, q) is said to have an edge magic labeling (valuation) with the constant (magic number) c(f) if there exists a one-to-one and onto function f: V ∪ E → {1, 2, …., p + q} such that f(u)+f(v)+f(uv) = c(f) for all uv ∈ E. An edge magic labeling f of G is called a super magic labeling if f(E) ={1, 2, …., q}. In this paper the concepts of the super magic and super magic strength of a graph are introduced. The super magic strength (sms) of a graph G is defined as the minimum of all constants c′(f) where the minimum is taken over all super magic labeling of G and is denoted by sms(G). This minimum is defined only if the graph has at least one such super magic labeling. In this paper, the super magic strength of some well known graphs P _2n , P _2n+1, K _1,n , B _n,n , < K _1,n : 2 >, P _n ² and (2 _{n + 1})P ₂, C _n and W _n are obtained, where P _n is a path on n vertices, K _1,n is a star graph on n+1 vertices, n-bistar B _n,n is the graph obtained from two copies of K _1,n by joining the centres of two copies of K _1,n by an edge e, if e is subdivided then B _n,n becomes < K _1,n : 2 >, (2 _{n + 1}) P ₂ is 2 _{n + 1} disjoint copies of P ₂, P _n ² is a square graph of P _n . C _n is a cycle on n vertices and W _n = C _n + K ₁ is wheel on n + 1 vertices.     

Packing,covering and decomposing of a complete uniform hypergraph into delta-systems

Anh-uniform hypergraph generated by a set of edges {E ₁,...,E _c} is said to be a delta-system Δ(p,h,c) if there is ap-element setF such that ∇F|=p andE _i⌢E _j=F,∀i≠j. The main result of this paper says that givenp, h andc, there isn ₀ such that forn≥n ₀ the set of edges of a completeh-uniform hypergraphK _n ^h can be partitioned into subsets generating isomorphic delta-systems Δ(p, h, c) if and only if . This result is derived from a more general theorem in which the maximum number of delta-systems Δ(p, h, c) that can be packed intoK _n ^h and the minimum number of delta-systems Δ(p, h, c) that can cover the edges ofK _n ^h are determined for largen. Moreover, we prove a theorem on partitioning of the edge set ofK _n ^h into subsets generating small but not necessarily isomorphic delta-systems.     

Functions and line digraphs

Consider two maps f and g from a set E into a set F such that f(x) ≠ g(x) for every x in E. Suppose that there exists a positive integer n such that for any element z in F either f^?1(z) or g^?1(z) has at most n elements. Then, E can be partitioned into 2n + 1 subsets E₁, E₂,…,E_{2n + 1} such that f(E_i)∩ g(E_i) = ?, 1 ≤ i ≤ 2n + 1. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 296–303, 2003     

Asymptotic expansion formula for Bernstein polynomials defined on a simplex

In this paper we give a complete expansion formula for Bernstein polynomials defined on ans-dimensional simplex. This expansion for a smooth functionf represents the Bernstein polynomialB _n (f) as a combination of derivatives off plus an error term of orderO(n^–s ).Communicated by Wolfgang Dahmen.     

Stability theorems for projections of convex sets

LetH ^n?1 denote the set of all (n ? 1)-dimensional linear subspaces of euclideann-dimensional spaceE ⁿ (n≧3), and letJ andK be two compact convex subsets ofE ⁿ. It is well-known thatJ andK are translation equivalent (or homothetic) if for allH ∈H ^n?1 the respective orthogonal projections, sayJ _H, K_H, are translation equivalent (or homothetic). This fact gives rise to the following stability problem: Ifε≧0 is given, and if for everyH ∈H ^n?1 a translate (or homothetic copy) ofK _H is within Hausdorff distanceε ofJ _H, how close isJ to a nearest translate (or homothetic copy) ofK? In the case of translations it is shown that under the above assumptions there is always a translate ofK within Hausdorff distance (1 + 2√2)ε ofJ. Similar results for homothetic transformations are proved and applications regarding the stability of characterizations of centrally symmetric sets and spheres are given. Furthermore, it is shown that these results hold even ifH ^n?1 is replaced by a rather small (but explicitly specified) subset ofH ^n?1.     

Propertyf −1(S) =g −1(S) for entire and meromorphicP-adic functions

LetW be an algebraically closed filed of characteristic zero, letK be an algebraically closed field of characteristic zero, complete for an ultrametric absolute value, and letA(K) (resp. ℳ(K)) be the set of entire (resp. meromorphic) functions inK. For everyn≥7, we show that the setS _n(b) of zeros of the polynomialx ⁿ−b (b≠0) is such that, iff, g ∈W[x] or iff, g ∈A(K), satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), thenf ⁿ=g ⁿ. For everyn≥14, we show thatS _n(b) is such that iff, g ∈W({tx}) or iff, g ∈ ℳ(K) satisfyf ⁻¹(S _n(b))=g ⁻¹(S _n(b)), then eitherf ⁿ=g ⁿ, orfg is a constant. Analogous properties are true for complex entire and meromorphic functions withn≥8 andn≥15, respectively. For everyn≥9, we show that the setY _n(c) of zeros of the polynomial , (withc≠0 and 1) is an ursim ofn points forW[x], and forA(K). For everyn≥16, we show thatY _n(c) is an ursim ofn points forW(x), and for ℳ(K). We follow a method based on thep-adic Nevanlinna Theory and use certain improvement of a lemma obtained by Frank and Reinders.     

Nonparametric Approach for Non-Gaussian Vector Stationary Processes

Suppose that {z(t)} is a non-Gaussian vector stationary process with spectral density matrixf(λ). In this paper we consider the testing problemH: ∫^π_−π K{f(λ)} dλ=cagainstA: ∫^π_−π K{f(λ)} dλ≠c, whereK{·} is an appropriate function andcis a given constant. For this problem we propose a testT_nbased on ∫^π_−π K{f(λ)} dλ=c, wheref(λ) is a nonparametric spectral estimator off(λ), and we define an efficacy ofT_nunder a sequence of nonparametric contiguous alternatives. The efficacy usually depnds on the fourth-order cumulant spectraf₄^Zofz(t). If it does not depend onf₄^Z, we say thatT_nis non-Gaussian robust. We will give sufficient conditions forT_nto be non-Gaussian robust. Since our test setting is very wide we can apply the result to many problems in time series. We discuss interrelation analysis of the components of {z(t)} and eigenvalue analysis off(λ). The essential point of our approach is that we do not assume the parametric form off(λ). Also some numerical studies are given and they confirm the theoretical results.     

Relations between some constants associated with finite dimensional Banach spaces

We define the asymmetry constants(E) of a Banach spaceE, and show examples of finite-dimensional spaces with “large” asymmetry constants. IfE isn-dimensional,λ(E)17its projection constant and π ₁(I _E ) the absolutely summing norm of the identity operatorI _E , thenn≦λ(E)π₁(I _E )≤n(s(E))². Similar equations linking thep-absolutely summing and the nuclear norms ofI _E are established. We also obtain estimates on these norms, for example π₂(I _E )=√n. The contribution of this author is a part of a Ph.D. Thesis prepared at the Hebrew University of Jerusalem under the supervision of Professor J. Lindenstrauss whose guidance and valuable suggestions are gratefully acknowledged.     

On the order of growth of solutions of algebraic differential equations

Assume thatf is an integer transcendental solution of the differential equationP _n (z, f, f′)=P _n−1(z, f, f′, ... f ^(p)), whereP _n andP _n−1 are polynomials in all variables, the degree ofP _n with respect tof andf′ is equal ton, and the degree ofP _n−1 with respect tof, f′, ... f ^(p) is at mostn−1. We prove that the order ρ of growth off satisfies the relation 1/2≤ρ<∞. We also prove that if ρ=1/2, then, for a certain real ν, in the domain {z: ν<argz<ν+2π}/E _*, whereE _* is a certain set of disks with finite sum of radii, the estimate lnf(z)=z ^1/2 (β+o(1)), β∈C, holds forz=re ^iϕ,r≥r(ϕ)≥0. Furthermore, on the ray {z: argz=ν}, the following relation is true: ln‖f(re ^iν)‖=o(r ^1/2),r→+∞,r>0, , where Δ is a certain set on the semiaxisr>0 with mes Δ<∞. “L'vivs'ka Politekhnika” University, Lvov. Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 51, No. 1, pp. 69–77, January, 1999.     

On the maximum number of edges in a c4-free subgraph of qn

For the maximum number f(n) of edges in a C₄-free subgraph of the n-dimensional cube-graph Q_n we prove f(n) ≥ 1/2(n +√n)2^n?1 for n = 4^r, and f(n) ≥ 1/2(n +0.9√n)2^n?1 for all n ≥ 9. This disproves one version of a conjecture of P. Erdos. © 1995 John Wiley & Sons, Inc.     

Another Note on Polynomial vs Rational Approximation

LetEbe a subspace ofC(X) and letR(E)=g/h : g, hE; h>0}. We make a simple, yet intriguing observation: if zero is a best approximation toffromE, then zero is a best approximation toffromR(E). We also prove that if {E_n} is dense inC(X) then for almost allf(in the sense of category)[formula]That extends the results of P. Borwein and S. Zhou who proved it for the case whenE_nis the space of algebraic or trigonometric polynomials of degreen.     

On the convex hull of uniform random points in a simpled-polytope

Denote the expected number of facets and vertices and the expected volume of the convex hullP _n ofn random points, selected independently and uniformly from the interior of a simpled-polytope byE _n (f), E _n (v), andE _n (V), respectively. In this note we determine the sharp constants of the asymptotic expansion ofE _n (f), E _n (v), andE _n (V), asn tends to infinity. Further, some results concerning the expected shape ofP _n are given. The work of F. Affentranger was supported by the Swiss National Foundation.     

The center of the 3-dimensional and 4-dimensional Sklyanin algebras

LetA=A(E, ) denote either the 3-dimensional or 4-dimensional Sklyanin algebra associated to an elliptic curveE and a point E. Assume that the base field is algebraically closed, and that its characteristic does not divide the dimension ofA. It is known thatA is a finite module over its center if and only if is of finite order. Generators and defining relations for the centerZ(A) are given. IfS=Proj(Z(A)) andA is the sheaf ofO _S -algebras defined byA(S _(f))=A[f ^–1]₀ then the centerL ofA is described. For example, for the 3-dimensional Sklyanin algebra we obtain a new proof of M. Artin's result thatSpec L². However, for the 4-dimensional Sklyanin algebra there is not such a simple result: althoughSpec L is rational and normal, it is singular. We describe its singular locus, which is also the non-Azumaya locus ofA.     

Are the degrees of best (co)convex and unconstrained polynomial approximation the same?

Let ℂ[−1,1] be the space of continuous functions on [−,1], and denote by Δ² the set of convex functions f ∈ ℂ[−,1]. Also, let E _n (f) and E _n ⁽²⁾ (f) denote the degrees of best unconstrained and convex approximation of f ∈ Δ² by algebraic polynomials of degree < n, respectively. Clearly, En (f) ≦ E _n ⁽²⁾ (f), and Lorentz and Zeller proved that the inverse inequality E _n ⁽²⁾ (f) ≦ cE _n (f) is invalid even with the constant c = c(f) which depends on the function f ∈ Δ². In this paper we prove, for every α > 0 and function f ∈ Δ², that

Mappings of finite distortion: the degree of regularity

This paper investigates the self-improving integrability properties of the so-called mappings of finite distortion. Let K(x)1 be a measurable function defined on a domain ΩRⁿ, n2, and such that exp(βK(x))L_loc¹(Ω), β>0. We show that there exist two universal constants c₁(n),c₂(n) with the following property: Let f be a mapping in W_loc^1,1(Ω,Rⁿ) with |Df(x)|ⁿK(x)J(x,f) for a.e. xΩ and such that the Jacobian determinant J(x,f) is locally in L¹ log^−c₁(n)βL. Then automatically J(x,f) is locally in L¹ log^c₂(n)βL(Ω). This result constitutes the appropriate analog for the self-improving regularity of quasiregular mappings and clarifies many other interesting properties of mappings of finite distortion. Namely, we obtain novel results on the size of removable singularities for bounded mappings of finite distortion, and on the area distortion under this class of mappings.