Approximation results for the weighted partition problem

We present several new standard and differential approximation results for the P₄-partition problem using the Hassin and Rubinstein algorithm [Information Processing Letters 63 (1997) 63–67]. Those results concern both minimization and maximization versions of the problem. However, the main point of this paper lies in the establishment of the robustness of this algorithm, in the sense that it provides good quality solutions for a variety of versions of the problem, under both standard and differential approximation ratios.     

Minimum number of below average triangles in a weighted complete graph

Let G be an edge weighted graph with n nodes, and let A(3,G) be the average weight of a triangle in G. We show that the number of triangles with weight at most equal to A(3,G) is at least (n−2) and that this bound is sharp for all n≥7. Extensions of this result to cliques of cardinality k>3 are also discussed.     

Norm of weighted composition operators from -Bloch spaces to weighted-type spaces

We calculate in an elegant way operator norm of the weighted composition operator from the α-Bloch space, with α(0,∞){1}, to a weighted-type space on the unit ball. This result can be regarded as a complement to our recent result regarding the same problem for the case α=1.     

The behavior of best -approximations as . A counterexample of convergence

In the space of summable sequences we give an example of a one-dimensional affine subspace C such that the best L_p-approximations of 0 from C fail to converge as p↓1. We thus give an answer to this problem of convergence in infinite measure spaces.     

Projective change between two classes of -metrics

In this paper, we find equations to characterize projective change between (α,β)-metric and Randers metric on a manifold with dimension n3, where α and are two Riemannian metrics, β and are two nonzero one forms. Moreover, we consider this projective change when F has some special curvature properties.     

-adic refinable functions and MRA-based wavelets

The main goal of this paper is the development of the MRA theory in . We described a wide class of p-adic refinement equations generating p-adic multiresolution analyses. A method for the construction of p-adic orthogonal wavelet bases within the framework of the MRA theory is suggested. A realization of this method is illustrated by an example which gives a new 3-adic wavelet basis. Another realization leads to the p-adic Haar bases which were known before.     

Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree

Given an undirected graph with edge weights, we are asked to find an orientation, that is, an assignment of a direction to each edge, so as to minimize the weighted maximum outdegree in the resulted directed graph. The problem is called MMO, and is a restricted variant of the well-known minimum makespan problem. As in previous studies, it is shown that MMO is in P for trees, weak NP-hard for planar bipartite graphs, and strong NP-hard for general graphs. There are still gaps between those graph classes. The objective of this paper is to show tighter thresholds of complexity: We show that MMO is (i) in P for cactus graphs, (ii) weakly NP-hard for outerplanar graphs, and also (iii) strongly NP-hard for graphs which are both planar and bipartite. This implies the NP-hardness for P₄-bipartite, diamond-free or house-free graphs, each of which is a superclass of cactus. We also show (iv) the NP-hardness for series-parallel graphs and multi-outerplanar graphs, and (v) present a pseudo-polynomial time algorithm for graphs with bounded treewidth.     

On the modulus of -convexity

In this paper, we prove that the moduli of W^*-convexity, introduced by Ji Gao [J. Gao, The W^*-convexity and normal structure in Banach spaces, Appl. Math. Lett. 17 (2004) 1381–1386], of a Banach space X and of the ultrapower of X itself coincide whenever X is super-reflexive. Moreover, we improve a sufficient condition for uniform normal structure of the space and its dual. This generalizes and strengthens the main results of [J. Gao, The W^*-convexity and normal structure in Banach spaces, Appl. Math. Lett. 17 (2004) 1381–1386].     

The convergence of three spline methods for scattered data interpolation and fitting

The convergences of three L₁ spline methods for scattered data interpolation and fitting using bivariate spline spaces are studied in this paper. That is, L₁ interpolatory splines, splines of least absolute deviation, and L₁ smoothing splines are shown to converge to the given data function under some conditions and hence, the surfaces from these three methods will resemble the given data values.     

A quantitative version of Trotter's approximation theorem

A quantitative version, based on modified K-functionals, of the classical Trotter's theorem concerning the approximation of C₀-semigroups is presented. The result is applied to the study of the degree of convergence of the iterated Bernstein operators on the N-dimensional simplex to their limiting semigroup.     

Finitely additive representation of spaces

Let be any atomless and countably additive probability measure on the product space with the usual σ-algebra. Then there is a purely finitely additive probability measure λ on the power set of a countable subset such that can be isometrically isomorphically embedded as a closed subspace of L^p(λ). The embedding is strict. It is also ‘canonical,’ in the sense that it maps simple and continuous functions on to their restrictions to T.     

