The Degree and Regularity of Vanishing Ideals of Algebraic Toric Sets Over Finite Fields

Let X* be a subset of an affine space 𝔸 ^s , over a finite field K, which is parameterized by the edges of a clutter. Let X and Y be the images of X* under the maps x → [x] and x → [(x, 1)], respectively, where [x] and [(x, 1)] are points in the projective spaces ? ^s?1 and ? ^s , respectively. For certain clutters and for connected graphs, we were able to relate the algebraic invariants and properties of the vanishing ideals I(X) and I(Y). In a number of interesting cases, we compute its degree and regularity. For Hamiltonian bipartite graphs, we show the Eisenbud–Goto regularity conjecture. We give optimal bounds for the regularity when the graph is bipartite. It is shown that X* is an affine torus if and only if I(Y) is a complete intersection. We present some applications to coding theory and show some bounds for the minimum distance of parameterized linear codes for connected bipartite graphs.     

Depth of Initial Ideals of Normal Edge Rings

Let G be a finite graph on the vertex set [d] = {1,…, d} with the edges e ₁,…, e _n and K[t] = K[t ₁,…, t _d ] the polynomial ring in d variables over a field K. The edge ring of G is the semigroup ring K[G] which is generated by those monomials t ^e  = t _i t _j such that e = {i, j} is an edge of G. Let K[x] = K[x ₁,…, x _n ] be the polynomial ring in n variables over K, and define the surjective homomorphism π: K[x] → K[G] by setting π(x _i ) = t ^{e _i} for i = 1,…, n. The toric ideal I _G of G is the kernel of π. It will be proved that, given integers f and d with 6 ≤ f ≤ d, there exists a finite connected nonbipartite graph G on [d] together with a reverse lexicographic order <_rev on K[x] and a lexicographic order <_lex on K[x] such that (i) K[G] is normal with Krull-dim K[G] = d, (ii) depth K[x]/in_<rev (I _G ) = f and K[x]/in_<lex (I _G ) is Cohen–Macaulay, where in_<rev (I _G ) (resp., in_<lex (I _G )) is the initial ideal of I _G with respect to <_rev (resp., <_lex) and where depth K[x]/in_<rev (I _G ) is the depth of K[x]/in_<rev (I _G ).     

Generalizations of Prime Ideals

Let R be a commutative ring with identity. Various generalizations of prime ideals have been studied. For example, a proper ideal I of R is weakly prime (resp., almost prime) if a, b ∈ R with ab ∈ I ? {0} (resp., ab ∈ I ? I ²) implies a ∈ I or b ∈ I. Let φ:?(R) → ?(R) ∪ {?} be a function where ?(R) is the set of ideals of R. We call a proper ideal I of R a φ-prime ideal if a, b ∈ R with ab ∈ I ? φ(I) implies a ∈ I or b ∈ I. So taking φ_?(J) = ? (resp., φ₀(J) = 0, φ₂(J) = J ²), a φ_?-prime ideal (resp., φ₀-prime ideal, φ₂-prime ideal) is a prime ideal (resp., weakly prime ideal, almost prime ideal). We show that φ-prime ideals enjoy analogs of many of the properties of prime ideals.     

The Inclusion Ideal Graph of Rings

Let R be a ring with unity. The inclusion ideal graph of a ring R, denoted by In(R), is a graph whose vertices are all nontrivial left ideals of R and two distinct left ideals I and J are adjacent if and only if I ? J or J ? I. In this paper, we show that In(R) is not connected if and only if R ? M ₂(D) or D ₁ × D ₂, for some division rings, D, D ₁ and D ₂. Moreover, we prove that if In(R) is connected, then diam(In(R)) ≤3. It is shown that if In(R) is a tree, then In(R) is a caterpillar with diam(In(R)) ≤3. Also, we prove that the girth of In(R) belongs to the set {3, 6, ∞}. Finally, we determine the clique number and the chromatic number of the inclusion ideal graph for some classes of rings.     

On Generalized Stable Ideals

An ideal I of a ring R is generalized stable in case aR + bR = R with a ∈ I, b ∈ R implies that there exist s, t ∈ 1 + I such that s(a + by)t = 1 for a y ∈ R. We establish, in this article, necessary and sufficient conditions for an ideal of a regular ring to be generalized stable. It is shown that every regular square matrix over such ideals admits a diagonal reduction. These extend the corresponding results of generalized stable regular rings.     

