Extension of multilinear maps defined on subspaces

We study the problem of whether every multilinear form defined on the product of n closed subspaces has an extension defined on the product of the entire Banach spaces. We prove that the property derived from this condition (the Multilinear Extension Property) is local. We use this to prove that, for a wide variety of Banach spaces, there exist a product of closed subspaces and a multilinear form defined on it, which has no extension to the product of the entire spaces. We show that the ℓ _p spaces, with 1 ≤p ≤ ∞ and p ≠ 2, are among them and, more generally, every Banach space which fails to have type p for some p < 2 or cotype q for some q > 2.     

New models for locating a moving service facility

In this paper we analyze a new location problem which is a generalization of the well-known single facility location model. This extension consists of introducing a general objective function and replacing fixed locations by trajectories. We prove that the problem is well-stated and solvable. A Weiszfeld type algorithm is proposed to solve this generalized dynamic single facility location problem on L ^p spaces of functions, with p ∈(1,2]. We prove global convergence of our algorithm once we have assumed that the set of demand functions and the initial step function belong to a subspace of L ^p called Sobolev space. Finally, examples are included illustrating the application of the model to generalized regression analysis and the convergence of the proposed algorithm. The examples also show that the pointwise extension of the algorithm does not have to converge to an optimal solution of the considered problem while the proposed algorithm does.     

Refinable Functions with Exponential Decay: An?Approach via Cascade Algorithms

Refinable functions with exponential decay arise from applications such as the Butterworth filters in signal processing. Refinable functions with exponential decay also play an important role in the study of Riesz bases of wavelets generated from multiresolution analysis. A fundamental problem is whether the standard solution of a refinement equation with an exponentially decaying mask has exponential decay. We investigate this fundamental problem by considering cascade algorithms in weighted L _p spaces (1≤p≤∞). We give some sufficient conditions for the cascade algorithm associated with an exponentially decaying mask to converge in weighted L _p spaces. Consequently, we prove that the refinable functions associated with the Butterworth filters are continuous functions with exponential decay. By analyzing spectral properties of the transition operator associated with an exponentially decaying mask, we find a characterization for the corresponding refinable function to lie in weighted L ₂ spaces. The general theory is applied to an interesting example of bivariate refinable functions with exponential decay, which can be viewed as an extension of the Butterworth filters.     

The Fermat—Weber location problem revisited

The Fermat—Weber location problem requires finding a point in ^N that minimizes the sum of weighted Euclidean distances tom given points. A one-point iterative method was first introduced by Weiszfeld in 1937 to solve this problem. Since then several research articles have been published on the method and generalizations thereof. Global convergence of Weiszfeld's algorithm was proven in a seminal paper by Kuhn in 1973. However, since them given points are singular points of the iteration functions, convergence is conditional on none of the iterates coinciding with one of the given points. In addressing this problem, Kuhn concluded that whenever them given points are not collinear, Weiszfeld's algorithm will converge to the unique optimal solution except for a denumerable set of starting points. As late as 1989, Chandrasekaran and Tamir demonstrated with counter-examples that convergence may not occur for continuous sets of starting points when the given points are contained in an affine subspace of ^N . We resolve this open question by proving that Weiszfeld's algorithm converges to the unique optimal solution for all but a denumerable set of starting points if, and only if, the convex hull of the given points is of dimensionN.     

Geometric Optimization Problems Likely Not Contained in $$\mathbb{A}\mathbb{P}\mathbb{X}$$

   Abstract. Maximizing geometric functionals such as the classical l _p -norms over polytopes plays an important role in many applications, hence it is desirable to know how efficiently the solutions can be computed or at least approximated. While the maximum of the l _∞ -norm over polytopes can be computed in polynomial time, for 2≤ p < ∞ the l _p -norm-maxima cannot be computed in polynomial time within a factor of 1.090 , unless P=NP. This result holds even if the polytopes are centrally symmetric parallelotopes. Quadratic Programming is a problem closely related to norm-maximization, in that in addition to a polytope P ⊂ R ⁿ , numbers c _ij , 1≤ i≤ j≤ n , are given and the goal is to maximize Σ _{1≤ i≤ j≤ n} c _ij x _i x _j over P . It is known that Quadratic Programming does not admit polynomial-time approximation within a constant factor, unless P=NP. Using the observation that the latter result remains true even if the existence of an integral optimal point is guaranteed, in this paper it is proved that analogous inapproximability results hold for computing the l _p -norm-maximum and various l _p -radii of centrally symmetric polytopes for 2≤ p < ∞.     

Geometric Optimization Problems Likely Not Contained in APX

Abstract. Maximizing geometric functionals such as the classical l _p -norms over polytopes plays an important role in many applications, hence it is desirable to know how efficiently the solutions can be computed or at least approximated. While the maximum of the l _∞ -norm over polytopes can be computed in polynomial time, for 2≤ p < ∞ the l _p -norm-maxima cannot be computed in polynomial time within a factor of 1.090 , unless P=NP. This result holds even if the polytopes are centrally symmetric parallelotopes. Quadratic Programming is a problem closely related to norm-maximization, in that in addition to a polytope P ⊂ R ⁿ , numbers c _ij , 1≤ i≤ j≤ n , are given and the goal is to maximize Σ _{1≤ i≤ j≤ n} c _ij x _i x _j over P . It is known that Quadratic Programming does not admit polynomial-time approximation within a constant factor, unless P=NP. Using the observation that the latter result remains true even if the existence of an integral optimal point is guaranteed, in this paper it is proved that analogous inapproximability results hold for computing the l _p -norm-maximum and various l _p -radii of centrally symmetric polytopes for 2≤ p < ∞.     

Fourier multipliers and spectral measures in Banach function spaces

It is classical that amongst all spaces L^p (G), 1 ≤ p ≤ ∞, for , or say, only L² (G) (that is, p = 2) has the property that every bounded Borel function on the dual group Γ determines a bounded Fourier multiplier operator in L² (G). Stone’s theorem asserts that there exists a regular, projection-valued measure (of operators on L² (G)), defined on the Borel sets of Γ, with Fourier-Stieltjes transform equal to the group of translation operators on L² (G); this fails for every p ≠ 2. We show that this special status of L² (G) amongst the spaces L^p (G), 1 ≤ p ≤ ∞, is actually more widespread; it continues to hold in a much larger class of Banach function spaces defined over G (relative to Haar measure).      

The Geodesic Problem in Quasimetric Spaces

In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality d(x,y)≤σ(d(x,z)+d(z,y)) for some constant σ≥1, rather than the usual triangle inequality. Such a space is called a quasimetric space. We show that many well-known results in metric spaces (e.g. Ascoli-Arzelà theorem) still hold in quasimetric spaces. Moreover, we explore conditions under which a quasimetric will induce an intrinsic metric. As an example, we introduce a family of quasimetrics on the space of atomic probability measures. The associated intrinsic metrics induced by these quasimetrics coincide with the d _α metric studied early in the study of branching structures arisen in ramified optimal transportation. An optimal transport path between two atomic probability measures typically has a “tree shaped” branching structure. Here, we show that these optimal transport paths turn out to be geodesics in these intrinsic metric spaces. This work is supported by an NSF grant DMS-0710714.     

Extension of algorithm list scheduling for a semi-online scheduling problem

A general algorithm, called ALG, for online and semi-online scheduling problem Pm||C _max with m ≥ 2 is introduced. For the semi-online version, it is supposed that all job have their processing times within the interval [p, rp], where p > 0,1 < r ≤ m/m − 1. ALG is a generalization of LS and is optimal in the sense that there is not an algorithm with smaller competitive ratio than that of ALG.     

