Some Aspects of Lw1^r （G）∩ L（p,q, w2dμ）（G）

Let G be a locally compact Abelian group with Haar measure. The authors discuss some basic properties of Lw1^r （G）∩ L（p, q, w2dμ）（G） spaces. Then the necessary conditions for compact embeddings of the spaces Lw1^r （R^d）∩ L（p, q, w2dμ）（R^d） are showed.     

The Cauchy Integral Operator on Weighted Hardy Space

The authors show that the Cauchy integral operator is bounded from Hωp(R1) to hωp(R1) (the weighted local Hardy space). To prove the results, a kind of generalized atoms is introduced and a variant of weighted "Tb theorem" is considered.     

A short note on weighted mean matrices

In the present paper we have established a relation between (N, p _n ) and (N, q _n ) weighted mean matrices, when considered as bounded operators on 1^p, 1 < p < ∞.     

Weighted Composition Operators Between Weighted Bloch Type Spaces and Weighted Banach Spaces of Holomorphic Functions

Let φ: 𝔻 → 𝔻 and ψ: 𝔻 → ? be analytic maps. They induce a weighted composition operator ψ C _φ acting between weighted Bloch type spaces and weighted Banach spaces of holomorphic functions. Under some assumptions on the weights, we give a necessary as well as a sufficient condition when such an operator is bounded resp. compact.     

The Fefferman-Stein-Type Inequality for the Kakeya Maximal Operator II

Let K _δ, 0 < δ≪1, be the Kakeya maximal operator defined as the supremum of averages over tubes of the eccentricity δ. The (so-called) Fefferman-Stein-type inequality: is shown, where C _d and α _d are constants depending only on the dimension d and w is a weight. The result contains the exponent (d−2)/2d which is smaller than the exponent (d−2)(d−1)/d(2d−3) obtained in [7]. Received October 8, 2001, Accepted February 28, 2002     

Management and analysis of DNA microarray data by using weighted trees

We investigate discrete structures and combinatoric modeling of weighted prefix trees for managing and analyzing DNA microarray data. We describe the algorithms to construct the weighted trees for these data. Using these weighted trees with our algorithms, we propose methods to compute the appearance probability of a DNA microarray, to compare the informational distances in the expression of genes between the DNA microarrays, to search the characteristic microarrays and the group of candidate genes suggestive of a pathology.     

A Degenerate Fourth-Order Parabolic Equation Modeling Bose-Einstein Condensation Part II: Finite-Time Blow-Up

A degenerate fourth-order parabolic equation modeling condensation phenomena related to Bose-Einstein particles is analyzed. The model can be motivated from the spatially homogeneous and isotropic Boltzmann-Nordheim equation by a formal Taylor expansion of the collision integral. It maintains some of the main features of the kinetic model, namely mass and energy conservation and condensation at zero energy. The existence of local-in-time weak solutions satisfying a certain entropy inequality is proven. The main result asserts that if a weighted L ¹ norm of the initial data is sufficiently large and the initial data satisfies some integrability conditions, the solution blows up with respect to the L ^∞ norm in finite time. Furthermore, the set of all such blow-up enforcing initial functions is shown to be dense in the set of all admissible initial data. The proofs are based on approximation arguments and interpolation inequalities in weighted Sobolev spaces. By exploiting the entropy inequality, a nonlinear integral inequality is proved which implies the finite-time blow-up property.     

Intelligent variable orderings and re-orderings in DAC-based solvers for WCSP

Weighted constraint satisfaction problems (WCSPs) is a well-known framework for combinatorial optimization problems with several domains of application. In the last few years, several local consistencies for WCSPs have been proposed. Their main use is to embed them into a systematic search, in order to detect and prune unfeasible values as well as to anticipate the detection of deadends. Some of these consistencies rely on an order among variables but nothing is known about which orders are best. Therefore, current implementations use the lexicographic order by default. In this paper we analyze the effect of heuristic orders at three levels of increasing overhead: i) compute the order prior to search and keep it fixed during the whole solving process (we call this a static order), ii) compute the order at every search node using current subproblem information (we call this a dynamic order) and iii) compute a sequence of different orders at every search node and sequentially enforce the local consistency for each one (we call this dynamic re-ordering). We performed experiments in three different problems: Max-SAT, Max-CSP and warehouse location problems. We did not find an alternative better than the rest for all the instances. However, we found that inverse degree (static order), sum of unary weights (dynamic order) and re-ordering with the sum of unary weights are good heuristics which are always better than a random order. This research is supported by the MEC through project TIC-2002-04470-C03.     

Weighted Davenport’s constant and the weighted EGZ Theorem

Let G^∗,G be finite abelian groups with nontrivial homomorphism group . Let Ψ be a non-empty subset of . Let D_Ψ(G) denote the minimal integer, such that any sequence over G^∗ of length D_Ψ(G) must contain a nontrivial subsequence s₁,…,s_r, such that for some ψ_i∈Ψ. Let E_Ψ(G) denote the minimal integer such that any sequence over G^∗ of length E_Ψ(G) must contain a nontrivial subsequence of length |G|,s₁,…,s_|G|, such that for some ψ_i∈Ψ. In this paper, we show that E_Ψ(G)=|G|+D_Ψ(G)−1.     

On the Propagation of Regularity and Decay of Solutions to the k-Generalized Korteweg-de Vries Equation

We study special regularity and decay properties of solutions to the IVP associated to the k-generalized KdV equations. In particular, for datum u ₀ ∈ H ^3/4+ (?) whose restriction belongs to H ^l ((b, ∞)) for some l ∈ ?⁺ and b ∈ ? we prove that the restriction of the corresponding solution u(·, t) belongs to H ^l ((β, ∞)) for any β ∈ ? and any t ∈ (0, T). Thus, this type of regularity propagates with infinite speed to its left as time evolves.     

On the existence of bounded noncontinuable solutions

This paper presents necessary and sufficient conditions for an n ‐th order differential equation to have a non‐continuable solution with finite limits of its derivatives up to the order l at the right‐hand end point of the interval of its definition, l ≤ n – 2 (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Online weighted flow time and deadline scheduling

In this paper we study some aspects of weighted flow time. We first show that the online algorithm Highest Density First is an O(1)-speed O(1)-approximation algorithm for P|r_i,pmtn|∑w_iF_i. We then consider a related Deadline Scheduling Problem that involves minimizing the weight of the jobs unfinished by some unknown deadline D on a uniprocessor. We show that any c-competitive online algorithm for weighted flow time must also be c-competitive for deadline scheduling. We then give an O(1)-competitive algorithm for deadline scheduling.     

A Fan Type Condition For Heavy Cycles in Weighted Graphs

 A weighted graph is a graph in which each edge e is assigned a non-negative number w(e), called the weight of e. The weight of a cycle is the sum of the weights of its edges. The weighted degree d ^w (v) of a vertex v is the sum of the weights of the edges incident with v. In this paper, we prove the following result: Suppose G is a 2-connected weighted graph which satisfies the following conditions: 1. max{d ^w (x),d ^w (y)∣d(x,y)=2}≥c/2; 2. w(x z)=w(y z) for every vertex z∈N(x)∩N(y) with d(x,y)=2; 3. In every triangle T of G, either all edges of T have different weights or all edges of T have the same weight. Then G contains either a Hamilton cycle or a cycle of weight at least c. This generalizes a theorem of Fan on the existence of long cycles in unweighted graphs to weighted graphs. We also show we cannot omit Condition 2 or 3 in the above result. Received: February 7, 2000 Final version received: June 5, 2001     

Function Spaces with Exponential Weights II

This paper is a continuation of [8]. We study weighted function spaces of type B and F on the Euclidean space Rⁿ, where u is a weight function of at most exponential growth. In particular, u(χ (±|χ|) is an admissible weight. We deal with atomic decompositions of these spaces. Furthermore, we prove that the spaces B and F are isomorphic to the corresponding unweighted spaces B and F.     

On weighted inequalities for martingale transform operators

For 1 < p < ∞, the almost surely finiteness of is a necessary and sufficient condition in order to have almost surely convergence of the sequences {E(f|?_n)} with f ∈ L^p(v dP). This condition is also equivalent to have weighted inequalities from L^p(v dP) into L^p(u dP) for some weight u for Doob's maximal function, square function and generalized Burkholder martingale transforms. Similarly, E(u|?₁) < ∞ turns out to be necessary and sufficient for the above weighted inequalities to hold for some v.     

Convergent solutions of functional difference equations

By using ‘summable‘ dichotomies and fixed point theorems we prove the existence of convergent and bounded solutions of nonlinear difference systems.     

Curves of positive solutions of boundary value problems on time-scales

Let TR be a time-scale, with a=infT, b=supT. We consider the nonlinear boundary value problem

(2)

(4)

u(a)=u(b)=0,