Decomposition theorems in orthomodular posets: the problem of uniqueness

We provide some conditions which are equivalent to the uniqueness of Hewitt-Yosida-type decomposition and Lebesgue-type decomposition for real valued additive functions defined on orthomodular posets.

     

Policy and program of a university reactor institute

Policy and program of activities are described of the Interfaculty Reactor Institute (IRI) in Delft. Underlying considerations are discussed, including factors such as direct public interests and political appreciation of the activities. Attention is paid particularly to the further development of the reactor associated experimental facilities.     

Inclusive\bar K^{0*} (892) andK 0*(892) production on silicon by 200 GeVK − andπ −

The production of the neutralK ^? (892) resonances by 200 GeVK ^? andπ ^? has been studied over the kinematic range 0.0<x _f<1.0 andp _t ² <5.0 GeV². Longitudinal and transverse momentum distributions are presented. In addition the decay angular distributions inK ^? fragmentation to \(\bar K^{0*} \) have been investigated.     

Some remarks on the identity between a variational integral and its relaxed functional

Summary Letf: (x, z)∈R ⁿ×Rⁿ→f(x, z)∈[0, +∞] be measurable inx and convex inz. It is proved, by an example, that even iff verifies a condition as|z| ^p≤f(x, z)≤Λ(a(x)+|z|^q) with 1<p<q,a∈L _loc ^s (R ⁿ),s>1, the functional that isL ¹(Ω)-lower semicontinuous onW ^1,1(Ω), does not agree onW ^1,1(Ω) with its relaxed functional in the topologyL ¹(Ω) given by inf

---

Riassunto Siaf: (x, z)∈R ⁿ×Rⁿ→f(x, z)∈[0, +∞] misurabile inx e convessa inz. Si mostra con un esempio che anche sef verifica una condizione del tipo|z| ^p≤f(x, z)≤Λ(a(x)+|z|^q) con 1<p<q,a∈L _loc ^s (R ⁿ),s>1, il funzionale , che èL ¹(Ω)-semicontinuo inferiormente suW ^1,1(Ω), non coincide suW ^1,1(Ω) con il suo funzionale rilassato nella topologiaL ¹(Ω) definito da inf

     

A finitely convergent “row-action” method for the convex feasibility problem

We present a modification of the Cyclic Subgradient Projection (CSP) method by Censor and Lent, which solves the convex feasibility problem in a finite number of steps when a Slater type condition holds, while preserving its row-action properties. A linear rate of convergence for the CSP method is established assuming the same hypothesis.Research partially supported by CNPq, under Grant No. 301699/81.