共查询到20条相似文献,搜索用时 15 毫秒
1.
Tathagata Basak 《Journal of Pure and Applied Algebra》2018,222(10):3036-3042
2.
The purpose of this note is to show a new series of examples of homogeneous ideals I in for which the containment fails. These ideals are supported on certain arrangements of lines in , which resemble Fermat configurations of points in , see [14]. All examples exhibiting the failure of the containment constructed so far have been supported on points or cones over configurations of points. Apart from providing new counterexamples, these ideals seem quite interesting on their own. 相似文献
3.
Aysel Erey 《Discrete Mathematics》2018,341(5):1419-1431
4.
5.
Houssein El Turkey 《Journal of Pure and Applied Algebra》2018,222(1):181-190
The complexity of a module is the rate of growth of the minimal projective resolution of the module while the z-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let () be the type II orthosymplectic Lie superalgebra of types B or D. In this paper, we compute the complexity and the z-complexity of the simple finite-dimensional -supermodules. We then give these complexities certain geometric interpretations using support and associated varieties. 相似文献
6.
7.
8.
Dennis I. Merino 《Linear algebra and its applications》2012,436(7):1960-1968
9.
10.
11.
12.
13.
Vladimir Shchigolev 《Journal of Algebra》2009,321(5):1453-1462
14.
15.
Haiyang Zhu Lianying Miao Sheng Chen Xinzhong Lü Wenyao Song 《Discrete Mathematics》2018,341(8):2211-2219
Let be the set of all positive integers. A list assignment of a graph is a function that assigns each vertex a list for all . We say that is --choosable if there exists a function such that for all , if and are adjacent, and if and are at distance 2. The list--labeling number of is the minimum such that for every list assignment , is --choosable. We prove that if is a planar graph with girth
and its maximum degree is large enough, then . There are graphs with large enough and having . 相似文献
16.
17.
18.
19.