共查询到20条相似文献,搜索用时 15 毫秒
1.
2.
3.
4.
Nursel Erey 《Journal of Pure and Applied Algebra》2019,223(7):3071-3080
Let G be a -free graph with edge ideal . We show that has linear resolution for every . Also, we show that every power of the vertex cover ideal of G has linear quotients. As a result, we describe the Castelnuovo–Mumford regularity of powers of in terms of the maximum degree of G. 相似文献
5.
6.
7.
8.
We construct invariant polynomials on truncated multicurrent algebras, which are Lie algebras of the form , where is a finite-dimensional Lie algebra over a field of characteristic zero, and I is a finite-codimensional ideal of generated by monomials. In particular, when is semisimple and 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 . As an application of our main result, we show that the center of the universal enveloping algebra of acts trivially on all irreducible finite-dimensional representations provided I has codimension at least two. 相似文献
9.
11.
The notion of multiple Ore extension is introduced as a natural generalization of Ore extensions and double Ore extensions. For a PBW-deformation of type 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 . Moreover, we analyze the quantum algebras with of type , and and give some examples and counterexamples that can be realized by a ladder Ore extension. 相似文献
12.
Becky Armstrong Lisa Orloff Clark Kristin Courtney Ying-Fen Lin Kathryn McCormick Jacqui Ramagge 《Journal of Pure and Applied Algebra》2022,226(3):106853
We introduce twisted Steinberg algebras over a commutative unital ring R. These generalise Steinberg algebras and are a purely algebraic analogue of Renault's twisted groupoid C*-algebras. In particular, for each ample Hausdorff groupoid G and each locally constant 2-cocycle σ on G taking values in the units , we study the algebra consisting of locally constant compactly supported R-valued functions on G, with convolution and involution “twisted” by σ. We also introduce a “discretised” analogue of a twist Σ over a Hausdorff étale groupoid G, and we show that there is a one-to-one correspondence between locally constant 2-cocycles on G and discrete twists over G admitting a continuous global section. Given a discrete twist Σ arising from a locally constant 2-cocycle σ on an ample Hausdorff groupoid G, we construct an associated twisted Steinberg algebra , and we show that it coincides with . Given any discrete field , we prove a graded uniqueness theorem for , and under the additional hypothesis that G is effective, we prove a Cuntz–Krieger uniqueness theorem and show that simplicity of is equivalent to minimality of G. 相似文献
13.
14.
Julia Semikina 《Journal of Pure and Applied Algebra》2019,223(10):4509-4523
I. Hambleton, L. Taylor and B. Williams conjectured a general formula in the spirit of H. Lenstra for the decomposition of for any finite group G and noetherian ring R. The conjectured decomposition was shown to hold for some large classes of finite groups. D. Webb and D. Yao discovered that the conjecture failed for the symmetric group , but remarked that it still might be reasonable to expect the HTW-decomposition for solvable groups. In this paper we show that the solvable group is also a counterexample to the conjectured HTW-decomposition. Nevertheless, we prove that for any finite group G the rank of does not exceed the rank of the expression in the HTW-decomposition. We also show that the HTW-decomposition predicts correct torsion for for any finite group G. Furthermore, we prove that for any degree other than the conjecture gives a correct prediction for the rank of . 相似文献
15.
16.
《Discrete Mathematics》2022,345(1):112631
For a graph , a total ordering L on V, and a vertex , let be the set of vertices for which there is a path from v to w whose length is 0, 1 or 2 and whose L-least vertex is w. The weak 2-coloring number of G is the least k such that there is a total ordering L on V with for all vertices . We improve the known upper bound on the weak 2-coloring number of planar graphs from 28 to 23. As the weak 2-coloring number is the best known upper bound on the star list chromatic number of planar graphs, this bound is also improved. 相似文献
17.
《Discrete Mathematics》2022,345(4):112784
A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to a vertex in S. If, in addition, every vertex in S is adjacent to some other vertex in S, then S is a total dominating set. The domination number of G is the minimum cardinality of a dominating set in G, while the total domination number of G is the minimum cardinality of total dominating set in G. A claw-free graph is a graph that does not contain as an induced subgraph. Let G be a connected, claw-free, cubic graph of order n. We show that if we exclude two graphs, then , and this bound is best possible. In order to prove this result, we prove that if we exclude four graphs, then , and this bound is best possible. These bounds improve previously best known results due to Favaron and Henning (2008) [7], Southey and Henning (2010) [19]. 相似文献
18.
《Discrete Mathematics》2022,345(8):112902
For a simple graph G, denote by n, , and its order, maximum degree, and chromatic index, respectively. A graph G is edge-chromatic critical if and for every proper subgraph H of G. Let G be an n-vertex connected regular class 1 graph, and let be obtained from G by splitting one vertex of G into two vertices. Hilton and Zhao in 1997 conjectured that must be edge-chromatic critical if , and they verified this when . In this paper, we prove it for . 相似文献
19.
20.