A Dual Approach to Constrained Interpolationfrom a Convex Subset of Hilbert Space

Many interesting and important problems of best approximationare included in (or can be reduced to) one of the followingtype: in a Hilbert spaceX, find the best approximationP_K(x) to anyxXfrom the setKC∩A⁻¹(b),whereCis a closed convex subset ofX,Ais a bounded linearoperator fromXinto a finite-dimensional Hilbert spaceY, andbY. The main point of this paper is to show thatP_K(x)isidenticaltoP_C(x+A*y)—the best approximationto a certain perturbationx+A*yofx—from the convexsetCor from a certain convex extremal subsetC_bofC. Thelatter best approximation is generally much easier to computethan the former. Prior to this, the result had been known onlyin the case of a convex cone or forspecialdata sets associatedwith a closed convex set. In fact, we give anintrinsic characterizationof those pairs of setsCandA⁻¹(b) for which this canalways be done. Finally, in many cases, the best approximationP_C(x+A*y) can be obtained numerically from existingalgorithms or from modifications to existing algorithms. Wegive such an algorithm and prove its convergence     

On the convergence of averaging Hermite interpolators

We investigate two sequences of polynomial operators, H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x), of degrees 2n − 2 and 2n − 3, respectively, defined by interpolatory conditions similar to those of the classical Hermite-Féjer interpolators H_{2n − 1}(f, x). If H_{2n − 2}(A₁,f; x) and H_{2n − 3}(A₂,f; x) are based on the zeros of the jacobi polynomials P_n^(α,β)(x), their convergence behaviour is similar to that of H_{2n − 1}(f;, x). If they are based on the zeros of (1 − x²)T_{n − 2}(x), their convergence behaviour is better, in some sense, than that of H_{2n − 1}(f, x).     

Universal entire functions with gap power series

Let be the family of all compact sets in which have connected complement. For K ε M we denote by A(K) the set of all functions which are continuous on K and holomorphic in its interior.Suppose that {z_n} is any unbounded sequence of complex numbers and let Q be a given sub-sequence of ₀.If Q has density Δ(Q) = 1 then there exists a universal entire function with lacunary power series

1. (1) (z) = ε^∞_{v = 0 v}Z^v, _v = 0 for v Q, which has for all K ε M the following properties simultaneously

2. (2) the sequence {(Z + Z_n)} is dense in A(K)

3. (3) the sequence { (ZZ_n)} is dense in A(K) if 0 K.

Also a converse result is proved: If is an entire function of the form (1) which satisfies (3), then Q must have maximal density Δ_max(Q) = 1.     

Best-possible bounds on sets of bivariate distribution functions

The fundamental best-possible bounds inequality for bivariate distribution functions with given margins is the Fréchet–Hoeffding inequality: If H denotes the joint distribution function of random variables X and Y whose margins are F and G, respectively, then max(0,F(x)+G(y)−1)H(x,y)min(F(x),G(y)) for all x,y in [−∞,∞]. In this paper we employ copulas and quasi-copulas to find similar best-possible bounds on arbitrary sets of bivariate distribution functions with given margins. As an application, we discuss bounds for a bivariate distribution function H with given margins F and G when the values of H are known at quartiles of X and Y.     

Matrices dont deux lignes quelconque coïncident dans un nombre donne de positions communes

Le nombre maximal de lignes de matrices seront désignées par:

1. (a) R(k, λ) si chaque ligne est une permutation de nombres 1, 2,…, k et si chaque deux lignes différentes coïncide selon λ positions;

2. (b) S⁰(k, λ) si le nombre de colonnes est k et si chaque deux lignes différentes coïncide selon λ positions et si, en plus, il existe une colonne avec les éléments y₁, y₂, y₃, ou y₁ = y₂ ≠ y₃;

3. (c) T⁰(k, λ) si c'est une (0, 1)-matrice et si chaque ligne contient k unités et si chaque deux lignes différentes contient les unités selon λ positions et si, en plus, il existe une colonne avec les éléments 1, 1, 0.

