scholarly journals On the Stanley Depth of Powers of Monomial Ideals

Mathematics ◽  
2019 ◽  
Vol 7 (7) ◽  
pp. 607 ◽  
Author(s):  
S. A. Seyed Fakhari
Keyword(s):  
Polynomial Ring ◽  
Upper Bound ◽  
Integral Closure ◽  
Monomial Ideals ◽  
The Other ◽  
Finitely Generated ◽  
Stanley Depth ◽  
Survey Article ◽  
Symbolic Powers ◽  
Other Hand

In 1982, Stanley predicted a combinatorial upper bound for the depth of any finitely generated multigraded module over a polynomial ring. The predicted invariant is now called the Stanley depth. Duval et al. found a counterexample for Stanley’s conjecture, and their counterexample is a quotient of squarefree monomial ideals. On the other hand, there is evidence showing that Stanley’s inequality can be true for high powers of monomial ideals. In this survey article, we collect the recent results in this direction. More precisely, we investigate the Stanley depth of powers, integral closure of powers, and symbolic powers of monomial ideals.

scholarly journals A BOUND FOR THE INDEX OF A QUADRATIC FORM AFTER SCALAR EXTENSION TO THE FUNCTION FIELD OF A QUADRIC

2018 ◽  
Vol 19 (2) ◽  
pp. 421-450 ◽  
Author(s):  
Stephen Scully
Keyword(s):  
Quadratic Form ◽  
Upper Bound ◽  
Function Field ◽  
The Other ◽  
Direct Generalization ◽  
Other Hand ◽  
General Field ◽  
The One ◽  
Anisotropic Quadratic Form

Let $q$ be an anisotropic quadratic form defined over a general field $F$. In this article, we formulate a new upper bound for the isotropy index of $q$ after scalar extension to the function field of an arbitrary quadric. On the one hand, this bound offers a refinement of an important bound established in earlier work of Karpenko–Merkurjev and Totaro; on the other hand, it is a direct generalization of Karpenko’s theorem on the possible values of the first higher isotropy index. We prove its validity in two key cases: (i) the case where $\text{char}(F)\neq 2$, and (ii) the case where $\text{char}(F)=2$ and $q$ is quasilinear (i.e., diagonalizable). The two cases are treated separately using completely different approaches, the first being algebraic–geometric, and the second being purely algebraic.

scholarly journals Stanley’s conjecture for critical ideals

2011 ◽  
Vol 48 (2) ◽  
pp. 220-226
Author(s):  
Azeem Haider ◽  
Sardar Khan
Keyword(s):  
Polynomial Ring ◽  
Hilbert Function ◽  
Monomial Ideal ◽  
Monomial Ideals ◽  
Stanley Depth

Let S = K[x1,…,xn] be a polynomial ring in n variables over a field K. Stanley’s conjecture holds for the modules I and S/I, when I ⊂ S is a critical monomial ideal. We calculate the Stanley depth of S/I when I is a canonical critical monomial ideal. For non-critical monomial ideals we show the existence of a Stanley ideal with the same depth and Hilbert function.

scholarly journals Stanley depth and symbolic powers of monomial ideals

2017 ◽  
Vol 120 (1) ◽  
pp. 5 ◽  
Author(s):  
S. A. Seyed Fakhari
Keyword(s):  
Monomial Ideal ◽  
Monomial Ideals ◽  
Limit Behavior ◽  
Stanley Depth ◽  
Symbolic Powers

The aim of this paper is to study the Stanley depth of symbolic powers of a squarefree monomial ideal. We prove that for every squarefree monomial ideal $I$ and every pair of integers $k, s\geq 1$, the inequalities $\mathrm{sdepth} (S/I^{(ks)}) \leq \mathrm{sdepth} (S/I^{(s)})$ and $\mathrm{sdepth}(I^{(ks)}) \leq \mathrm{sdepth} (I^{(s)})$ hold. If moreover $I$ is unmixed of height $d$, then we show that for every integer $k\geq1$, $\mathrm{sdepth}(I^{(k+d)})\leq \mathrm{sdepth}(I^{{(k)}})$ and $\mathrm{sdepth}(S/I^{(k+d)})\leq \mathrm{sdepth}(S/I^{{(k)}})$. Finally, we consider the limit behavior of the Stanley depth of symbolic powers of a squarefree monomial ideal. We also introduce a method for comparing the Stanley depth of factors of monomial ideals.

scholarly journals Generating Adjoint Groups

