首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
We prove that a linear transformation from one grassmann space to another that takes decomposable vectors to decomposable vectors either maps the entire space into a pure subspace of the range space or is a composition of maps which are induced by linear maps and correlations between subspaces of the underlying vector spaces  相似文献   

2.
We compute the parameters of the linear codes that are associated with higher dimensional projective embeddings of Grassmannian when the degree exceeds the number of elements of the finite field. We investigate various dimension formulas for the projective Reed-Müller codes. We show that the duals of higher Grassmann codes are given by higher Grassmann codes or their simple extensions.  相似文献   

3.
We consider linear error correcting codes associated to higher-dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult questions in combinatorics and algebraic geometry. This is illustrated by codes associated to Schubert varieties in Grassmannians, called Schubert codes, which have recently been studied. The basic parameters such as the length, dimension and minimum distance of these codes are known only in special cases. An upper bound for the minimum distance is known and it is conjectured that this bound is achieved. We give explicit formulae for the length and dimension of arbitrary Schubert codes and prove the minimum distance conjecture in the affirmative for codes associated to Schubert divisors.  相似文献   

4.
We compute the parameters of the linear codes that are associated with all projective embeddings of Grassmann varieties.  相似文献   

5.
This paper is about certain linear subspaces of Banach SN spaces (that is to say Banach spaces which have a symmetric nonexpansive linear map into their dual spaces). We apply our results to monotone linear subspaces of the product of a Banach space and its dual. In this paper, we establish several new results and also give improved proofs of some known ones in both the general and the special contexts.  相似文献   

6.
The Clifford algebra constructed on a given linear space with a symmetric bilinear form is considered along with the family of its Grassmann subalgebras generated by all possible isotropic subspaces. The amalgam (i.e., the inductive limit) of this family is described. As an application, a modification of the canonical anticommutation relations (CAR) is examined. The modification is such that the conventional CAR are imposed only on pairs of space vectors that are orthogonal with respect to the form mentioned above, and each of the vectors is isotropic.  相似文献   

7.
《Discrete Mathematics》2022,345(3):112718
Weight hierarchies of linear codes have been an interesting topic due to their important values in theory and applications in cryptography. In this paper, we restrict a degenerate quadratic form f over a finite field of odd characteristic to subspaces and introduce a quotient space related to the degenerate quadratic form f. From the polynomial f over the quotient space, a non-degenerate quadratic form is induced. Some related results on the subspaces and quotient spaces are obtained. Based on these results, the weight hierarchies of a family of linear codes related to f are determined.  相似文献   

8.
LetT L(X) be a continuous linear operator on a complex Banach spaceX. We show thatT possesses non-trivial closed invariant subspaces if its localizable spectrum loc(T) is thick in the sense of the Scott Brown theory. Since for quotients of decomposable operators the spectrum and the localizable spectrum coincide, it follows that each quasiaffine transformation of a Banach-space operator with Bishop's property () and thick spectrum has a non-trivial invariant subspace. In particular it follows that invariant-subspace results previously known for restrictions and quotients of decomposable operators are preserved under quasisimilarity.  相似文献   

9.
We prove that a projective Grassmannian can be recovered from the complement of one of its Grassmann substructures. Even more, the underlying projective space with the interval of its distinguished subspaces can be recovered.  相似文献   

10.
In this paper, a transform approach is used for polycyclic and serial codes over finite local rings in the case that the defining polynomials have no multiple roots. This allows us to study them in terms of linear algebra and invariant subspaces as well as understand the duality in terms of the transform domain. We also make a characterization of when two polycyclic ambient spaces are Hamming-isometric.  相似文献   

11.
12.
We study subsets of Grassmann varieties G(l,m) over a field F, such that these subsets are unions of Schubert cycles, with respect to a fixed flag. We study unions of Schubert cycles of Grassmann varieties G(l,m) over a field F. We compute their linear span and, in positive characteristic, their number of Fq-rational points. Moreover, we study a geometric duality of such unions, and give a combinatorial interpretation of this duality. We discuss the maximum number of Fq-rational points for Schubert unions of a given spanning dimension, and as an application to coding theory, we study the parameters and support weights of the well-known Grassmann codes. Moreover, we determine the maximum Krull dimension of components in the intersection of G(l,m) and a linear space of given dimension in the Plücker space.  相似文献   