La fonction T⁰(k, λ) était introduite par Chvátal et dans les articles de Deza, Mullin, van Lint, Vanstone, on montrait que T⁰(k, λ) max(λ + 2, (k − λ)² + k − λ + 1). La fonction S⁰(k, λ) est introduite ici et dans le Théorème 1 elle est étudiée analogiquement; dans les remarques 4, 5, 6, 7 on donne les généralisations de problèmes concernant T⁰(k, λ), S⁰(k, λ), dans la remarque 9 on généralise le problème concernant R(k, λ). La fonction R(k, λ) était introduite et étudiée par Bolton. Ci-après, on montre que R(k, λ) S⁰(k, λ) T⁰(k, λ) d'où découle en particulier: R(k, λ) λ + 2 pour λ k + 1 − (k + 2)^1/2; R(k, λ) = 0(k²) pour k − λ = 0(k); R(k, λ) (k − 1)² − (k + 2) pour k 1191.     

Error bounds for multidimensional Laplace approximation

A numerical estimate is obtained for the error associated with the Laplace approximation of the double integral I(λ) = ∝∝_D g(x,y) e^−λf(x,y) dx dy, where D is a domain in , λ is a large positive parameter, f(x, y) and g(x, y) are real-valued and sufficiently smooth, and ∝(x, y) has an absolute minimum in D. The use of the estimate is illustrated by applying it to two realistic examples. The method used here applies also to higher dimensional integrals.     

A connection between a generalized Pascal matrix and the hypergeometric function

The n × n generalized Pascal matrix P(t) whose elements are related to the hypergeometric function ₂F₁(a, b; c; x) is presented and the Cholesky decomposition of P(t) is obtained. As a result, it is shown that

Full-size image

is the solution of the Gauss's hypergeometric differential equation,

x(1 − x)y″ + [1 + (a + b − 1)x]y′ − ABY = 0

. where a and b are any nonnegative integers. Moreover, a recurrence relation for generating the elements of P(t) is given.     

Initial Value Problems of the Sine-Gordon Equation and Geometric Solutions

Recent results using inverse scattering techniques interpret every solution φ(x, y) of the sine-Gordon equation as a nonlinear superposition of solutions along the axes x=0 and y=0. This has a well-known geometric interpretation, namely that every weakly regular surface of Gauss curvature K=−1, in arc length asymptotic line parametrization, is uniquely determined by the values φ(x, 0) and φ(0, y) of its coordinate angle along the axes. We introduce a generalized Weierstrass representation of pseudospherical surfaces that depends only on these values, and we explicitely construct the associated family of pseudospherical immersions corresponding to it.Mathematics Subject Classifications (2000): 53A10, 58E20.     

Boundedness of Riesz transforms for elliptic operators on abstract Wiener spaces

Let (E,H,μ) be an abstract Wiener space and let D_V:=VD, where D denotes the Malliavin derivative and V is a closed and densely defined operator from H into another Hilbert space . Given a bounded operator B on , coercive on the range , we consider the operators A:=V^*BV in H and in , as well as the realisations of the operators and in L^p(E,μ) and respectively, where 1<p<∞. Our main result asserts that the following four assertions are equivalent:

(1) with for ;

(2) admits a bounded H^∞-functional calculus on ;

(3) with for ;

(4) admits a bounded H^∞-functional calculus on .

Moreover, if these conditions are satisfied, then . The equivalence (1)–(4) is a non-symmetric generalisation of the classical Meyer inequalities of Malliavin calculus (where , V=I, ). A one-sided version of (1)–(4), giving L^p-boundedness of the Riesz transform in terms of a square function estimate, is also obtained. As an application let −A generate an analytic C₀-contraction semigroup on a Hilbert space H and let −L be the L^p-realisation of the generator of its second quantisation. Our results imply that two-sided bounds for the Riesz transform of L are equivalent with the Kato square root property for A. The boundedness of the Riesz transform is used to obtain an L^p-domain characterisation for the operator L.

Decompositions of complete graphs and complete bipartite graphs into isomorphic supersubdivision graphs

A graph H is called a supersubdivison of a graph G if H is obtained from G by replacing every edge uv of G by a complete bipartite graph K_2,m (m may vary for each edge) by identifying u and v with the two vertices in K_2,m that form one of the two partite sets. We denote the set of all such supersubdivision graphs by SS(G). Then, we prove the following results.

