Fedir M. Sokhats’kyi recently posed four problems concerning parastrophic equivalence between generalized quasigroup functional equations. Sava Krstić in his PhD thesis established a connection between generalized quadratic quasigroup functional equations and connected cubic graphs. We use this connection to solve two of Sokhats’kyi’s problems, giving also complete characterization of parastrop...

Let A be a Banach "-algebra. A is locally ¿"-equivalent if, for every selfadjoint element t e A, the closed *-subalgebra of A generated by / is *-isomorphic to a ¿"-algebra. In this paper it is shown that when A is locally ¿"-equivalent, and in addition every selfadjoint element in A has at most countable spectrum, then A is *-isomorphic to a ¿"-algebra.

In this work we study a new equivalence relation between w∗ closed algebras of operators on Hilbert spaces. The algebras A and B are called TRO equivalent if there exists a ternary ring of operatorsM (i.e. MM∗M ⊂ M) such that A = [M∗BM]−w ∗ and B = [MAM∗]−w ∗ . We prove that two reflexive algebras are TRO equivalent if and only if there exists a ∗ isomorphism between the commutants of their dia...

Necessary and sufficient conditions under which two fuzzy sets (in the most general, poset valued setting) with the same domain have equal families of cut sets are given. The corresponding equivalence relation on the related fuzzy power set is investigated. Rela­ tionship of poset valued fuzzy sets and fuzzy sets for which the co-domain is Dedekind-MacNeille completion of that posets is deduced.

The (extensional) theory of arrays is widely used to model systems. Hence, efficient decision procedures are needed to model check such systems. Current decision procedures for the theory of arrays saturate the read-over-write and extensionality axioms originally proposed by McCarthy. Various filters are used to limit the number of axiom instantiations while preserving completeness. We present ...

Many problems in the verification of concurrent software systems reduce to checking the non-emptiness of the intersection of contextfree languages, an undecidable problem. We propose a decidable underapproximation, and a semi-algorithm based on the under-approximation, for this problem through bounded languages. Bounded languages are context-free subsets of regular languages of the form w∗ 1w ∗...

this research aimed at investigating the effect of different levels of nitrogen and planting patterns on dry matter production and growth physiological indices in intercropping maize and sunflower. to do this a split plot experiment carried out based randomized complete block design with three replications in research field of shushtar islamic azad university. the main plot included three level...

In the section Shared Error and Complex Dosimetry Systems for Dose Reconstruction under the subheading “Incorporating multiple realizations of dose into dose-response analysis,” the first sentence of the seventh paragraph incorrectly refers to equation 6 and equation 7. This should instead should refer to Eqs 4 and 5. The correct sentence is: Note that many of the properties 1–4 above (from Str...

Universities often lack a detailed understanding of the environmental backgrounds of their students. One way to improve understanding is through segmentation, which breaks down a population into groups of people with similar characteristics. This study aims to use segmentation to determine groups within the student population, based on environmental attitudes, and compare these groups in terms ...

A II1-factor embeds into the ultraproduct of the hyperfinite II1-factor if and only if it satisfies the von Neumann algebraic analogue of Lance’s weak expectation property (WEP). This note gives a self contained proof of this fact.