首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 314 毫秒
1.
2.
We construct invariant polynomials on truncated multicurrent algebras, which are Lie algebras of the form g?FF[t1,,t?]/I, where g is a finite-dimensional Lie algebra over a field F of characteristic zero, and I is a finite-codimensional ideal of F[t1,,t?] generated by monomials. In particular, when g is semisimple and F is algebraically closed, we construct a set of algebraically independent generators for the algebra of invariant polynomials. In addition, we describe a transversal slice to the space of regular orbits in g?FF[t1,,t?]/I. As an application of our main result, we show that the center of the universal enveloping algebra of g?FF[t1,,t?]/I acts trivially on all irreducible finite-dimensional representations provided I has codimension at least two.  相似文献   

3.
4.
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.  相似文献   

5.
Let Fq be the finite field with q elements, and T a positive integer. In this article, we find an asymptotic formula for the total number of monic irreducible binomials in Fq[x] of degree less or equal to T, when T is large enough. We also show explicit lower and upper bounds for the number of binomials in the case when T is small.  相似文献   

6.
7.
The construction of the free Banach lattice generated by a real Banach space is extended to the complex setting. It is shown that for every complex Banach space E there is a complex Banach lattice FBLC[E] containing a linear isometric copy of E and satisfying the following universal property: for every complex Banach lattice XC, every operator T:EXC admits a unique lattice homomorphic extension T?:FBLC[E]XC with 6T?6=6T6. The free complex Banach lattice FBLC[E] is shown to have analogous properties to those of its real counterpart. However, examples of non-isomorphic complex Banach spaces E and F can be given so that FBLC[E] and FBLC[F] are lattice isometric. The spectral theory of induced lattice homomorphisms on FBLC[E] is also explored.  相似文献   

8.
Let Fq be the finite field of characteristic p with q elements and Fqn its extension of degree n. We prove that there exists a primitive element of Fqn that produces a completely normal basis of Fqn over Fq, provided that n=p?m with (m,p)=1 and q>m.  相似文献   

9.
10.
11.
12.
13.
The notion of multiple Ore extension is introduced as a natural generalization of Ore extensions and double Ore extensions. For a PBW-deformation Bq(sl(n+1,C)) of type An quantum group, we explicitly obtain the commutation relations of its root vectors, then show that it can be realized via a series of multiple Ore extensions, which we call a ladder Ore extension of type (1,2,?,n). Moreover, we analyze the quantum algebras Bq(g) with g of type D4, B2 and G2 and give some examples and counterexamples that can be realized by a ladder Ore extension.  相似文献   

14.
《Discrete Mathematics》2022,345(11):113059
Let Fq be the finite field of q elements and let D2n=x,y|xn=1,y2=1,yxy=xn?1 be the dihedral group of 2n elements. Left ideals of the group algebra Fq[D2n] are known as left dihedral codes over Fq of length 2n, and abbreviated as left D2n-codes. Let gcd(n,q)=1. In this paper, we give an explicit representation for the Euclidean hull of every left D2n-code over Fq. On this basis, we determine all distinct Euclidean LCD codes and Euclidean self-orthogonal codes which are left D2n-codes over Fq. In particular, we provide an explicit representation and a precise enumeration for these two subclasses of left D2n-codes and self-dual left D2n-codes, respectively. Moreover, we give a direct and simple method for determining the encoder (generator matrix) of any left D2n-code over Fq, and present several numerical examples to illustrative our applications.  相似文献   

15.
We give an improvement on a character sum estimate in Fq[t] and answer a question of Shparlinski.  相似文献   

16.
We compute the second moment in the family of quadratic Dirichlet L–functions with prime conductors over Fq[x] when the degree of the discriminant goes to infinity, obtaining one of the lower order terms. We also obtain an asymptotic formula with the leading order term for the mean value of the derivatives of L–functions associated to quadratic twists of a fixed elliptic curve over Fq(t) by monic irreducible polynomials. As a corollary, we prove that there are infinitely many monic irreducible polynomials such that the analytic rank of the corresponding twisted elliptic curves is equal to 1.  相似文献   

17.
In this paper, we generalize the notion of functional graph. Specifically, given an equation E(X,Y)=0 with variables X and Y over a finite field Fq of odd characteristic, we define a digraph by choosing the elements in Fq as vertices and drawing an edge from x to y if and only if E(x,y)=0. We call this graph as equational graph. In this paper, we study the equational graph when choosing E(X,Y)=(Y2f(X))(λY2f(X)) with f(X) a polynomial over Fq and λ a non-square element in Fq. We show that if f is a permutation polynomial over Fq, then every connected component of the graph has a Hamiltonian cycle. Moreover, these Hamiltonian cycles can be used to construct balancing binary sequences. By making computations for permutation polynomials f of low degree, it appears that almost all these graphs are strongly connected, and there are many Hamiltonian cycles in such a graph if it is connected.  相似文献   

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

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