首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
4.
5.
6.
7.
We show that the quantized coordinate ring A:=kq[SL(N)] satisfies van den Bergh's analogue of Poincaré duality for Hochschild (co)homology with dualizing bimodule being Aσ, the A-bimodule which is A as k-vector space with right multiplication twisted by the modular automorphism σ of the Haar functional. This implies that HN2?1(A,Aσ)?k, generalizing our previous result for kq[SL(2)]. To cite this article: T. Hadfield, U. Krähmer, C. R. Acad. Sci. Paris, Ser. I 343 (2006).  相似文献   

8.
A well-known cancellation problem of Zariski asks when, for two given domains (fields) K1 and K2 over a field k, a k-isomorphism of K1[t] (K1(t)) and K2[t] (K2(t)) implies a k-isomorphism of K1 and K2. The main results of this article give affirmative answer to the two low-dimensional cases of this problem:1. Let K be an affine field over an algebraically closed field k of any characteristic. Suppose K(t)?k(t1,t2,t3), then K?k(t1,t2).2. Let M be a 3-dimensional affine algebraic variety over an algebraically closed field k of any characteristic. Let A=K[x,y,z,w]/M be the coordinate ring of M. Suppose A[t]?k[x1,x2,x3,x4], then frac(A)?k(x1,x2,x3), where frac(A) is the field of fractions of A.In the case of zero characteristic these results were obtained by Kang in [Ming-chang Kang, A note on the birational cancellation problem, J. Pure Appl. Algebra 77 (1992) 141–154; Ming-chang Kang, The cancellation problem, J. Pure Appl. Algebra 47 (1987) 165–171]. However, the case of finite characteristic is first settled in this article, that answered the questions proposed by Kang in [Ming-chang Kang, A note on the birational cancellation problem, J. Pure Appl. Algebra 77 (1992) 141–154; Ming-chang Kang, The cancellation problem, J. Pure Appl. Algebra 47 (1987) 165–171].  相似文献   

9.
Bernat Plans 《Journal of Algebra》2009,321(12):3704-3713
For a field k and a finite group G acting regularly on a set of indeterminates X?={Xg}gG, let k(G) denote the invariant field k(X?)G. We first prove for the alternating group An that, if n is odd, then Q(An) is rational over Q(An?1). We then obtain an analogous result where An is replaced by an arbitrary finite central extension of either An or Sn, valid over Q(ζN) for suitable N. Concrete applications of our results yield: (1) a new proof of Maeda's result on the rationality of Q(X1,,X5)A5/Q; (2) an affirmative answer to Noether's problem over Q for both A5? and S5?; (3) an affirmative answer to Noether's problem over C for every finite central extension group of either An or Sn with n?5.  相似文献   

10.
11.
12.
13.
The Cauchy-Davenport theorem states that, if p is prime and A, B are nonempty subsets of cardinality r, s in Z/pZ, the cardinality of the sumset A+B={a+b|aA,bB} is bounded below by min(r+s1,p); moreover, this lower bound is sharp. Natural extensions of this result consist in determining, for each group G and positive integers r,s|G|, the analogous sharp lower bound, namely the functionμG(r,s)=min{|A+B||A,BG,|A|=r,|B|=s}. Important progress on this topic has been achieved in recent years, leading to the determination of μG for all abelian groups G. In this note we survey the history of earlier results and the current knowledge on this function.  相似文献   

14.
15.
16.
17.
For a given graph G and a positive integer r the r-path graph, Pr(G), has for vertices the set of all paths of length r in G. Two vertices are adjacent when the intersection of the corresponding paths forms a path of length r1, and their union forms either a cycle or a path of length r+1 in G. Let Prk(G) be the k-iteration of r-path graph operator on a connected graph G. Let H be a subgraph of Prk(G). The k-history Prk(H) is a subgraph of G that is induced by all edges that take part in the recursive definition of H. We present some general properties of k-histories and give a complete characterization of graphs that are k-histories of vertices of 2-path graph operator.  相似文献   

18.
19.
20.
Let V be an n-dimensional vector space over the finite field consisting of q elements and let Γk(V) be the Grassmann graph formed by k-dimensional subspaces of V, 1<k<n1. Denote by Γ(n,k)q the restriction of Γk(V) to the set of all non-degenerate linear [n,k]q codes. We show that for any two codes the distance in Γ(n,k)q coincides with the distance in Γk(V) only in the case when n<(q+1)2+k2, i.e. if n is sufficiently large then for some pairs of codes the distances in the graphs Γk(V) and Γ(n,k)q are distinct. We describe one class of such pairs.  相似文献   

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

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