St. Petersburg Mathematical Journal, 18. cilt,511-1027. sayfalarAmerican Mathematical Society, 2007 |
Kitabın içinden
32 sonuçtan 1-3 arası sonuçlar
Sayfa 617
... multiplicity r 、 also reduces by 1 , because one of the cut sets , namely { ± √ } , comes to the zero level ( to the root ) and is not counted anymore . This completes the proof . Thus , the adjoint operators T * and T * have common ...
... multiplicity r 、 also reduces by 1 , because one of the cut sets , namely { ± √ } , comes to the zero level ( to the root ) and is not counted anymore . This completes the proof . Thus , the adjoint operators T * and T * have common ...
Sayfa 618
... multiplicity r if the tree T has a cut set of multiplicity r consisting of roots of the polynomial p . A common invariant subspace is said to be indecomposable if it is not a direct sum of common invariant subspaces of smaller ...
... multiplicity r if the tree T has a cut set of multiplicity r consisting of roots of the polynomial p . A common invariant subspace is said to be indecomposable if it is not a direct sum of common invariant subspaces of smaller ...
Sayfa 636
... multiplicity at least + 1. Why cannot we manage with cycles of multiplicity 1 ? The answer is given below . Proposition 17. For a given l≥0 , assume that a refinable function belongs to C1 and the symbol satisfies ( 46 ) . If the ...
... multiplicity at least + 1. Why cannot we manage with cycles of multiplicity 1 ? The answer is given below . Proposition 17. For a given l≥0 , assume that a refinable function belongs to C1 and the symbol satisfies ( 46 ) . If the ...
İçindekiler
Asekritova and N Kruglyak Interpolation of Besov spaces in the nondiagonal | 511 |
N Belousov and A A Makhnev On edgeregular graphs with k 3b13 | 517 |
Generalov and N Yu Kosovskaya Hochschild cohomology of the Liu | 539 |
Telif Hakkı | |
27 diğer bölüm gösterilmiyor
Diğer baskılar - Tümünü görüntüle
Sık kullanılan terimler ve kelime öbekleri
adjacent algebra algorithm apply approximation assume assumptions of Theorem b₁ bounded called closed coefficients commutative complex consider constant constructed contains continuous convergence Corollary corresponding cycle defined definition denote depends domain elements entire equal equation equivalent estimate example exists extension fact factorization field finite formal formula function given graph Hence ideal implies inequality integral invariant isomorphic lattice Lemma Math Mathematical matrix means module multiplicity norm Note obtain operator parameters polynomial positive present problem Proof properties Proposition proved reduces refinable regularity relations Remark representation respectively result ring root satisfies scheme sequence solution space statement Subsection subspace suffices Suppose symbol symmetric Theorem theory twisted vector vertex vertices zero