首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 750 毫秒
1.
This note is a short conceptual elaboration of the conjecture of Saniga et al. [J. Opt. B: Quantum Semiclass 6 (2004) L19–L20] by regarding a set of mutually unbiased bases (MUBs) in a d-dimensional Hilbert space as an analogue of an arc in a (finite) projective plane of order d. Complete sets of MUBs thus correspond to (d + 1)-arcs, i.e., ovals. In the Desarguesian case, the existence of two principally distinct kinds of ovals for d = 2n and n  3, viz. conics and non-conics, implies the existence of two qualitatively different groups of the complete sets of MUBs for the Hilbert spaces of corresponding dimensions. A principally new class of complete sets of MUBs are those having their analogues in ovals in non-Desarguesian projective planes; the lowest dimension when this happens is d = 9.  相似文献   

2.
It is well known that, if an identity operator on an n-dimensional Banach space V can be extended to any Banach space with the same norm, then V is isometric to l(n). We show that the identity is the only such operator.  相似文献   

3.
We continue the study of an operator algebra associated with a self-mapping ? on a countable setX which can be represented as a directed graph. This C*-algebra belongs to a class of operator algebras, generated by a family of partial isometries satisfying some relations on their source and range projections. Earlier we have formulated the irreducibility criterion of such algebras, which give us a possibility to examine the structure of the corresponding Hilbert space. We will show that for reducible algebras the underlying Hilbert space can be represented either as an infinite sum of invariant subspaces or as a tensor product of a finite-dimensional Hilbert space with l2(Z). In the first case we present a conditions under which the studied algebra has an irreducible representation into a C*-algebra generated by a weighted shift operator. In the second case, the algebra has the irreducible finite-dimensional representations indexed by the unit circle.  相似文献   

4.
A collection Q of linearly independent w-suhicfs of the n-dimensional vector space V(n) over GF(2) is a w-quilt if whenever X and Y are distinct elements of Q, then X is disjoint from the linear span of Y. The main problem is to determine the maximum possibility cardinality of a w-quilt in V(n) for fixed w and n. Here a graph T(Q) is associated with each quilt Q. The connected components of T(Q) are shown to be complete graphs and the structure of the subquilts corresponding to these components is completely determined. By use of Ramsey type arguments these results are shown to lead to new upper bounds on the cardinality of a w-quilt in V(n) where n = w + 2, a case of particular interest.  相似文献   

5.
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, but lower bounds show that if linear space is assumed, the problem cannot be solved in polylogarithmic time, except for the case of orthogonal ranges. In this paper we show that if one is willing to allow approximate ranges, then it is possible to do much better. In particular, given a bounded range Q of diameter w and >0, an approximate range query treats the range as a fuzzy object, meaning that points lying within distance w of the boundary of Q either may or may not be counted. We show that in any fixed dimension d, a set of n points in can be preprocessed in O(n+logn) time and O(n) space, such that approximate queries can be answered in O(logn(1/)d) time. The only assumption we make about ranges is that the intersection of a range and a d-dimensional cube can be answered in constant time (depending on dimension). For convex ranges, we tighten this to O(logn+(1/)d−1) time. We also present a lower bound for approximate range searching based on partition trees of Ω(logn+(1/)d−1), which implies optimality for convex ranges (assuming fixed dimensions). Finally, we give empirical evidence showing that allowing small relative errors can significantly improve query execution times.  相似文献   

6.
In this note, we show that the set of all commuting d-tuples of commuting n×n matrices that are contained in an n-dimensional commutative algebra is a closed set, and therefore, Gerstenhaber's theorem on commuting pairs of matrices is a consequence of the irreduciblity of the variety of commuting pairs. We show that the variety of commuting triples of 4×4 matrices is irreducible. We also study the variety of n-dimensional commutative subalgebras of Mn(F), and show that it is irreducible of dimension n2n for n4, but reducible, of dimension greater than n2n for n7.  相似文献   

7.
Let Vk be a k-dimensional vector space and let E(Vk) be the finite dimensional Grass-mann algebra over a field F. We compute the sequence of cocharacters of the nilpotent algebra E*(Vk) = E(Vk) - F.  相似文献   

8.
对作用于一复可分无穷维Hilbet空间(?)上的两个有界线性算子T,S,它 们本性相似和π(T),π(S)(T,S在Calkin代数中的象)相似是否等价?这是有趣的问 题.本文引入一个算子类ES((?)),并证明了对ES((?))中的算子,上面提到的两种相 似性是等价的. 此外,还证明了ES((?))在B((?))中按照算子范数拓扑稠密.  相似文献   

9.
In this paper we extend a result of Semrl stating that every 2-local automorphism of the full operator algebra on a separable infinite dimensional Hilbert space is an automorphism. In fact, besides separable Hilbert spaces, we obtain the same conclusion for the much larger class of Banach spaces with Schauder bases. The proof rests on an analogous statement concerning the 2-local automorphisms of matrix algebras for which we present a short proof. The need to get such a proof was formulated in Semrl's paper.

  相似文献   


10.
Given a separable, infinite dimensional Hilbert space, it was recently shown by the authors that there is a path of chaotic operators, which is dense in the operator algebra with the strong operator topology, and along which every operator has the exact same dense Gδ set of hypercyclic vectors. In the present work, we show that the conjugate set of any hypercyclic operator on a separable, infinite dimensional Banach space always contains a path of operators which is dense with the strong operator topology, and yet the set of common hypercyclic vectors for the entire path is a dense Gδ set. As a corollary, the hypercyclic operators on such a Banach space form a connected subset of the operator algebra with the strong operator topology.  相似文献   

