St. Petersburg Mathematical Journal, 18. cilt,511-1027. sayfalarAmerican Mathematical Society, 2007 |
Kitabın içinden
66 sonuçtan 1-3 arası sonuçlar
Sayfa 532
... pair with u . Furthermore , the pair u , t is almost good , and the degree of d in the graph [ u ] is at least ( b1 − 2 ) + ( b1 − 3 ) 2 . Hence , b2 − 5b1 +7 ≤ 2b1 − 4 and bi 4. We put [ d ] [ z ] = { e , t } . Then [ e ] ^ [ y ] ...
... pair with u . Furthermore , the pair u , t is almost good , and the degree of d in the graph [ u ] is at least ( b1 − 2 ) + ( b1 − 3 ) 2 . Hence , b2 − 5b1 +7 ≤ 2b1 − 4 and bi 4. We put [ d ] [ z ] = { e , t } . Then [ e ] ^ [ y ] ...
Sayfa 614
... pair we pass to the polynomial pa ( z ) = ( ≈ − 4 ) ( ≈ + 4 ) , which has another pair : z = ± 4 . Moreover , the polynomial may have several pairs of symmetric zeros , and at each step we have the choice which one to remove for the ...
... pair we pass to the polynomial pa ( z ) = ( ≈ − 4 ) ( ≈ + 4 ) , which has another pair : z = ± 4 . Moreover , the polynomial may have several pairs of symmetric zeros , and at each step we have the choice which one to remove for the ...
Sayfa 626
... pair Ao , A1 , i.e. , the number of pairs { A , A } for which Pp.k = maxj = 1 , ... , Pp.j. The valency is a discrete function of the parameter p . The number of blocks and their dimensions are defined uniquely up to permutations ; the ...
... pair Ao , A1 , i.e. , the number of pairs { A , A } for which Pp.k = maxj = 1 , ... , Pp.j. The valency is a discrete function of the parameter p . The number of blocks and their dimensions are defined uniquely up to permutations ; 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