The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
For a universal algebra , let End() and Aut() denote, respectively, the endomorphism monoid and the automorphism group of . Let S be a semigroup and let T be a characteristic subsemigroup of S. We say that ϕ ∈ Aut(S) is a lift for ψ ∈ Aut(T) if ϕ|T = ψ. For ψ ∈ Aut(T) we denote by L(ψ) the set of lifts of ψ, that is,
Let be an independence algebra of infinite rank and...
For a universal algebra 𝓐, let End(𝓐) and Aut(𝓐) denote, respectively, the endomorphism monoid and the automorphism group of 𝓐. Let S be a semigroup and let T be a characteristic subsemigroup of S. We say that ϕ ∈ Aut(S) is a lift for ψ ∈ Aut(T) if ϕ|T = ψ. For ψ ∈ Aut(T) we denote by L(ψ) the set of lifts of ψ, that is, L(ψ) = {ϕ ∈ Aut(S) | ϕ|T = ψ}. Let 𝓐 be an independence algebra of infinite rank and let S be a monoid of monomorphisms such that G = Aut(𝓐) ≤ S ≤ End(𝓐). In [2] it is proved...
The maximal column rank of an m by n matrix is the maximal number of the columns of A which are linearly independent. We compare the maximal column rank with rank of matrices over a nonbinary Boolean algebra. We also characterize the linear operators which preserve the maximal column ranks of matrices over nonbinary Boolean algebra.
Currently displaying 1 –
5 of
5