A Hardy-type inequality and its applications

We prove a Hardy-type inequality that provides a lower bound for the integral ∫₀^∞|f(r)| ^p r ^p−1 dr, p > 1. In the scale of classical Hardy inequalities, this integral corresponds to the value of the exponential parameter for which neither direct nor inverse Hardy inequalities hold. However, the problem of estimating this integral and its multidimensional generalization from below arises in some practical questions. These are, for example, the question of solvability of elliptic equations in the scale of Sobolev spaces in the whole Euclidean space ℝ ⁿ , some questions in the theory of Sobolev spaces, hydrodynamic problems, etc. These questions are studied in the present paper.     

Test elements for endomorphisms of free groups and algebras

LetE be a bounded Borel subset of ℝⁿ,n≥2, of positive Lebesgue measure andP _E the corresponding ‘Pompeiu transform”. We prove thatP _E is injective onL ^p(ℝⁿ) if 1≤p≤2n/(n-1). We explore the connection between this problem and a Wiener-Tauberian type theorem for theM(n) action onL ^q(ℝⁿ) for various values ofq. We also take up the question of whenP _E is injective in caseE is of finite, positive measure, but is not necessarily a bounded set. Finally, we briefly look at these questions in the contexts of symmetric spaces of compact and non-compact type.     

An upper bound on the approximation power of principal shift-invariant spaces

An upper bound on theL _p-approximation power (1 ≤p ≤ ∞) provided by principal shift-invariant spaces is derived with only very mild assumptions on the generator. It applies to both stationary and nonstationary ladders, and is shown to apply to spaces generated by (exponential) box splines, polyharmonic splines, multiquadrics, and Gauss kernel.     

COEFFICIENT MULTIPLIERS ON MIXED NORM SPACES

§1　IntroductionSuppose thatf is analytic in the open unit disc D in the complex plane.We defineMp(r,f) =12π∫2π0 | f(reiθ) | pdθ1 / p,0

相似文献   

Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm

In this paper we give a new convergence analysis of a projective scaling algorithm. We consider a long-step affine scaling algorithm applied to a homogeneous linear programming problem obtained from the original linear programming problem. This algorithm takes a fixed fraction λ≤2/3 of the way towards the boundary of the nonnegative orthant at each iteration. The iteration sequence for the original problem is obtained by pulling back the homogeneous iterates onto the original feasible region with a conical projection, which generates the same search direction as the original projective scaling algorithm at each iterate. The recent convergence results for the long-step affine scaling algorithm by the authors are applied to this algorithm to obtain some convergence results on the projective scaling algorithm. Specifically, we will show (i) polynomiality of the algorithm with complexities of O(nL) and O(n ² L) iterations for λ<2/3 and λ=2/3, respectively; (ii) global covnergence of the algorithm when the optimal face is unbounded; (iii) convergence of the primal iterates to a relative interior point of the optimal face; (iv) convergence of the dual estimates to the analytic center of the dual optimal face; and (v) convergence of the reduction rate of the objective function value to 1−λ.     

Well-posedness of equations with fractional derivative

We study the well-posedness of the equations with fractional derivative D^αu（t） = Au（t） ＋ f（t）,0≤ t ≤ 2π, where A is a closed operator in a Banach space X, α 〉 0 and D^α is the fractional derivative in the sense of Weyl. Using known results on LP-multipliers, we give necessary and/or sufficient conditions for the LP-well-posedness of this problem. The conditions we give involve the resolvent of A and the Rademacher boundedness. Corresponding results on the well-posedness of this problem in periodic Besov spaces, periodic Triebel-Lizorkin spaces and periodic Hardy spaces are also obtained.     

A remark on the behaviour ofL p-multipliers and the range of operators acting onL p-spaces

