Weighted norm inequalities of Bochner-Riesz means

Let w be a Muckenhoupt weight and be the weighted Hardy spaces. We use the atomic decomposition of and their molecular characters to show that the Bochner-Riesz means are bounded on for 0<p?1 and δ>max{n/p−(n+1)/2,[n/p]rw⁻¹(rw−1)−(n+1)/2}, where rw is the critical index of w for the reverse Hölder condition. We also prove the boundedness of the maximal Bochner-Riesz means for 0<p?1 and δ>n/p−(n+1)/2.     

Antisymmetry of solutions for some weighted elliptic problems

This article concerns the antisymmetry, uniqueness, and monotonicity properties of solutions to some elliptic functionals involving weights and a double well potential. In the one-dimensional case, we introduce the continuous odd rearrangement of an increasing function and we show that it decreases the energy functional when the weights satisfy a certain convexity-type hypothesis. This leads to the antisymmetry or oddness of increasing solutions (and not only of minimizers). We also prove a uniqueness result (which leads to antisymmetry) where a convexity-type condition by Berestycki and Nirenberg on the weights is improved to a monotonicity condition. In addition, we provide with a large class of problems where antisymmetry does not hold. Finally, some rather partial extensions in higher dimensions are also given.     

Weighted product Hardy space associated with operators

Assuming that the operators L₁, L₂ are self-adjoint and {\mathrm{e}}^{-{{\displaystyle tL}}_i}(i=\mathrm{1},\mathrm{2}) satisfy the generalized Davies-Gaffney estimates, we shall prove that the weighted Hardy space {{\displaystyle H}}_{{{\displaystyle L}}_{\mathrm{1}},{{\displaystyle L}}_{\mathrm{2}},\omega }^{\mathrm{1}}({ℝ}^{{{\displaystyle n}}_{\mathrm{1}}}\times {ℝ}^{{{\displaystyle n}}_{\mathrm{2}}}) associated to operators L₁, L₂ on product domain, which is defined in terms of area function, has an atomic decomposition for some weight \omega.     

Weighted estimates for a class of multilinear fractional type operators

In this paper, a class of multiple fractional type weights is defined as

     

Efficient computation of 2-medians in a tree network with positive/negative weights

We consider a variant of the classical two median facility location problem on a tree in which vertices are allowed to have positive or negative weights. This problem was proposed by Burkard et al. in 2000 (R.E. Burkard, E. Çela, H. Dollani, 2-medians in trees with pos/neg-weights, Discrete Appl. Math. 105 (2000) 51-71). who looked at two objectives, finding the total minimum weighted distance (MWD) and the total weighted minimum distance (WMD). Their approach finds an optimal solution in O(n²) time and O(n³) time, respectively, with better performance for special trees such as paths and stars. We propose here an O(nlogn) algorithm for the MWD problem on trees of arbitrary shape. We also briefly discuss the WMD case and argue that it can be solved in time. However, a systematic exposition of the later case cannot be contained in this paper.     

BMO from dyadic BMO via expectations on product spaces of homogeneous type

Using the random dyadic lattices developed by Hytönen and Kairema, we build up a bridge between BMO and dyadic BMO, and hence one between VMO and dyadic VMO, via expectations over dyadic lattices on spaces of homogeneous type, including both the one-parameter and product cases. We also obtain a similar relationship between _Ap$A_p$ and dyadic _Ap$A_p$, as well as one between the reverse Hölder class _RHp${\mathit{RH}}_p$ and dyadic _RHp${\mathit{RH}}_p$, via geometric–arithmetic expectations. These results extend the earlier theory along this line, developed by Garnett, Jones, Pipher, Ward, Xiao and Treil, to the more general setting of spaces of homogeneous type in the sense of Coifman and Weiss.     

几类变权强化缓冲算子的构造研究

基于最基本的缓冲算子x(k)d=(x(k)²)/(px(k)+(1-p)x(n))变形,获得了几类范围大大拓宽的适用缓冲算子的构造方法,讨论了缓冲算子的内在联系,研究了缓冲算子调节度与可变权重之间的关系,解决了传统缓冲算子作用强度过强或过弱的问题.最后通过实例验证了变权缓冲算子的有效性和优越性.     

Aggregating preferences rankings with variable weights

One of the most important issues for aggregating preferences rankings is the determination of the weights associated with the different ranking places. To avoid the subjectivity in determining the weights, Cook and Kress (1990) [5] suggested evaluating each candidate with the most favorable scoring vector for him/her. With this purpose, various models based on Data Envelopment Analysis have appeared in the literature. Although these methods do not require predetermine the weights subjectively, some of them have a serious drawback: the relative order between two candidates may be altered when the number of first, second, …, kth ranks obtained by other candidates changes, although there is not any variation in the number of first, second, …, kth ranks obtained by both candidates. In this paper we propose a model that allows each candidate to be evaluated with the most favorable weighting vector for him/her and avoids the previous drawback. Moreover, in some cases, we give a closed expression for the score assigned with our model to each candidate.     

Dynkin Diagram Sequences and Stabilization Phenomena

We continue the study of stabilization phenomena for Dynkin diagram sequences initiated in the earlier work of Kleber and the present author. We consider a more general class of sequences than that of this earlier work, and isolate a condition on the weights that gives stabilization of tensor product and branching multiplicities. We show that all the results of the previous article can be naturally generalized to this setting. We also prove some properties of the partially ordered set of dominant weights of indefinite Kac–Moody algebras, and use this to give a more concrete definition of a stable representation ring. Finally, we consider the classical sequences B _n , C _n , D _n that fall outside the purview of the earlier work, and work out some easy-to-describe conditions on the weights which imply stabilization.