2019 ◽  
Vol 62 (3) ◽  
pp. 733-738 ◽  
Author(s):  
Be'eri Greenfeld
Keyword(s):  
Open Problem ◽  
Jacobson Radical ◽  
The Other ◽  
Adjoint Group ◽  
Finitely Generated ◽  
Infinite Dimensional ◽  
Other Hand ◽  
Nil Ring

AbstractWe prove two approximations of the open problem of whether the adjoint group of a non-nilpotent nil ring can be finitely generated. We show that the adjoint group of a non-nilpotent Jacobson radical cannot be boundedly generated and, on the other hand, construct a finitely generated, infinite-dimensional nil algebra whose adjoint group is generated by elements of bounded torsion.

scholarly journals Unique factorization in the ring R[x]

1992 ◽  
Vol 53 (3) ◽  
pp. 287-293 ◽  
Author(s):  
Raymond A. Beauregard
Keyword(s):  
Left Ideal ◽  
Polynomial Ring ◽  
The Other ◽  
Unique Factorization ◽  
Ideal Domain ◽  
Unique Factorization Domain ◽  
Other Hand ◽  
Reasonable Sense

AbstractIf R is a commutative unique factorization domain (UFD) then so is the ring R[x]. If R is not commutative then no such result is possible. An example is given of a bounded principal right and left ideal domain R, hence a similarity-UFD, for which the polynomial ring R[x] in a central indeterminate x is not a UFD in any reasonable sense. On the other hand, it is shown that if R is an invariant UFD then R[x] is a UFD in an appropriate sense.

ON THE STANLEY DEPTH AND SIZE OF MONOMIAL IDEALS

2017 ◽  
Vol 59 (3) ◽  
pp. 705-715
Author(s):  
S. A. SEYED FAKHARI
Keyword(s):  
Lower Bound ◽  
Polynomial Ring ◽  
Monomial Ideal ◽  
Recursive Formula ◽  
Monomial Ideals ◽  
Stanley Depth

AbstractLet $\mathbb{K}$ be a field and S = ${\mathbb{K}}$[x1, . . ., xn] be the polynomial ring in n variables over the field $\mathbb{K}$. For every monomial ideal I ⊂ S, we provide a recursive formula to determine a lower bound for the Stanley depth of S/I. We use this formula to prove the inequality sdepth(S/I) ≥ size(I) for a particular class of monomial ideals.

scholarly journals The structure and the list 3-dynamic coloring of outer-1-planar graphs

2021 ◽  
Vol vol. 23, no. 3 (Graph Theory) ◽  
Author(s):  
Yan Li ◽  
Xin Zhang
Keyword(s):  
Planar Graph ◽  
Chromatic Number ◽  
Upper Bound ◽  
Local Structure ◽  
Planar Graphs ◽  
Minimum Degree ◽  
Outer Region ◽  
The Other ◽  
Structural Theorem ◽  
Other Hand

An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge. This paper establishes the local structure of outer-1-planar graphs by proving that each outer-1-planar graph contains one of the seventeen fixed configurations, and the list of those configurations is minimal in the sense that for each fixed configuration there exist outer-1-planar graphs containing this configuration that do not contain any of another sixteen configurations. There are two interesting applications of this structural theorem. First of all, we conclude that every (resp. maximal) outer-1-planar graph of minimum degree at least 2 has an edge with the sum of the degrees of its two end-vertices being at most 9 (resp. 7), and this upper bound is sharp. On the other hand, we show that the list 3-dynamic chromatic number of every outer-1-planar graph is at most 6, and this upper bound is best possible.

On the reduction numbers of monomial ideals

2019 ◽  
Vol 19 (10) ◽  
pp. 2050201
Author(s):  
Ibrahim Al-Ayyoub
Keyword(s):  
Polynomial Ring ◽  
Monomial Ideal ◽  
Upper Bounds ◽  
Integral Closure ◽  
Monomial Ideals ◽  
Explicit Method ◽  
Generating Set ◽  
Ideal Formula ◽  
Reduction Number ◽  
The Ideal

Let [Formula: see text] be a monomial ideal in a polynomial ring with two indeterminates over a field. Assume [Formula: see text] is contained in the integral closure of some ideal that is generated by two elements from the generating set of [Formula: see text]. We produce sharp upper bounds for each of the reduction number and the Ratliff–Rush reduction number of the ideal [Formula: see text]. Under certain hypotheses, we give the exact values of these reduction numbers, and we provide an explicit method for obtaining these sharp upper bounds.

Sign in / Sign up

Export Citation Format

Share Document