1. Each non-trivial connected graph G and each supersubdivision graph HSS(G) admits an α-valuation. Consequently, due to the results of Rosa (in: Theory of Graphs, International Symposium, Rome, July 1966, Gordon and Breach, New York, Dunod, Paris, 1967, p. 349) and El-Zanati and Vanden Eynden (J. Combin. Designs 4 (1996) 51), it follows that complete graphs K_2cq+1 and complete bipartite graphs K_mq,nq can be decomposed into edge disjoined copies of HSS(G), for all positive integers m,n and c, where q=|E(H)|.

2. Each connected graph G and each supersubdivision graph in SS(G) is strongly n-elegant, where n=|V(G)| and felicitous.

3. Each supersubdivision graph in EASS(G), the set of all even arbitrary supersubdivision graphs of any graph G, is cordial.

Further, we discuss a related open problem.     

Sharp inequalities for convolution-type operators

Let μ be a probability measure on [− a, a], a > 0, and let x₀ε[− a, a], f ε Cⁿ([−2a, 2a]), n 0 even. Using moment methods we derive best upper bounds to ¦∫_−a^a ([f(x₀ + y) + f(x₀ − y)]/2) μ(dy) − f(x₀)¦, leading to sharp inequalities that are attainable and involve the second modulus of continuity of f⁽ⁿ⁾ or an upper bound of it.     

Compact causal data interpolation

Consider a Hilbert space equipped with a time-structure, i.e., a resolution E of the identity on defined on subsets of some linearly ordered set Λ. For which x and y in is it possible to find a causal (time respecting) compact operator T, so that Tx = y? When T is required to be a Hilbert-Schmidt operator and (Λ, E) is sufficiently regular, this question is answered in terms of the “time-densities” of x and y. The condition is that the integral ∝_gLμ_x({s t})⁻¹ dμ_y(t) should be finite, where μ_x and μ_y are the measures on Λ given by μ_x(Ω) = ¦|E(Ω)x¦|² and μ_y(Ω) = ¦|E(Ω)y¦|². Further a solution is given for the related problem of minimizing the sum of ¦|Tx − y¦|² and the squared Hilbert-Schmidt norm ¦|R¦|₂² of T.     

Centres of Convex Sets inLMetrics

It is shown that for each convex bodyARⁿthere exists a naturally defined family _AC(Sⁿ⁻¹) such that for everyg _A, and every convex functionf: R→Rthe mappingy∫_Sⁿ⁻¹ f(g(x)−y, x) dσ(x) has a minimizer which belongs toA. As an application, approximation of convex bodies by balls with respect toL^pmetrics is discussed.     

Estimates of Freud-Christoffel functions for some weights with the whole real line as support

Upper and lower bounds for generalized Christoffel functions, called Freud-Christoffel functions, are obtained. These have the form λ_n,p(W,j,x) = infPW_Lp(R)/|P^(j)(X)| where the infimum is taken over all polynomials P(x) of degree at most n − 1. The upper and lower bounds for λ_n,p(W,j,x) are obtained for all 0 < p ∞ and J = 0, 1, 2, 3,… for weights W(x) = exp(−Q(x)), where, among other things, Q(x) is bounded in [− A, A], and Q″ is continuous in β(−A, A) for some A > 0. For p = ∞, the lower bounds give a simple proof of local and global Markov-Bernstein inequalities. For p = 2, the results remove some restrictions on Q in Freud's work. The weights considered include W(x) = exp(− ¦x¦^α/2), α > 0, and W(x) = exp(− exp(¦x¦)), > 0.     

Asymptotic shape of a random polytope in a convex body

Let K be an isotropic convex body in and let Z_q(K) be the L_q-centroid body of K. For every N>n consider the random polytope K_N:=conv{x₁,…,x_N} where x₁,…,x_N are independent random points, uniformly distributed in K. We prove that a random K_N is “asymptotically equivalent” to Z_[ln(N/n)](K) in the following sense: there exist absolute constants ρ₁,ρ₂>0 such that, for all and all NN(n,β), one has:

(i) K_Nc(β)Z_q(K) for every qρ₁ln(N/n), with probability greater than 1−c₁exp(−c₂N^1−βn^β).

(ii) For every qρ₂ln(N/n), the expected mean width of K_N is bounded by c₃w(Z_q(K)).