Nested Log-Concavity

We give conditions on the coefficients of a polynomial p(x) so that p(x + t) be log-concave or strictly log-concave. Several applications are given: if p(x) is a polynomial with nonnegative and nondecreasing coefficients, then p(x + t) is strictly log-concave for all t ≥ 1; for any polynomial p(x) with positive leading coefficient, there is t ₀ ≥ 0 such that for any t ≥ t ₀ it holds that the coefficients of p(x + t) are positive, strictly decreasing, and strictly log-concave; if p(x) is a log-concave polynomial with nonnegative coefficients and no internal zeros, then p(x + t) is strictly log-concave for all t > 0; Betti numbers of lexsegment monomial ideals are strictly log-concave.     

Characterizations of *-Cancellation Ideals of an Integral Domain

Let D be an integral domain and * a star-operation on D. For a nonzero ideal I of D, let I ^{* _f} = ?{J* | (0) ≠ J ? I is finitely generated} and I ^{* _w} = ? _{P∈* f -Max(D)} ID _P . A nonzero ideal I of D is called a *-cancellation ideal if (IA)* = (IB)* for nonzero ideals A and B of D implies A* =B*. Let X be an indeterminate over D and N _* = {f ∈ D[X] | (c(f))* =D}. We show that I is a * _w -cancellation ideal if and only if I is * _f -locally principal, if and only if ID[X] _{N *} is a cancellation ideal. As a corollary, we have that each nonzero ideal of D is a * _w -cancellation ideal if and only if D _P is a principal ideal domain for all P ∈ * _f -Max(D), if and only if D[X] _{N *} is an almost Dedekind domain. We also show that if I is a * _w -cancellation ideal of D, then I ^{* _w}  = I ^{* _f}  = I _t , and I is * _w -invertible if and only if I ^{* _w}  = J _v for a nonzero finitely generated ideal J of D.     

Expected hitting and cover times of random walks on some special graphs

We give general bounds (and in some cases exact values) for the expected hitting and cover times of the simple random walk on some special undirected connected graphs using symmetry and properties of electrical networks. In particular we give easy proofs for an N–1H_N-1 lower bound and an N² upper bound for the cover time of symmetric graphs and for the fact that the cover time of the unit cube is Φ(NlogN). We giver a counterexample to a conjecture of Freidland about a general bound for hitting times. Using the electric approach, we provide some genral upper and lower bounds for the expected cover times in terms of the diameter of the graph. These bounds are tight in many instances, particularly when the graph is a tree. © 1994 John Wiley & Sons, Inc.     

Algebraic Properties of the Path Ideal of a Tree

The path ideal (of length t ≥ 2) of a directed graph Γ is the monomial ideal, denoted I _t (Γ), whose generators correspond to the directed paths of length t in Γ. We study some of the algebraic properties of I _t (Γ) when Γ is a tree. We first show that I _t (Γ) is the facet ideal of a simplicial tree. As a consequence, the quotient ring R/I _t (Γ) is always sequentially Cohen–Macaulay, and the Betti numbers of R/I _t (Γ) do not depend upon the characteristic of the field. We study the case of the line graph in greater detail at the end of the article. We give an exact formula for the projective dimension of these ideals, and in some cases, we compute their arithmetical rank.     

On n-Absorbing Ideals of Commutative Rings

Let R be a commutative ring with 1 ≠ 0 and n a positive integer. In this article, we study two generalizations of a prime ideal. A proper ideal I of R is called an n-absorbing (resp., strongly n-absorbing) ideal if whenever x ₁…x _n+1 ∈ I for x ₁,…, x _n+1 ∈ R (resp., I ₁…I _n+1 ? I for ideals I ₁,…, I _n+1 of R), then there are n of the x _i 's (resp., n of the I _i 's) whose product is in I. We investigate n-absorbing and strongly n-absorbing ideals, and we conjecture that these two concepts are equivalent. In particular, we study the stability of n-absorbing ideals with respect to various ring-theoretic constructions and study n-absorbing ideals in several classes of commutative rings. For example, in a Noetherian ring every proper ideal is an n-absorbing ideal for some positive integer n, and in a Prüfer domain, an ideal is an n-absorbing ideal for some positive integer n if and only if it is a product of prime ideals.     

