نتایج جستجو برای: l frame homomorphism
تعداد نتایج: 717061 فیلتر نتایج به سال:
Suppose $pi:mathcal{A}rightarrow mathcal{B}$ is a surjective unital $ast$-homomorphism between C*-algebras $mathcal{A}$ and $mathcal{B}$, and $0leq aleq1$ with $ain mathcal{A}$. We give a sufficient condition that ensures there is a proection $pin mathcal{A}$ such that $pi left( pright) =pi left( aright) $. An easy consequence is a result of [L. G. Brown and G. k. Pedersen, C*-algebras of real...
In J. T. Wilson’s doctoral dissertation, the author takes up the subject of free meets, that is, subsets S of a frame L whose meet V S is preserved by a designated class of frame homomorphisms out of L. Wilson proves that all subsets of L have free meets if and only if the dual frame law holds in L and the assembly NL is a boolean frame. In this paper it is shown that for algebraic frames L wit...
For graphs G and H , a homomorphism from G to H is a function φ : V (G) → V (H), which maps vertices adjacent in G to adjacent vertices of H . A homomorphism is locally injective if no two vertices with a common neighbor are mapped to a single vertex in H . Many cases of graph homomorphism and locally injective graph homomorphism are NPcomplete, so there is little hope to design polynomial-time...
The aim of this paper is to establish a fuzzy version of the dualitybetween domains and completely distributive lattices. All values aretaken in a fixed frame $L$. A definition of (strongly) completelydistributive $L$-ordered sets is introduced. The main result inthis paper is that the category of fuzzy domains is dually equivalentto the category of strongly completely distributive $L$-ordereds...
Given a frame of a separable Hilbert space $H$, we present some iterative methods for solving an operator equation $Lu=f$, where $L$ is a bounded, invertible and symmetric operator on $H$. We present some algorithms based on the knowledge of frame bounds, Chebyshev method and conjugate gradient method, in order to give some approximated solutions to the problem. Then we i...
We define the Homomorphism Extension (HomExt) problem: given a group G, a subgroup M ≤ G and a homomorphism φ : M → H , decide whether or not there exists a homomorphism φ̃ : G → H extending φ, i.e., φ̃|M = φ. This problem arose in the context of list-decoding homomorphism codes but is also of independent interest, both as a problem in computational group theory and as a new and natural problem i...
In this paper we develop analysis of the monopole maps over universal covering space a compact four manifold. We induce property on local properness map under condition closeness AHS complex. particular construct higher degree when linearized equation is isomorphic, which induces homomorphism between K group C^* algebras. It involves non linear space, related to L^p cohomology. also obtain vari...
Cherubini, A., C. Citrini, S.C. Reghizzi, and D. Mandrioli, QRT FIFO automata, breadth-first grammars and their relations, Theoretical Computer Science 85 (1991) 171-203. Some classes of queue automata (deterministic and nondeterministic), i.e. machines equipped with one or more FIFO tapes, and corresponding languages are considered. For quasi-real-time (QRT) deterministic machines, recognition...
We say that a 〈∨, 0〉-semilattice S is conditionally co-Brouwerian, if (1) for all nonempty subsets X and Y of S such that X ≤ Y (i.e., x ≤ y for all 〈x, y〉 ∈ X × Y ), there exists z ∈ S such that X ≤ z ≤ Y , and (2) for every subset Z of S and all a, b ∈ S, if a ≤ b ∨ z for all z ∈ Z, then there exists c ∈ S such that a ≤ b ∨ c and c ≤ Z. By restricting this definition to subsets X , Y , and Z ...
This paper is concerned with complemented modular lattices containing the elements O and 7. The first part treats of homomorphisms of the lattice L, their existence, determination and invariant properties. The second considers norms (i.e., sharply positive or, alternatively, strictly monotone modular functionals) and quasi-norms (i.e., positive or monotone modular functionals) on L, their inter...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید