Low mass πN enhancement in inelastic αp interaction

Evidence for an enhancement in the isospin $\text{I =}\text{1}\text{2}\text{π}\text{N}$ system at M = 1130 MeV/c² (Γ = 80 MeV/c²) has been found in the reaction αp → αx at an incident α-momentum of 4.00 and 5.08 GeV/c. A strong t-dependence of the cross section and a mass-slope correlation are seen as the main features of the data.     

On the Asymptotic Behavior of Solutions of Differential Systems

There are many studies on the asymptotic behavior of solutions of differential equations. In the present paper, we consider another aspect of this problem, namely, the rate of the asymptotic convergence of solutions. Let ϕ (t) be a scalar continuous monotonically increasing positive function tending to ∞ as t → ∞. It is established that if all solutions of a differential system satisfy the inequality

Stabilité des carboxylates de terres rares,II. Bis-hydroxyméthyl-2,2-propionates

The stability constants of 2, 2-bis-hydroxymethyl-propionates of rare earths have been determined at ionic strength 0,100 (NaClO₄) at 25.0°C by a potentiometric method. The ligand forms 1 : 1 and 1 : 2 complexes with all the rare earths and weak 1 : 3 complexes with light rare earths only. In these last complexes, it binds in a unidentate way. The dissociation constant of the acid has also been measured.     

A method for automatic identification of water and fat images from a symmetrically sampled dual-echo Dixon technique

Sampling water and fat signals symmetrically (i.e., at 0° and 180° relative phase angles) in a dual-echo Dixon technique offers high intrinsic tolerance to phase fluctuations in postprocessing and maximum signal-to-noise performance for the separated water and fat images. However, identification of which image is water and which image is fat after their separation is not possible based on the phase information alone. In this work, we proposed a semiempirical automatic image identification method that is based on the intrinsic asymmetry between the water and fat chemical shift spectra. Specifically, the approximately bimodal feature of the fat spectra and the observation that most in vivo tissues are either predominantly water or predominantly fat are used to construct a spectrum-based algorithm. Additional refinement is accomplished by considering the spatial distribution of the tissues that may have a coexistence of water and fat. The final improved algorithm was tested on a total of 131 three-dimensional patient datasets collected from different scanners and found to yield correct water and fat identification in all datasets.     

Ultradistributional boundary values of harmonic functions on the sphere

We present a theory of ultradistributional boundary values for harmonic functions defined on the Euclidean unit ball. We also give a characterization of ultradifferentiable functions and ultradistributions on the sphere in terms of their spherical harmonic expansions. To this end, we obtain explicit estimates for partial derivatives of spherical harmonics, which are of independent interest and refine earlier estimates by Calderón and Zygmund. We apply our results to characterize the support of ultradistributions on the sphere via Abel summability of their spherical harmonic expansions.     

Identifying defective sets using queries of small size

We examine the following version of a classic combinatorial search problem introduced by Rényi: Given a finite set $X$ of $n$ elements we want to identify an unknown subset $Y$ of $X$, which is known to have exactly $d$ elements, by means of testing, for as few as possible subsets $A$ of $X$, whether $A$ intersects $Y$ or not. We are primarily concerned with the non-adaptive model, where the family of test sets is specified in advance, in the case where each test set is of size at most some given natural number $k$. Our main results are nearly tight bounds on the minimum number of tests necessary when $d$ and $k$ are fixed and $n$ is large enough.     

Multi-set neighbor distinguishing 3-edge coloring

Let $G$ be a graph without isolated edges, and let $c:E\left(G\right)\to \{1,\dots ,k\}$ be a coloring of the edges, where adjacent edges may be colored the same. The color code of a vertex $v$ is the ordered $k$-tuple $(a_1,a_2,\dots ,a_k)$, where $a_i$ is the number of edges incident with $v$ that are colored $i$. If every two adjacent vertices of $G$ have different color codes, such a coloring is called multi-set neighbor distinguishing. In this paper, we prove that three colors are sufficient to produce a multi-set neighbor distinguishing edge coloring for every graph without isolated edges.