共查询到20条相似文献,搜索用时 406 毫秒
1.
Let M{\mathcal M} be a σ-finite von Neumann algebra and
\mathfrak A{\mathfrak A} a maximal subdiagonal algebra of M{\mathcal M} with respect to a faithful normal conditional expectation F{\Phi} . Based on Haagerup’s noncommutative L
p
space Lp(M){L^p(\mathcal M)} associated with M{\mathcal M} , we give a noncommutative version of H
p
space relative to
\mathfrak A{\mathfrak A} . If h
0 is the image of a faithful normal state j{\varphi} in L1(M){L^1(\mathcal M)} such that j°F = j{\varphi\circ \Phi=\varphi} , then it is shown that the closure of
{\mathfrak Ah0\frac1p}{\{\mathfrak Ah_0^{\frac1p}\}} in Lp(M){L^p(\mathcal M)} for 1 ≤ p < ∞ is independent of the choice of the state preserving F{\Phi} . Moreover, several characterizations for a subalgebra of the von Neumann algebra M{\mathcal M} to be a maximal subdiagonal algebra are given. 相似文献
2.
In this paper, we characterize a C
*-subalgebra C
*(x) of B(H), generated by a single operator x. We show that if x is polar-decomposed by aq, where a is the partial isometry part and q is the positive operator part of x, then C
*(x) is *-isomorphic to the groupoid crossed product algebra
Aq×a\mathbbGa\mathcal{A}_{q}\times_{\alpha }\mathbb{G}_{a}
, where
Aq=C*(q)\mathcal{A}_{q}=C^{*}(q)
and
\mathbbGa\mathbb{G}_{a}
is the graph groupoid induced by a partial isometry part a of x. 相似文献
3.
Michel Lavrauw Leo Storme Geertrui Van de Voorde 《Designs, Codes and Cryptography》2008,48(3):231-245
In this paper, we study the p-ary linear code C(PG(n,q)), q = p
h
, p prime, h ≥ 1, generated by the incidence matrix of points and hyperplanes of a Desarguesian projective space PG(n,q), and its dual code. We link the codewords of small weight of this code to blocking sets with respect to lines in PG(n,q) and we exclude all possible codewords arising from small linear blocking sets. We also look at the dual code of C(PG(n,q)) and we prove that finding the minimum weight of the dual code can be reduced to finding the minimum weight of the dual
code of points and lines in PG(2,q). We present an improved upper bound on this minimum weight and we show that we can drop the divisibility condition on the
weight of the codewords in Sachar’s lower bound (Geom Dedicata 8:407–415, 1979).
G. Van de Voorde’s research was supported by the Institute for the Promotion of Innovation through Science and Technology
in Flanders (IWT-Vlaanderen). 相似文献
4.
Paola De Vito 《Ricerche di matematica》2011,60(1):39-43
We prove that if q = p
h
, p a prime, do not exist sets U í AG(n,q){U {\subseteq} AG(n,q)}, with |U| = q
k
and 1 < k < n, determining N directions where
\fracqk - 1p - 1 < N £ \fracq+32 q k-1+ qk-2 +...+q2 + q \frac{{q^k} - 1}{p - 1} < N \le \frac{q+3}{2} q ^{k-1}+ q^{k-2} +\dots+q{^2} + q 相似文献
5.
6.
In this paper, we introduce the concept of (1, 1)-q-coherent pair of linear functionals (U,V)(\mathcal{U},\mathcal{V}) as the q-analogue to the generalized coherent pair studied by Delgado and Marcellán in (Methods Appl Anal 11(2):273–266, 2004). This means that their corresponding sequences of monic orthogonal polynomials {P
n
(x)}
n ≥ 0 and {R
n
(x)}
n ≥ 0 satisfy
|
设为首页 | 免责声明 | 关于勤云 | 加入收藏 |
Copyright©北京勤云科技发展有限公司 京ICP备09084417号 |