Full Ideals

Contractedness of 𝔪-primary integrally closed ideals played a central role in the development of Zariski's theory of integrally closed ideals in two-dimensional regular local rings (R, 𝔪). In such rings, the contracted 𝔪-primary ideals are known to be characterized by the property that I: 𝔪 = I: x for some x ∈ 𝔪 ?𝔪². We call the ideals with this property full ideals and compare this class of ideals with the classes of 𝔪-full ideals, basically full ideals, and contracted ideals in higher dimensional regular local rings. The 𝔪-full ideals are easily seen to be full. In this article, we find a sufficient condition for a full ideal to be 𝔪-full. We also show the equivalence of the properties full, 𝔪-full, contracted, integrally closed, and normal, for the class of parameter ideals. We then find a sufficient condition for a basically full parameter ideal to be full.     

Resolutions of Facet Ideals

Abstract

In this paper we study the resolution of a facet ideal associated with a special class of simplicial complexes introduced by Faridi. These simplicial complexes are called trees, and are a generalization (to higher dimensions) of the concept of a tree in graph theory. We show that the Koszul homology of the facet ideal I of a tree is generated by the homology classes of monomial cycles, determine the projective dimension and the regularity of I if the tree is 1-dimensional, show that the graded Betti numbers of I satisfy an alternating sum property if the tree is connected in codimension 1, and classify all trees whose facet ideal has a linear resolution.     

Minimal Generating Sets for Relative Ideals in Numerical Semigroups of Multiplicity Eight

Abstract

Let S be a numerical semigroup and let I be a relative ideal of S. Let S ? I denote the dual of I and let μ _S (?) represent the size of a minimal generating set. We investigate the inequality μ _S (I)μ _S (S ? I) ≥ μ _S (I + (S ? I)) under the assumption that S has multiplicity 8. We will show that if I is non-principal, then the strict inequality μ _S (I)μ _S (S ? I) > μ _S (I + (S ? I)) always holds.     

Perfect Pairs of Ideals and Duals in Numerical Semigroups

This article considers numerical semigroups S that have a nonprincipal relative ideal I such that μ _S (I)μ _S (S ? I) = μ _S (I + (S ? I)). We show the existence of an infinite family of such pairs (S, I) in which I + (S ? I) = S\{0}. We also show examples of such pairs that are not members of this family. We discuss the computational process used to find these examples and present some open questions pertaining to them.     

Fiber Coefficients and Depth of Fiber Cones

Let (R, 𝔪) be a Cohen–Macaulay local ring of dimension d > 0, I an 𝔪-primary ideal of R, and K an ideal containing I. When r(I | K)<∞, we give a lower bound and an upper bound for f ₁(I). Under the above assumption on r(I | K) and depth G(I) ≥ d ? 1, we also provide a characterization, in terms of f ₁(I), of the condition depth F _K (I) ≥ d ? 1.     

On the graph for which there is a tree as the inverse interchange graph of a local graph

Let G be a finite, connected, undirected graph without loops and multiple edges. The note modifies slightly the concept of I^–1 (T_t), the inverse interchange graph of the local graph G(T_t) defined by a reference tree t G, and considers the properties of the graph G, when I^–1(T_t) is a tree.     

Presimplifiable and Cyclic Group Rings

Let R be any commutative ring with identity, and let C be a (finite or infinite) cyclic group. We show that the group ring R(C) is presimplifiable if and only if its augmentation ideal I(C) is presimplifiable. We conjecture that the group rings R(C _n ) are presimplifiable if and only if n = p ^m , p ∈ J(R), p is prime, and R is presimplifiable. We show the necessity of n = p ^m , and we prove the sufficiency when n = 2, 3, 4. These results were made possible by a new formula derived herein for the circulant determinantal coefficients.     

Primes and Right Ideals in Right Cones

A right cone H in a group G is a submonoid of G that generates G and aH ? bH for a, b ? H implies bH ? aH. With any right ideal I ≠ H of H a completely prime ideal P _r (I) of H is associated and the set 𝒫(I) of right ideals I′ of H with the same associated prime ideal P′ =P _r (I) is determined if P′·? P″ is a right invariant segment in H. The set 𝒫(I) is also described if P _r (I) is a limit prime.