Analysis on Besov spaces II: Embedding and duality theorems

This paper gives several results on Besov spaces of holomorphic functions on a very large class of domains D in Cn. They include duality theorem, embedding theorem, best growth estimate, and boundedness of multiplication operators on Besov spaces.     

Local existence and blow-up criterion for the Euler equations in Besov spaces of weak type

We introduce Besov type function spaces, based on the weak L ^p -spaces instead of the standard L ^p -spaces, and prove a local-in-time unique existence and a blow-up criterion of solutions in those spaces for the Euler equations of perfect incompressible fluid in . For the proof, we establish the Beale-Kato-Majda type logarithmic inequality and commutator type estimates in our weak spaces. Abbreviate title: Euler equations in Besov spaces of weak type     

Approximation by means of nonlinear Kantorovich sampling type operators in Orlicz spaces

In this paper we introduce a nonlinear version of the Kantorovich sampling type series in a nonuniform setting. By means of the above series we are able to reconstruct signals (functions) which are continuous or uniformly continuous. Moreover, we study the problem of the convergence in the setting of Orlicz spaces: this allows us to treat signals which are not necessarily continuous. Our theory applies to L^p-spaces, interpolation spaces, exponential spaces and many others. Several graphical examples are provided.     

On the stability index for weighted composition operators

Let ?>0. A continuous linear operator T:C(X)?C(Y) is said to ?-preserve disjointness if ‖(Tf)(Tg)‖_∞≤?, whenever f,g∈C(X) satisfy ‖f‖_∞=‖g‖_∞=1 and fg≡0. In this paper we continue our study of the minimal interval where the possible maximal distance from a norm one operator which ?-preserves disjointness to the set of weighted composition maps may lie. We provide sharp bounds for both the finite and the infinite case, which turn out to be completely different.     

N–Term Approximation in Anisotropic Function Spaces

In L₂(0, 1)²) infinitely many different biorthogonal wavelet bases may be introduced by taking tensor products of one–dimensional biorthogonal wavelet bases on the interval (0, 1). Most well–known are the standard tensor product bases and the hyperbolic bases. In [23, 24] further biorthogonal wavelet bases are introduced, which provide wavelet characterizations for functions in anisotropic Besov spaces. Here we address the following question: Which of those biorthogonal tensor product wavelet bases is the most appropriate one for approximating nonlinearly functions from anisotropic Besov spaces? It turns out, that the hyperbolic bases lead to nonlinear algorithms which converge as fast as the corresponding schemes with respect to specific anisotropy adapted bases.     

On the spectral characterization of some unicyclic graphs

Let H(n;q,n₁,n₂) be a graph with n vertices containing a cycle C_q and two hanging paths P_n1 and P_n2 attached at the same vertex of the cycle. In this paper, we prove that except for the A-cospectral graphs H(12;6,1,5) and H(12;8,2,2), no two non-isomorphic graphs of the form H(n;q,n₁,n₂) are A-cospectral. It is proved that all graphs H(n;q,n₁,n₂) are determined by their L-spectra. And all graphs H(n;q,n₁,n₂) are proved to be determined by their Q-spectra, except for graphs with a being a positive even number and with b≥4 being an even number. Moreover, the Q-cospectral graphs with these two exceptions are given.     

Improved algorithms for path partition and related problems

We study the L_∞ path partition problem: given a path of n weighted vertices and an integer k, remove k−1 edges from the path so that the maximum absolute deviation of the weights of the resulting k sub-paths from their mean is minimized. Previously, the best algorithm solves this problem in O(nklogk) time. We present an O(nk) time algorithm. We also give improved solutions for two related problems: the L_d path partition problem and the web proxies placement problem.     

Embeddings of anisotropic Besov spaces into Sobolev spaces

We study the embeddings of (homogeneous and inhomogeneous) anisotropic Besov spaces associated to an expansive matrix A into Sobolev spaces, with a focus on the influence of A on the embedding behavior. For a large range of parameters, we derive sharp characterizations of embeddings.     

Fixed points of asymptotically regular semigroups in Banach spaces

In this paper we study in Banach spaces the existence of fixed points of (nonlinear) asymptotically regular semigroups. We establish for these semigroups some fixed point theorems in spaces with weak uniform normal structure, in a Hilbert space, inL ^p spaces, in Hardy spacesH ^p and in Sobolev spacesW ^r.p for 1<p<∞ andr≥0, in spaces with Lifshitz’s constant greater than one. These results are the generalizations of [8, 10, 16].     

On the complexity of the independent set problem in triangle graphs

We consider the complexity of the maximum (maximum weight) independent set problem within triangle graphs, i.e., graphs G satisfying the following triangle condition: for every maximal independent set I in G and every edge uv in G−I, there is a vertex w∈I such that {u,v,w} is a triangle in G. We also introduce a new graph parameter (the upper independent neighborhood number) and the corresponding upper independent neighborhood set problem. We show that for triangle graphs the new parameter is equal to the independence number. We prove that the problems under consideration are NP-complete, even for some restricted subclasses of triangle graphs, and provide several polynomially solvable cases for these problems within triangle graphs. Furthermore, we show that, for general triangle graphs, the maximum independent set problem and the upper independent neighborhood set problem cannot be polynomially approximated within any fixed constant factor greater than one unless P=NP.     

