首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 859 毫秒
1.
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.  相似文献   

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

3.
4.
Let L/K be a finite separable extension of fields whose Galois closure E/K has Galois group G. Greither and Pareigis use Galois descent to show that a Hopf algebra giving a Hopf–Galois structure on L/K has the form E[N]G for some group N of order [L:K]. We formulate criteria for two such Hopf algebras to be isomorphic as Hopf algebras, and provide a variety of examples. In the case that the Hopf algebras in question are commutative, we also determine criteria for them to be isomorphic as K-algebras. By applying our results, we complete a detailed analysis of the distinct Hopf algebras and K-algebras that appear in the classification of Hopf–Galois structures on a cyclic extension of degree pn, for p an odd prime number.  相似文献   

5.
We provide a generalization of pseudo-Frobenius numbers of numerical semigroups to the context of the simplicial affine semigroups. In this way, we characterize the Cohen-Macaulay type of the simplicial affine semigroup ring K[S]. We define the type of S, type(S), in terms of some Apéry sets of S and show that it coincides with the Cohen-Macaulay type of the semigroup ring, when K[S] is Cohen-Macaulay. If K[S] is a d-dimensional Cohen-Macaulay ring of embedding dimension at most d+2, then type(S)2. Otherwise, type(S) might be arbitrary large and it has no upper bound in terms of the embedding dimension. Finally, we present a generating set for the conductor of S as an ideal of its normalization.  相似文献   

6.
7.
8.
Let S=K[x1,,xn] be a polynomial ring, where K is a field, and G be a simple graph on n vertices. Let J(G)?S be the vertex cover ideal of G. Herzog, Hibi and Ohsugi have conjectured that all powers of vertex cover ideals of chordal graph are componentwise linear. Here we establish the conjecture for the special case of trees. We also show that if G is a unicyclic vertex decomposable graph, then symbolic powers of J(G) are componentwise linear.  相似文献   

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

10.
《Discrete Mathematics》2022,345(10):112998
Let G be a graph and let f be a positive integer-valued function on V(G). In this paper, we show that if for all S?V(G), ω(G?S)<vS(f(v)?2)+2+ω(G[S]), then G has a spanning tree T containing an arbitrary given matching such that for each vertex v, dT(v)f(v), where ω(G?S) denotes the number of components of G?S and ω(G[S]) denotes the number of components of the induced subgraph G[S] with the vertex set S. This is an improvement of several results. Next, we prove that if for all S?V(G), ω(G?S)vS(f(v)?1)+1, then G admits a spanning closed walk passing through the edges of an arbitrary given matching meeting each vertex v at most f(v) times. This result solves a long-standing conjecture due to Jackson and Wormald (1990).  相似文献   

11.
12.
13.
《Discrete Mathematics》2022,345(7):112866
Let G be a graph with n vertices. A path decomposition of G is a set of edge-disjoint paths containing all the edges of G. Let p(G) denote the minimum number of paths needed in a path decomposition of G. Gallai Conjecture asserts that if G is connected, then p(G)?n/2?. If G is allowed to be disconnected, then the upper bound ?34n? for p(G) was obtained by Donald [7], which was improved to ?23n? independently by Dean and Kouider [6] and Yan [14]. For graphs consisting of vertex-disjoint triangles, ?23n? is reached and so this bound is tight. If triangles are forbidden in G, then p(G)?g+12gn? can be derived from the result of Harding and McGuinness [11], where g denotes the girth of G. In this paper, we also focus on triangle-free graphs and prove that p(G)?3n/5?, which improves the above result with g=4.  相似文献   

14.
15.
16.
17.
《Discrete Mathematics》2022,345(5):112786
Let G be a connected graph with n(G) vertices and e(G) edges. The nullity of G, denoted by η(G), is the multiplicity of eigenvalue zero of the adjacency matrix of G. Ma, Wong and Tian (2016) proved that η(G)2c(G)+p(G)?1 unless G is a cycle of order a multiple of 4, where c(G)=e(G)?n(G)+1 is the elementary cyclic number of G and p(G) is the number of leaves of G. Recently, Chang, Chang and Zheng (2020) characterized the leaf-free graphs with nullity 2c(G)?1, thus leaving the problem to characterize connected graphs G with nullity 2c(G)+p(G)?1 when p(G)0. In this paper, we solve this problem completely.  相似文献   

18.
We study two families of cyclotomic graphs and perfect codes in them. They are Cayley graphs on the additive group of Z[ζm]/A, with connection sets {±(ζmi+A):0im?1} and {±(ζmi+A):0i?(m)?1}, respectively, where ζm (m2) is an mth primitive root of unity, A a nonzero ideal of Z[ζm], and ? Euler's totient function. We call them the mth cyclotomic graph and the second kind mth cyclotomic graph, and denote them by Gm(A) and Gm?(A), respectively. We give a necessary and sufficient condition for D/A to be a perfect t-code in Gm?(A) and a necessary condition for D/A to be such a code in Gm(A), where t1 is an integer and D an ideal of Z[ζm] containing A. In the case when m=3,4, Gm((α)) is known as an Eisenstein–Jacobi and Gaussian networks, respectively, and we obtain necessary conditions for (β)/(α) to be a perfect t-code in Gm((α)), where 0α,βZ[ζm] with β dividing α. In the literature such conditions are known to be sufficient when m=4 and m=3 under an additional condition. We give a classification of all first kind Frobenius circulants of valency 2p and prove that they are all pth cyclotomic graphs, where p is an odd prime. Such graphs belong to a large family of Cayley graphs that are efficient for routing and gossiping.  相似文献   

19.
Let p be an odd prime number. We describe the Whitehead group of all extra-special and almost extra-special p-groups. For this we compute, for any finite p-group P, the subgroup Cl1(ZP) of SK1(ZP), in terms of a genetic basis of P. We also introduce a deflation map Cl1(ZP)Cl1(Z(P/N)), for a normal subgroup N of P, and show that it is always surjective. Along the way, we give a new proof of the result describing the structure of SK1(ZP), when P is an elementary abelian p-group.  相似文献   

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

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