Loading [MathJax]/extensions/MathZoom.js
Displaying 141 –
160 of
389
In the previous paper, we have characterized (joint) subnormality of a C₀-semigroup of composition operators on L²-space by positive definiteness of the Radon-Nikodym derivatives attached to it at each rational point. In the present paper, we show that in the case of C₀-groups of composition operators on L²-space the positive definiteness requirement can be replaced by a kind of consistency condition which seems to be simpler to work with. It turns out that the consistency condition also characterizes...
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.
We study matrix identities involving multiplication and unary operations such as transposition or Moore–Penrose inversion. We prove that in many cases such identities admit no finite basis.
Currently displaying 141 –
160 of
389