首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 226 毫秒
1.
2.
We explicitly determine generators of cyclic codes over a non-Galois finite chain ring Zp[u]/u3 of length pk, where p is a prime number and k is a positive integer. We completely classify that there are three types of principal ideals of Zp[u]/u3 and four types of non-principal ideals of Zp[u]/u3, which are associated with cyclic codes over Zp[u]/u3 of length pk. We then obtain a mass formula for cyclic codes over Zp[u]/u3 of length pk.  相似文献   

3.
4.
5.
Let Fq be the finite field of order q. Let G be one of the three groups GL(n,Fq), SL(n,Fq) or U(n,Fq) and let W be the standard n-dimensional representation of G. For non-negative integers m and d we let mWdW? denote the representation of G given by the direct sum of m vectors and d covectors. We exhibit a minimal set of homogeneous invariant polynomials {?1,?2,,?(m+d)n}?Fq[mWdW?]G such that Fq(mWdW?)G=Fq(?1,?2,,?(m+d)n) for all cases except when md=0 and G=GL(n,Fq) or SL(n,Fq).  相似文献   

6.
After a brief review of the existing results on permutation binomials of finite fields, we introduce the notion of equivalence among permutation binomials (PBs) and describe how to bring a PB to its canonical form under equivalence. We then focus on PBs of Fq2 of the form Xn(Xd(q1)+a), where n and d are positive integers and aFq2. Our contributions include two nonexistence results: (1) If q is even and sufficiently large and aq+11, then Xn(X3(q1)+a) is not a PB of Fq2. (2) If 2d|q+1, q is sufficiently large and aq+11, then Xn(Xd(q1)+a) is not a PB of Fq2 under certain additional conditions. (1) partially confirms a recent conjecture by Tu et al. (2) is an extension of a previous result with n=1.  相似文献   

7.
8.
9.
Motivated by the well-known Paley graphs over finite fields and their generalizations, in this paper we explore a natural multiplicative-additive analogue of such graphs arising from vector spaces over finite fields. Namely, if n2 and UFqn is an Fq-vector space, GU is the (undirected) graph with vertex set V(GU)=Fqn and edge set E(GU)={(a,b)Fqn2|ab,abU}. We describe the structure of an arbitrary maximal clique in GU and provide bounds on the clique number ω(GU) of GU. In particular, we compute the largest possible value of ω(GU) for arbitrary q and n. Moreover, we obtain the exact value of ω(GU) when UFqn is any Fq-vector space of dimension dU{1,2,n1}.  相似文献   

10.
11.
Let q be a perfect power of a prime number p and E(Fq) be an elliptic curve over Fq given by the equation y2=x3+Ax+B. For a positive integer n we denote by #E(Fqn) the number of rational points on E (including infinity) over the extension Fqn. Under a mild technical condition, we show that the sequence {#E(Fqn)}n>0 contains at most 10200 perfect squares. If the mild condition is not satisfied, then #E(Fqn) is a perfect square for infinitely many n including all the multiples of 12. Our proof uses a quantitative version of the Subspace Theorem. We also find all the perfect squares for all such sequences in the range q<50 and n1000.  相似文献   

12.
13.
14.
15.
16.
We study the presence of L-orthogonal elements in connection with Daugavet centers and narrow operators. We prove that if dens(Y)?ω1 and G:X?Y is a Daugavet center with separable range then, for every non-empty w?-open subset W of BX??, it follows that G??(W) contains some L-orthogonal to Y. In the context of narrow operators, we show that if X is separable and T:X?Y is a narrow operator, then given yBX and any non-empty w?-open subset W of BX?? then W contains some L-orthogonal u so that T??(u)=T(y). In the particular case that T?(Y?) is separable, we extend the previous result to dens(X)=ω1. Finally, we prove that none of the previous results holds in larger density characters (in particular, a counterexample is shown for ω2 under the assumption 2c=ω2).  相似文献   

17.
18.
19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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