54,905 research outputs found

    The L-p-to-L-q boundedness of commutators with applications to the Jacobian operator

    Full text link
    Supplying the missing necessary conditions, we complete the characterisation of the L-p -> L-q boundedness of commutators [b, T] of pointwise multiplication and Calderon-Zygmund operators, for arbitrary pairs of 1 q, our results are new even for special classical operators with smooth kernels. As an application, we show that every f is an element of L-p(R-d) can be represented as a convergent series of normalised Jacobians J(u) = det del uof u is an element of (over dot(W))(1,dp)(R-d)(d). This extends, from p = 1 to p > 1, a result of Coifman, Lions, Meyer and Semmes about J:. (over dot(W))(1,d)(R-d)(d) -> H-1(R-d), and supports a conjecture of Iwaniec about the solvability of the equation Ju = f is an element of L-p(R-d). (C) 2021 The Author(s). Published by Elsevier Masson SAS.Peer reviewe

    Location Choice of Multinational Enterprises in China: Comparison between Japan and Taiwan

    Full text link
    This paper explores the location choice of MNEs in China, shedding special light on the role of agglomeration of same-nationality firms. In particular, we examine how its role differs according to investors’ productivity. Furthermore, we compare the location choice of Japanese and Taiwanese MNEs in China, because Taiwanese MNEs are expected to experience less uncertainty in investing in China than Japanese MNEs, due to Taiwan’s linguistic and cultural advantages in China. We find that, less productive Japanese firms prefer to locate close to larger same-nationality agglomerations, there are no differences in location according to firms’ productivity in the case of Taiwanese firms.

    Symbol-Flipping Based Decoding of Generalized Low-Density Parity-Check Coded Constructed over GF(q)

    No full text
    An efficient symbol-flipping based decoding algorithm designed for nonbinary Generalized Low-Density Parity-Check (GLDPC) codes is proposed. By extending the concept of the Weighted Bit Flip Voting (WBFV) algorithm designed for binary Hamming-code based GLDPC codes, the symbol-flipping decoding algorithm can be beneficially employed for decoding the family of GLDPC codes constructed from nonbinary constituent codes, such as nonbinary Bose Chaudhuri Hocquenghem (BCH) codes or Reed Solomon (RS) codes. The simulation results demonstrate that improvements of 1 dB and 2.7 dB are achieved by the proposed coding scheme in comparison to the more conventional binary GLDPC codes using the WBFV decoding algorithm, when using the Galois Field GF(32) for communicating over AWGN and uncorrelated Rayleigh fading channels, respectively

    De Maiestate / Praeside M. Jacobo Thomasio, Moralis Philosoph. P. P., publice disputabit Johannes Dunte, R. L. Author & Respon: ad diem 9. Septembr. H L. Q. C.

    No full text
    DE MAIESTATE / PRAESIDE M. JACOBO THOMASIO, MORALIS PHILOSOPH. P. P., PUBLICE DISPUTABIT JOHANNES DUNTE, R. L. AUTHOR & RESPON: AD DIEM 9. SEPTEMBR. H L. Q. C. De Maiestate / Praeside M. Jacobo Thomasio, Moralis Philosoph. P. P., publice disputabit Johannes Dunte, R. L. Author & Respon: ad diem 9. Septembr. H L. Q. C. (1) Titelblatt (1) Widmung (2) Text (3) Beiträge (21
    corecore