Interlacing and spacing properties of zeros of polynomials, in particular of orthogonal and -minimal polynomials,

Let be a sequence of polynomials with real coefficients such that uniformly for [α-δ,β+δ] with G(eⁱ)≠0 on [α,β], where 0α<βπ and δ>0. First it is shown that the zeros of are dense in [α,β], have spacing of precise order π/n and are interlacing with the zeros of p_n+1(cos) on [α,β] for every nn₀. Let be another sequence of real polynomials with uniformly on [α-δ,β+δ] and on [α,β]. It is demonstrated that for all sufficiently large n the zeros of p_n(cos) and strictly interlace on [α,β] if on [α,β]. If the last expression is zero then a weaker kind of interlacing holds. These interlacing properties of the zeros are new for orthogonal polynomials also. For instance, for large n a simple criteria for interlacing of zeros of Jacobi polynomials on [-1+,1-], >0, is obtained. Finally it is shown that the results hold for wide classes of weighted L_q-minimal polynomials, q[1,∞], linear combinations and products of orthogonal polynomials, etc.     

On uniqueness of Gibbs measure for -adic countable state Potts model on the Cayley tree

In the present paper we consider countable state of p-adic Potts model on the tree. Under some condition on weights we establish uniqueness of Gibbs measures for the model. Note that this condition does not depend on values of the prime p. An analogous fact is not true when the number of spins is finite.     

Hessenberg pairs of linear transformations

Let denote a field and V denote a nonzero finite-dimensional vector space over . We consider an ordered pair of linear transformations A:V→V and A^*:V→V that satisfy (i)–(iii) below.

1. [(i)]Each of A,A^* is diagonalizable on V.

2. [(ii)]There exists an ordering of the eigenspaces of A such that

where V_-1=0, V_d+1=0.

3. [(iii)]There exists an ordering of the eigenspaces of A^* such that

where , .

We call such a pair a Hessenberg pair on V. In this paper we obtain some characterizations of Hessenberg pairs. We also explain how Hessenberg pairs are related to tridiagonal pairs.

Entropy numbers in sequence spaces with an application to weighted function spaces

We determine the exact asymptotic behaviour of entropy numbers of diagonal operators from ℓ_p to ℓ_q, 0<q<p∞, under mild regularity conditions on the generating diagonal sequence. On one hand, this is a quantitative version of Pitt's theorem for diagonal operators, and on the other hand it is a limiting case of results by Carl. An application to embeddings of weighted Besov and Triebel–Lizorkin spaces is also given.     

Shape preserving approximation on the real line with exponential weights

The well-known “Bernstein’s weighted problem” deals with the possibility of weighted approximation on the whole real line. In this paper, we show the possibility of k-monotone approximation on the real line with Freud’s weight .     

Equivalence relation groupoids associated with certain linearly ordered dimension groups

We consider linearly ordered, Archimedean dimension groups (G,G⁺,u) for which the group G/u is torsion-free. It will be shown that if, in addition, G/u is generated by a single element (i.e., ), then (G,G⁺,u) is isomorphic to for some irrational number τ(0,1). This amounts to an extension of related results where dimension groups for which G/u is torsion were considered. We will prove, in the case of the Fibonacci dimension group, that these results can be used to directly construct an equivalence relation groupoid whose C^*-algebra is the Fibonacci C^*-algebra.     

On wavelets related to the Walsh series

For any integers p,n≥2 necessary and sufficient conditions are given for scaling filters with pⁿ many terms to generate a p-multiresolution analysis in . A method for constructing orthogonal compactly supported p-wavelets on is described. Also, an adaptive p-wavelet approximation in is considered.     

Weighted-Hardy functions with Hadamard gaps on the unit ball

We prove that an analytic function f on the unit ball B with Hadamard gaps, that is, (the homogeneous polynomial expansion of f) satisfying n_k+1/n_k?λ>1 for all k∈N, belongs to the space if and only if . Moreover, we show that the following asymptotic relation holds . Also we prove that lim_r→1(1-r²)^α‖Rf_r‖_p=0 if and only if . These results confirm two conjectures from the following recent paper [S. Stevi?, On Bloch-type functions with Hadamard gaps, Abstr. Appl. Anal. 2007 (2007) 8 pages (Article ID 39176)].