In this paper, new results are obtained concerning the uniform approximation property (UAP) inL ^p-spaces (p≠2,1,∞). First, it is shown that the “uniform approximation function” does not allow a polynomial estimate. This fact is rather surprising since it disproves the analogy between UAP-features and the presence of “large” euclidian subspaces in the space and its dual. The examples are translation invariant spaces on the Cantor group and this extra structure permits one to replace the problem with statements about the nonexistence of certain multipliers in harmonic analysis. Secondly, it is proved that the UAP-function has an exponential upper estimate (this was known forp=1, ∞). The argument uses Schauder’s fix point theorem. Its precise behaviour is left unclarified here. It appears as a difficult question, even in the translation invariant context.     

Coefficient multipliers of mixed norm space in the ball

In the paper, we characterize the coefficient multiplier spaces of mixed norm spaces (H _p,q (φ₁), H _u,v (φ₂)) for the values of p, q, u, v in three cases: (i) 0 < p ≤ u ≤ ∞, 0 < q ≤ min(1, v) ≤ ∞. (ii) v = ∞, 0 < p ≤ u ≤ ∞, 1 ≤ u, q ≤ ∞. (iii) 1 ≤ v ≤ 2 ≤ q ≤ ∞, and 0 < p ≤ u ≤ ∞ or 1 ≤ p, u ≤ ∞. The first case extends the result of Blasco, Jevtić, and Pavlović in one variable. The third case generalizes partly the results of Jevtić, Jovanović, and Wojtaszczyk to higher dimensions. Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

Almost simple groups with socle 3D4(q) act on finite linear spaces

After the classification of flag-transitive linear spaces, attention has now turned to line-transitive linear spaces. Such spaces are first divided into the point-imprimitive and the point-primitive, the first class is usually easy by the theorem of Delandtsheer and Doyen. The primitive ones are now subdivided, according to the O’Nan-Scotte theorem and some further work by Camina, into the socles which are an elementary abelian or non-abelian simple. In this paper, we consider the latter. Namely, T ≤ G ≤ Aut(T) and G acts line-transitively on finite linear spaces, where T is a non-abelian simple. We obtain some useful lemmas. In particular, we prove that when T is isomorphic to ³ D ₄(q), then T is line-transitive, where q is a power of the prime p.     

On the maximal operator of (<Emphasis Type="Italic">C</Emphasis>, α)-means of Walsh–Kaczmarz–Fourier series

Simon [J. Approxim. Theory, 127, 39–60 (2004)] proved that the maximal operator σ^α,κ,* of the (C, α)-means of the Walsh–Kaczmarz–Fourier series is bounded from the martingale Hardy space H _p to the space L _p for p > 1 / (1 + α), 0 < α ≤ 1. Recently, Gát and Goginava have proved that this boundedness result does not hold if p ≤ 1 / (1 + α). However, in the endpoint case p = 1 / (1 + α ), the maximal operator σ^α,κ,* is bounded from the martingale Hardy space H _1/(1+α) to the space weak- L _1/(1+α). The main aim of this paper is to prove a stronger result, namely, that, for any 0 < p ≤ 1 / (1 + α), there exists a martingale f ∈ H _p such that the maximal operator σ^α,κ,* f does not belong to the space L _p .     

Bicolored Matchings in Some Classes of Graphs

We consider the problem of finding in a graph a set R of edges to be colored in red so that there are maximum matchings having some prescribed numbers of red edges. For regular bipartite graphs with n nodes on each side, we give sufficient conditions for the existence of a set R with |R|=n+1 such that perfect matchings with k red edges exist for all k,0≤k≤n. Given two integers p<q we also determine the minimum cardinality of a set R of red edges such that there are perfect matchings with p red edges and with q red edges. For 3-regular bipartite graphs, we show that if p≤4 there is a set R with |R|=p for which perfect matchings M_k exist with |M_k∩R|≤k for all k≤p. For trees we design a linear time algorithm to determine a minimum set R of red edges such that there exist maximum matchings with k red edges for the largest possible number of values of k.