首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
If A and B are n- and m-representation finite k-algebras, then their tensor product Λ=A?kB is not in general (n+m)-representation finite. However, we prove that if A and B are acyclic and satisfy the weaker assumption of n- and m-completeness, then Λ is (n+m)-complete. This mirrors the fact that taking higher Auslander algebra does not preserve d-representation finiteness in general, but it does preserve d-completeness. As a corollary, we get the necessary condition for Λ to be (n+m)-representation finite which was found by Herschend and Iyama by using a certain twisted fractionally Calabi–Yau property.  相似文献   

4.
We generalize the monomorphism category from quiver (with monomial relations) to arbitrary finite dimensional algebras by a homological definition. Given two finite dimension algebras A and B, we use the special monomorphism category Mon(B,A-Gproj) to describe some Gorenstein projective bimodules over the tensor product of A and B. If one of the two algebras is Gorenstein, we give a sufficient and necessary condition for Mon(B,A-Gproj) being the category of all Gorenstein projective bimodules. In addition, if both A and B are Gorenstein, we can describe the category of all Gorenstein projective bimodules via filtration categories. Similarly, in this case, we get the same result for infinitely generated Gorenstein projective bimodules.  相似文献   

5.
For a commutative ring A we consider a related graph, Γ(A), whose vertices are the unimodular rows of length 2 up to multiplication by units. We prove that Γ(A) is path-connected if and only if A is a GE2-ring, in the terminology of P. M. Cohn. Furthermore, if Y(A) denotes the clique complex of Γ(A), we prove that Y(A) is simply connected if and only if A is universal for GE2. More precisely, our main theorem is that for any commutative ring A the fundamental group of Y(A) is isomorphic to the group K2(2,A) modulo the subgroup generated by symbols.  相似文献   

6.
In this paper we construct a ring A which has annihilator condition (a.c.) and we show that neither A[x] nor A[[x]] has this property. This answers in negative a question asked by Hong, Kim, Lee and Nielsen. We also show that there is an algebra A which does not have annihilator condition while both A[x] and A[[x]] have this property.  相似文献   

7.
Let (G,+) be an abelian group. A finite multiset A over G is said to give a λ-fold factorization of G if there exists a multiset B over G such that each element of G occurs λ times in the multiset A+B:={a+b:aA,bB}. In this article, restricting G to a cyclic group, we will provide sufficient conditions on a given multiset A under which the exact value or an upper bound of the minimum multiplicity λ of a factorization of G can be given by introducing a concept of ‘lcm-closure’. Furthermore, a couple of properties on a given factor A will be shown when A has a prime or prime power order (cardinality). A relation to multifold factorizations of the set of integers will be also glanced at a general perspective.  相似文献   

8.
9.
We construct a minimal free resolution of the semigroup ring k[C] in terms of minimal resolutions of k[A] and k[B] when C is a numerical semigroup obtained by gluing two numerical semigroups A and B. Using our explicit construction, we compute the Betti numbers, graded Betti numbers, regularity and Hilbert series of k[C], and prove that the minimal free resolution of k[C] has a differential graded algebra structure provided the resolutions of k[A] and k[B] possess them. We discuss the consequences of our results in small embedding dimensions. Finally, we give an extension of our main result to semigroups in Nn.  相似文献   

10.
《Discrete Mathematics》2021,344(12):112589
Let N be the set of positive integers. For a nonempty set A of integers and every integer u, denote by dA(u) the number of (a,a) with a,aA such that u=aa. For a sequence S of positive integers, let S(x) be the counting function of S. The set AN is called a perfect difference set if dA(u)=1 for every positive integer u. In 2008, Cilleruelo and Nathanson (2008) [4] constructed dense perfect difference sets from dense Sidon sets. In this paper, as a main result, we prove that: let f:NN be an increasing function satisfying f(n)2 for any positive integer n, then for every Sidon set B and every function ω(x), there exists a set AN such that dA(u)=f(u) for every positive integer u and B(x/3)ω(x)A(x)B(x/3)+ω(x) for all xCf,B,ω.  相似文献   

11.
12.
13.
14.
15.
16.
We introduce a type affine C analogue of the nil Temperley–Lieb algebra, in terms of generators and relations. We show that this algebra T(n), which is a quotient of the positive part of a Kac–Moody algebra of type Dn+1(2), has an easily described faithful representation as an algebra of creation and annihilation operators on particle configurations, reminiscent of the open TASEP model in statistical physics. The centre of T(n) consists of polynomials in a certain element Q, and T(n) is a free module of finite rank over its centre. We show how to localize T(n) by adjoining an inverse of Q, and prove that the resulting algebra is a full matrix ring over a ring of Laurent polynomials over a field. Although T(n) has wild representation type, over an algebraically closed field we can classify all the finite dimensional indecomposable representations of T(n) in which Q acts invertibly.  相似文献   

17.
18.
Let D be an integral domain and let (S,) be a torsion-free, ≤-cancellative, subtotally ordered monoid. We show that the generalized power series ring ?DS,? is a Krull domain if and only if D is a Krull domain and S is a Krull monoid.  相似文献   

19.
20.
Let R be a finite principal ideal ring and m,n,d positive integers. In this paper, we study the matrix graph over R which is the graph whose vertices are m×n matrices over R and two matrices A and B are adjacent if and only if 0<rank(AB)<d. We show that this graph is a connected vertex transitive graph. The distance, diameter, independence number, clique number and chromatic number of this graph are also determined. This graph can be applied to study MRD codes over R. We obtain that a maximal independent set of the matrix graph is a maximum rank distance (MRD) code and vice versa. Moreover, we show the existence of linear MRD codes over R.  相似文献   

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

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