St. Petersburg Mathematical Journal, 18. cilt,511-1027. sayfalarAmerican Mathematical Society, 2007 |
Kitabın içinden
71 sonuçtan 1-3 arası sonuçlar
Sayfa 622
... symbol . The symbol is half the generating polynomial ( 2 ) . For some reason , all publications on refinement equations deal with the symbol rather than the generating polynomial . We shall also obey this rule . The results of Chapter ...
... symbol . The symbol is half the generating polynomial ( 2 ) . For some reason , all publications on refinement equations deal with the symbol rather than the generating polynomial . We shall also obey this rule . The results of Chapter ...
Sayfa 632
... symbol m will be found . It remains to compute the values ь ( m ) and to compare them with 2 − 1 . §11 . EXAMPLES AND SPECIAL CASES In Examples 3 and 4 we apply the criterion of Theorem 11 to specific algorithms . Then we treat several ...
... symbol m will be found . It remains to compute the values ь ( m ) and to compare them with 2 − 1 . §11 . EXAMPLES AND SPECIAL CASES In Examples 3 and 4 we apply the criterion of Theorem 11 to specific algorithms . Then we treat several ...
Sayfa 622
... symbol . The symbol is half the generating polynomial ( 2 ) . For some reason , all publications on refinement equations deal with the symbol rather than the generating polynomial . We shall also obey this rule . The results of Chapter ...
... symbol . The symbol is half the generating polynomial ( 2 ) . For some reason , all publications on refinement equations deal with the symbol rather than the generating polynomial . We shall also obey this rule . The results of Chapter ...
İç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