Let m have compact support in (0,∞). For 1 < p < 2d/(d + 1), we give a necessary and sufficient condition for the Lprad(R )-boundedness of the maximal operator associated with the radial multiplier m(|ξ|). More generally we prove a similar result for maximal operators associated with multipliers of modified Hankel transforms. The result is obtained by modifying the proof of the characterization...

In this paper results about the Hilbert function and about the number of minimal generators stated in (Orecchia) for disjoint unions of rational smooth curves are generalized to disjoint unions of distinct smooth non special curves. Hence, the maximal rank and the minimal generation of such curves are studied. In particular, we consider elliptic curves and we describe a method to compute their ...

OBJECTIVES Although healthy individuals have less force production capacity during bilateral muscle contractions compared to unilateral efforts, emerging evidence suggests that certain aspects of paretic upper limb task performance after stroke may be enhanced by moving bilaterally instead of unilaterally. We investigated whether the bilateral movement condition affects grip force differently o...

We study paths between maximal chains, or “flags,” in finite rank semimodular lattices. Two flags are adjacent if they differ on at most one rank. A path is a sequence of flags in which consecutive flags are adjacent. We study the union of all flags on at least one minimum length path connecting two flags in the lattice. This is a subposet of the original lattice. If the lattice is modular, the...

Linear mixed-effects models (LMEMs) have become increasingly prominent in psycholinguistics and related areas. However, many researchers do not seem to appreciate how random effects structures affect the generalizability of an analysis. Here, we argue that researchers using LMEMs for confirmatory hypothesis testing should minimally adhere to the standards that have been in place for many decade...

We explore the properties of subgraphs (called Markovian subgraphs) of a decomposable graph under some condition. For a decomposable graph G and a collection γ of its Markovian subgraphs, we show that the set χ(G) of the intersections of all the neighboring cliques of G contains ∪g∈γχ(g). We also show that χ(G) = ∪g∈γχ(g) holds for a certain type of G which we call a maximal Markovian supergrap...

We prove that extreme Kerr initial data set is a unique absolute minimum of the total mass in a (physically relevant) class of vacuum, maximal, asymptotically flat, axisymmetric data for Einstein equations with fixed angular momentum. These data represent nonstationary, axially symmetric, black holes. As a consequence, we obtain that any data in this class satisfy the inequality √ J ≤ m, where ...

We show that the maximal number of singular moves required to pass between any two regularly homotopic planar or spherical curves with at most n crossings, grows quadratically with respect to n. Furthermore, this can be done with all curves along the way having at most n + 2 crossings.