Pełnotekstowe zasoby PLDML oraz innych baz dziedzinowych są już dostępne w nowej Bibliotece Nauki.
Zapraszamy na https://bibliotekanauki.pl
Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 3

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last

Wyniki wyszukiwania

help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
1
Content available remote

Universal bounds for positive matrix semigroups

100%
EN
We show that any compact semigroup of positive n × n matrices is similar (via a positive diagonal similarity) to a semigroup bounded by √n. We give examples to show this bound is best possible. We also consider the effect of additional conditions on the semigroup and obtain improved bounds in some cases.
2
Content available remote

Universal bounds for matrix semigroups

100%
EN
We show that any compact semigroup of n × n matrices is similar to a semigroup bounded by √n. We give examples to show that this bound is best possible and consider the effect of the minimal rank of matrices in the semigroup on this bound.
3
Content available remote

On operator bands

76%
EN
A multiplicative semigroup of idempotent operators is called an operator band. We prove that for each K>1 there exists an irreducible operator band on the Hilbert space $l^2$ which is norm-bounded by K. This implies that there exists an irreducible operator band on a Banach space such that each member has operator norm equal to 1. Given a positive integer r, we introduce a notion of weak r-transitivity of a set of bounded operators on a Banach space. We construct an operator band on $l^2$ that is weakly r-transitive and is not weakly (r+1)-transitive. We also study operator bands S satisfying a polynomial identity p(A, B) = 0 for all non-zero A,B ∈ S, where p is a given polynomial in two non-commuting variables. It turns out that the polynomial $p(A, B) = (A B - B A)^2$ has a special role in these considerations.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.