As an application we show that the volume radius |K_N|^1/n of a random K_N satisfies the bounds for all Nexp(n).

Characterizations of generalized quadrangles by generalized homologies

Let S = (P, B, I) be a generalized quadrangle of order (s, t). For x, y P, x y, let (x, y) be the group of all collineations of S fixing x and y linewise. If z {x, y}, then the set of all points incident with the line xz (resp. yz) is denoted by (resp. ). The generalized quadrangle S = (P, B, I) is said to be (x, y)-transitive, x y, if (x, y) is transitive on each set and . If S = (P, B, I) is a generalized quadrangle of order (s, t), s > 1 and t > 1, which is (x, y)-transitive for all x, y P with x y, then it is proved that we have one of the following: (i) S W(s), (ii) S Q(4, s), (iii) S H(4, s), (iv) S Q(5, s), (v) s = t² and all points are regular.     

Prophet regions and sharp inequalities for pth absolute moments of martingales

Exact comparisons are made relating E|Y₀|^p, E|Y_n−1|^p, and E(max_j≤n−1 |Y_j|^p), valid for all martingales Y₀,…,Y_n−1, for each p ≥ 1. Specifically, for p > 1, the set of ordered triples {(x, y, z) : X = E|Y₀|^p, Y = E |Y_n−1|^p, and Z = E(max_j≤n−1 |Y_j|^p) for some martingale Y₀,…,Y_n−1} is precisely the set {(x, y, z) : 0≤x≤y≤z≤Ψ_n,p(x, y)}, where Ψ_n,p(x, y) = xψ_n,p(y/x) if x > 0, and = a_n−1,py if x = 0; here ψ_n,p is a specific recursively defined function. The result yields families of sharp inequalities, such as E(max_j≤n−1 |Y_j|^p) + ψ_n,p^*(a) E |Y₀|^p ≤ aE |Y_n−1|^p, valid for all martingales Y₀,…,Y_n−1, where ψ_n,p^* is the concave conjugate function of ψ_n,p. Both the finite sequence and infinite sequence cases are developed. Proofs utilize moment theory, induction, conjugate function theory, and functional equation analysis.     

Some cardinal invariants on the space

Let C_α(X,Y) be the set of all continuous functions from X to Y endowed with the set-open topology where α is a hereditarily closed, compact network on X such that closed under finite unions. We define two properties (E1) and (E2) on the triple (α,X,Y) which yield new equalities and inequalities between some cardinal invariants on C_α(X,Y) and some cardinal invariants on the spaces X, Y such as: Theorem If Y is an equiconnected space with a base consisting of φ-convex sets, then for each fC(X,Y), χ(f,C_α(X,Y))=αa(X).w_e(f(X)).Corollary Let Y be a noncompact metric space and let the triple (α,X,Y) satisfy (E1). The following are equivalent:

(i) C_α(X,Y) is a first-countable space.

(ii) π-character of the space C_α(X,Y) is countable.

(iii) C_α(X,Y) is of pointwise countable type.

(iv) There exists a compact subset K of C_α(X,Y) such that π-character of K in the space C_α(X,Y) is countable.

(v) αa(X)₀.

(vi) C_α(X,Y) is metrizable.

(vii) C_α(X,Y) is a q-space.

(viii) There exists a sequence of nonempty open subset of C_α(X,Y) such that each sequence with g_nO_n for each nω, has a cluster point in C_α(X,Y).

Propriétés statistiques des entiers friables

Let Ψ(x,y) (resp. Ψ_m(x,y)) denote the number of integers not exceeding x that are y-friable, i.e. have no prime factor exceeding y (resp. and are coprime to m). Evaluating the ratio Ψ_m(x/d,y)/Ψ(x,y) for 1≤slantd≤slantx, m≥slant 1, x≥slant y≥slant 2, turns out to be a crucial step for estimating arithmetic sums over friable integers. Here, it is crucial to obtain formulae with a very wide range of validity. In this paper, several uniform estimates are provided for the aforementioned ratio, which supersede all previously known results. Applications are given to averages of various arithmetic functions over friable integers which in turn improve corresponding results from the literature. The technique employed rests mainly on the saddle-point method, which is an efficient and specific tool for the required design.2000 Mathematics Subject Classification: Primary—11N25; Secondary—11K65, 11N37