13.
In 1959 E. Bishop used a Banach-space version of the analyticduality principle established by e Silva, Köthe, Grothendieckand others to study connections between spectral decompositionproperties of a Banach-space operator and its adjoint. Accordingto Bishop a continuous linear operator T L(X) on a Banach spaceX satisfies property (rß) if the multiplication operator is injective with closed range for each open set U in the complex plane. In the present articlethe analytic duality principle in its original locally convexform is used to develop a complete duality theory for property(rß). At the same time it is shown that, up to similarity,property (rß) characterizes those operators occurringas restrictions of operators decomposable in the sense of C.Foias, and that its dual property, formulated as a spectraldecomposition property for the spectral subspaces of the givenoperator, characterizes those operators occurring as quotientsof decomposable operators. It is proved that, unlike the situationfor commuting subnormal operators, each finite commuting systemof operators with property (rß) can be extended toa finite commuting system of decomposable operators. Meanwhilethe results of this paper have been used to prove the existenceof invariant subspaces for subdecomposable operators with sufficientlyrich spectrum. 1991 Mathematics Subject Classification: 47A11,47B40.  相似文献   

14.
15.
The Hermitian tensor is an extension of Hermitian matrices and plays an important role in quantum information research. It is known that every symmetric tensor has a symmetric CP-decomposition. However, symmetric Hermitian tensor is not the case. In this paper, we obtain a necessary and sufficient condition for symmetric Hermitian decomposability of symmetric Hermitian tensors. When a symmetric Hermitian decomposable tensor space is regarded as a linear space over the real number field, we also obtain its dimension formula and basis. Moreover, if the tensor is symmetric Hermitian decomposable, then the symmetric Hermitian decomposition can be obtained by using the symmetric Hermitian basis. In the application of quantum information, the symmetric Hermitian decomposability condition can be used to determine the symmetry separability of symmetric quantum mixed states.  相似文献   

16.
A Banach space is hereditarily finitely decomposable if it does not contain finite direct sums of infinite dimensional subspaces with arbitrarily large number of summands. Here we show that the class of all hereditarily finitely decomposable Banach spaces has the three-space property. Moreover we show that the corresponding class defined in terms of quotients has also the three-space property.  相似文献   

17.
The method of alternating projections (MAP) is a common method for solving feasibility problems. While employed traditionally to subspaces or to convex sets, little was known about the behavior of the MAP in the nonconvex case until 2009, when Lewis, Luke, and Malick derived local linear convergence results provided that a condition involving normal cones holds and at least one of the sets is superregular (a property less restrictive than convexity). However, their results failed to capture very simple classical convex instances such as two lines in a three-dimensional space. In this paper, we extend and develop the Lewis-Luke-Malick framework so that not only any two linear subspaces but also any two closed convex sets whose relative interiors meet are covered. We also allow for sets that are more structured such as unions of convex sets. The key tool required is the restricted normal cone, which is a generalization of the classical Mordukhovich normal cone. Numerous examples are provided to illustrate the theory.  相似文献   

18.
Polycyclic codes are a powerful generalization of cyclic and constacyclic codes. Their algebraic structure is studied here by the theory of invariant subspaces from linear algebra. As an application, a bound on the minimum distance of these codes is derived which outperforms, in some cases, the natural analogue of the BCH bound.  相似文献   

19.
We prove automatic continuity theorems for “decomposable” or“local” linear transformations between certain natural subspaces of operator algebras. The transformations involved are not algebra homomorphisms but often are module homomorphisms. We show that all left (respectively quasi-) centralizers of the Pedersen ideal of a C*-algebra A are locally bounded if and only if A has no infinite dimensional elementary direct summand. It has previously been shown by Lazar and Taylor and Phillips that double centralizers of Pedersen’s ideal are always locally bounded.  相似文献   

20.
The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and codes with small Singleton's defect. We propose a new set of linear relations that must be satisfied by the coefficients of the weight distribution. From these relations we are able to derive known identities (in an easier way) for interesting cases, such as extremal codes, Hermitian codes, MDS and NMDS codes. Moreover, we are able to present for the first time the weight distribution of AMDS codes. We also discuss the link between our results and the Pless equations.  相似文献   

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

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