The order of hypotraceable oriented graphs

A digraph of order n is hypotraceable if it is nontraceable but all its induced subdigraphs of order n−1 are traceable. Grötschel et al. (1980) [M. Grötschel, C. Thomassen, Y. Wakabayashi, Hypotraceable digraphs, J. Graph Theory 4 (1980) 377–381] constructed an infinite family of hypotraceable oriented graphs, the smallest of which has order 13. We show that there exist hypotraceable oriented graphs of order n for every n≥8 except possibly for n=9,11 and that is the only one of order less than 8.Furthermore, we determine all the hypotraceable oriented graphs of order 8 and explain the relevance of these results to the problem of determining, for given k≥2, the maximum order of nontraceable oriented digraphs each of whose induced subdigraphs of order k is traceable.     

Inner functions as improving multipliers

If X⊂Y are two classes of analytic functions in the unit disk D and θ is an inner function, θ is said to be (X,Y)-improving, if every function f∈X satisfying fθ∈Y must actually satisfy fθ∈X. This notion has been recently introduced by K.M. Dyakonov. In this paper we study the (X,Y)-improving inner functions for several pairs of spaces (X,Y). In particular, we prove that for any p∈(0,1) the (Qp,BMOA)-improving inner functions and the (Qp,B)-improving inner functions are precisely the inner functions which belong to the space Qp. Here, B is the Bloch space. We also improve some results of Dyakonov on the subject regarding Lipschitz spaces and Besov spaces.     

The natural rearrangement invariant structure on tensor products

We prove that the only rearrangement invariant (r.i.) spaces for which there exists a crossnorm verifying that the tensor product of these spaces preserves the “natural” r.i. space structure, in the sense that it makes the multiplication operator B a topological isomorphism, are the Lp spaces.     

On the demand pooling anomaly in inventory theory

The demand pooling anomaly of inventory theory of type F amounts to a kind of restricted order relation between the individual demands (assumed to be independent) and their average. In this paper, we present some sufficient conditions for the type F anomaly not to occur for two i.i.d. demands; furthermore we provide an asymptotic result showing whether this anomaly occurs for large n for a class of distributions containing all distributions with finite mean.     

Zero location and asymptotic behavior for extremal polynomials with non-diagonal Sobolev norms

In this paper we are going to study the zero location and asymptotic behavior of extremal polynomials with respect to a non-diagonal Sobolev norm in the worst case, i.e., when the quadratic form is allowed to degenerate. The orthogonal polynomials with respect to this Sobolev norm are a particular case of those extremal polynomials. The multiplication operator by the independent variable is the main tool in order to obtain our results.     

B-Products of Besov type spaces and some applications

The paper derives a representation of classical Besov zero spaces by means of the so called B-products of the generalized Besov type zero spaces, generated by completely regular polyhedrons. Peetre K-functional is estimated and an interpolation formula of “real method” is proved for pairs of B-products. Some applications of these results are given.     

A Class of Operators on Weighted Bergman Spaces

This paper studies the connection between an analytic function φ on the unit disk and a certain type of operators induced by φ on weighted Bergman spaces A ^α of analytic functions on . The general theme is the interplay between smoothness conditions on φ and the S _p -norms of the operators induced by φ.      

Interpolation on Sparse Grids and Tensor Products of Nikol'skij–Besov Spaces

We investigate the order of convergence of periodic interpolation on sparse grids (blending interpolation) in the framework of tensor products of Nikol'skij–Besov spaces. To this end, we make use of the uniformity of the considered tensor norms and provide a unified approach to error estimates for the interpolation of univariate periodic functions from Nikol'skij–Besov spaces.     

A note on the generalized min-sum set cover problem

In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin (STOC 2009). Bansal, Gupta, and Krishnaswamy (SODA 2010) give a 485-approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-approximation algorithm, improving the performance guarantee by an order of magnitude. We use concepts from α-point scheduling to obtain our improvements.     

Best N Term Approximation Spaces for Tensor Product Wavelet Bases

We consider best N term approximation using anisotropic tensor product wavelet bases ("sparse grids"). We introduce a tensor product structure ⊗_q on certain quasi-Banach spaces. We prove that the approximation spaces A^α_q(L₂) and A^α_q(H¹) equal tensor products of Besov spaces B^α_q(L_q), e.g., A^α_q(L₂([0,1]^d)) = B^α_q(L_q([0,1])) ⊗_q · ⊗_q B^α_{q · ·}(L_q([0,1])). Solutions to elliptic partial differential equations on polygonal/polyhedral domains belong to these new scales of Besov spaces.