11.
Given a unilateral forward shift S acting on a complex,separable,infinite dimensional Hilbert space H,an asymptotically S-Toeplitz operator is a bounded linear operator T on H satisfying that{S~(*n)T S~n}is convergent with respect to one of the topologies commonly used in the algebra of bounded linear operators on H.In this paper,we study the asymptotic T_u-Toeplitzness of weighted composition operators on the Hardy space H~2,where u is a nonconstant inner function.  相似文献   

12.
An isometric path is merely any shortest path between two vertices. If the vertices of the hypercube Qn are represented by the set of 0–1 vectors of length n, an isometric path is obtained by changing the coordinates of a vector one at a time, never changing the same coordinate more than once. The minimum number of isometric paths required to cover the vertices of Qn is at least 2n/(n+1). We show that when n+1 is a power of 2, the lower bound is in fact the minimum. In doing so, we construct a family of disjoint isometric paths which can be used to find an upper bound for additional classes of hypercubes.  相似文献   

13.
A frame in a Hilbert space allows every element in to be written as a linear combination of the frame elements, with coefficients called frame coefficients. Calculations of those coefficients and many other situations where frames occur, requires knowledge of the inverse frame operator. But usually it is hard to invert the frame operator if the underlying Hilbert space is infinite dimensional. In the present paper we introduce a method for approximation of the inverse frame operator using finite subsets of the frame. In particular this allows to approximate the frame coefficients (even inl 2) using finite-dimensional linear algebra. We show that the general method simplifies in the important cases of Weil-Heisenberg frames and wavelet frames.  相似文献   

14.
In this paper for the first time we show that in the complex Hilbert space with the conjugation operator a classification of von Neumann algebras is possible. Similar classification is known for Krein spaces. Projectors (idempotents) often serve as elements of quantum logic. In operator theories projectors play the role of elements from which bounded operators are constructed. For one special case we show that for any projector from von Neumann algebra which acts in a separable Hilbert space one can always find conjugation operator J adjoined to this algebra for which the projector is self-adjoint.  相似文献   

15.
Module theoretic methods are employed to obtain simple proofs of extensions of two theorems of E. A. Azoff regarding the reflexivity of direct sums of copies of an algebra of operators on a finite dimensional Hilbert space.

  相似文献   


16.
On the supercyclicity and hypercyclicity of the operator algebra   总被引:1,自引:0,他引:1  
Let B(X) be the operator algebra for a separable infinite dimensional Hilbert space H, endowed with the strong operator topology or *-strong topology. We give sufficient conditions for a continuous linear mapping L : B(X) →B(X) to be supercyclic or ,-supercyclic. In particular our condition implies the existence of an infinite dimensional subspace of supercyclic vectors for a mapping T on H. Hypercyclicity of the operator algebra with strong operator topology was studied' by Chan and here we obtain an analogous result in the case of *-strong operator topology.  相似文献   

17.
We study the operator algebra associated with a self-mapping ? on a countable set X which can be represented as a directed graph. The algebra is generated by the family of partial isometries acting on the corresponding l2(X). We study the structure of involutive semigroup multiplicatively generated by the family of partial isometries. We formulate the criterion when the algebra is irreducible on the Hilbert space. We consider the concrete examples of operator algebras. In particular, we give the examples of nonisomorphic C*-algebras, which are the extensions by compact operators of the algebra of continuous functions on the unit circle.  相似文献   

18.
Our aim is to set the foundations of a discrete vectorial calculus on uniform n-dimensional grids, that can be easily reformulated on general irregular grids. As a key tool we first introduce the notion of tangent space to any grid node. Then we define the concepts of vector field, field of matrices and inner products on the space of grid functions and on the space of vector fields, mimicking the continuous setting. This allows us to obtain the discrete analogous of the basic first order differential operators, gradient and divergence, whose composition define the fundamental second order difference operator. As an application, we show that all difference schemes, with constant coefficients, for first and second order differential operators with constant coefficients can be seen as difference operators of the form for suitable choices of q, and  . In addition, we characterize special properties of the difference scheme, such as consistency, symmetry and positivity in terms of q, and  .  相似文献   

19.
In analogy with classical projective algebraic geometry, Hilbert functors can be defined for objects in any Abelian category. We study the moduli problem for such objects. Using Grothendieck's general framework. We show that with suitable hypotheses the Hilbert functor is representable by an algebraic space locally of finite type over the base field. For the category of the graded modules over a strongly Noetherian graded ring, the Hilbert functor of graded modules with a fixed Hilbert series is represented by a commutative projective scheme. For the projective scheme corresponding to a suitable noncommutative graded algebra, the Hilbert functor is represented by a countable union of commutative projective schemes.  相似文献   

20.
The rectangle enclosure problem is the problem of determining the subset of n iso-oriented planar rectangles that enclose a query rectangle Q. In this paper, we use a three layered data structure which is a combination of Range and Priority search trees and answers both the static and dynamic cases of the problem. Both the cases use O(n> log2 n) space. For the static case, the query time is O(log2 n log log n + K). The dynamic case is supported in O(log3 n + K) query time using O(log3 n) amortized time per update. K denotes the size of the answer. For the d-dimensional space the results are analogous. The query time is O(log2d-2 n log log n + K) for the static case and O(log2d-1 n + K) for the dynamic case. The space used is O(n> log2d-2 n) and the amortized time for an update is O(log2d-1 n). The existing bounds given for a class of problems which includes the present one, are O(log2d n + K) query time, O(log2d n) time for an insertion and O(log2d-1 n) time for a deletion.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号