A maximum principle for combinatorial Yamabe flow

This article studies a discrete geometric structure on triangulated manifolds and an associated curvature flow (combinatorial Yamabe flow). The associated evolution of curvature appears to be like a heat equation on graphs, but it can be shown to not satisfy the maximum principle. The notion of a parabolic-like operator is introduced as an operator which satisfies the maximum principle, but may not be parabolic in the usual sense of operators on graphs. A maximum principle is derived for the curvature of combinatorial Yamabe flow under certain assumptions on the triangulation, and hence the heat operator is shown to be parabolic-like. The maximum principle then allows a characterization of the curvature as well was a proof of long term existence of the flow.     

Associated radical ideals of monomial ideals

Algebraic and combinatorial properties of a monomial ideal are studied in terms of its associated radical ideals. In particular, we present some applications to the symbolic powers of square-free monomial ideals.     

On the index of powers of edge ideals

The index of a graded ideal measures the number of linear steps in the graded minimal free resolution of the ideal. In this paper, we study the index of powers and squarefree powers of edge ideals. Our results indicate that the index as a function of the power of an edge ideal I is strictly increasing if I is linearly presented. Examples show that this needs not to be the case for monomial ideals generated in degree greater than two.     

On the regularity of -Borel ideals

In this paper we prove Pardue's conjecture on the regularity of principal -Borel ideals. As a consequence we obtain an upper bound for the regularity of general -Borel ideals.

     

Coherent sequences of polynomial ideals on Banach spaces

This article deals with the relationship between an operator ideal and its natural polynomial extensions. We define the concept of coherent sequence of polynomial ideals and also the notion of compatibility between polynomial and operator ideals. We study the stability of these properties for maximal and minimal hulls, adjoint and composition ideals. We also relate these concepts with conditions on the underlying tensor norms (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Stability of associated primes of integral closures of monomial ideals

Let I be a monomial ideal of a polynomial ring R=K[X₁,…,Xr] and d(I) the maximal degree of minimal generators of I. In this paper, we explicitly determine a number n₀ in terms of r and d(I) such that for all n?n₀. Furthermore, our n₀ is almost sharp.     

Multiplier ideals of hyperplane arrangements

In this note we compute multiplier ideals of hyperplane arrangements. This is done using the interpretation of multiplier ideals in terms of spaces of arcs by Ein, Lazarsfeld, and Mustata (2004).

     

The core of zero-dimensional monomial ideals

The core of an ideal is the intersection of all its reductions. We describe the core of a zero-dimensional monomial ideal I as the largest monomial ideal contained in a general reduction of I. This provides a new interpretation of the core in the monomial case as well as an efficient algorithm for computing it. We relate the core to adjoints and first coefficient ideals, and in dimension two and three we give explicit formulas.     

Path ideals of rooted trees and their graded Betti numbers

Let Γ be a rooted (and directed) tree, and let t be a positive integer. The path ideal It(Γ) is generated by monomials that correspond to directed paths of length (t−1) in Γ. In this paper, we study algebraic properties and invariants of It(Γ). We give a recursive formula to compute the graded Betti numbers of It(Γ) in terms of path ideals of subtrees. We also give a general bound for the regularity, explicitly compute the linear strand, and investigate when It(Γ) has a linear resolution.     

U-factorization of ideals

We study the factorization of ideals of a commutative ring, in the context of the U-factorization framework introduced by Fletcher. This leads to several “U-factorability” properties weaker than unique U-factorization. We characterize these notions, determine the implications between them, and give several examples to illustrate the differences. For example, we show that a ring is a general ZPI-ring if and only if its monoid of ideals has unique factorization in the sense of Fletcher. We also examine how these “U-factorability” properties behave with respect to several ring-theoretic constructions.     

A combinatorial property of ideals in free profinite monoids

A combinatorial property of ideals in free profinite monoids is proved.     

A class of square-free monomial ideals associated to two integer sequences

Given two finite sequences of positive integers α and β, we associate a square-free monomial ideal I_α,β in a ring of polynomials S, and we recursively compute the algebraic invariants of S∕I_α,β. Also, we give precise formulas in special cases.     

Core and residual intersections of ideals

D. Rees and J. Sally defined the core of an -ideal as the intersection of all (minimal) reductions of . However, it is not easy to give an explicit characterization of it in terms of data attached to the ideal. Until recently, the only case in which a closed formula was known is the one of integrally closed ideals in a two-dimensional regular local ring, due to C. Huneke and I. Swanson. The main result of this paper explicitly describes the core of a broad class of ideals with good residual properties in an arbitrary local Cohen-Macaulay ring. We also find sharp bounds on the number of minimal reductions that one needs to intersect to get the core.

     

On Whitney numbers of the order ideals of generalized fences and crowns

We solve some recurrences given by E. Munarini and N. Zagaglia Salvi proving explicit formulas for Whitney numbers of the distributive lattices of order ideals of the fence poset and crown poset. Moreover, we get a method to obtain explicit formulas for Whitney numbers of lattices of order ideals of fences with higher asymmetric peaks.     

Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph ℋ appears within the resolution of its edge ideal ℐ(ℋ). We discuss when recursive formulas to compute the graded Betti numbers of ℐ(ℋ) in terms of its sub-hypergraphs can be obtained; these results generalize our previous work (Hà, H.T., Van Tuyl, A. in J. Algebra 309:405–425, 2007) on the edge ideals of simple graphs. We introduce a class of hypergraphs, which we call properly-connected, that naturally generalizes simple graphs from the point of view that distances between intersecting edges are “well behaved.” For such a hypergraph ℋ (and thus, for any simple graph), we give a lower bound for the regularity of ℐ(ℋ) via combinatorial information describing ℋ and an upper bound for the regularity when ℋ=G is a simple graph. We also introduce triangulated hypergraphs that are properly-connected hypergraphs generalizing chordal graphs. When ℋ is a triangulated hypergraph, we explicitly compute the regularity of ℐ(ℋ) and show that the graded Betti numbers of ℐ(ℋ) are independent of the ground field. As a consequence, many known results about the graded Betti numbers of forests can now be extended to chordal graphs. Dedicated to Anthony V. Geramita on the occasion of his 65th birthday.     

On the regularity of binomial edge ideals

We study the regularity of binomial edge ideals. For a closed graph G we show that the regularity of the binomial edge ideal coincides with the regularity of and can be expressed in terms of the combinatorial data of G. In addition, we give positive answers to Matsuda‐Murai conjecture 8 for some classes of graphs.     

Specializations of Ferrers ideals

We introduce a specialization technique in order to study monomial ideals that are generated in degree two by using our earlier results about Ferrers ideals. It allows us to describe explicitly a cellular minimal free resolution of various ideals including any strongly stable and any squarefree strongly stable ideal whose minimal generators have degree two. In particular, this shows that threshold graphs can be obtained as specializations of Ferrers graphs, which explains their similar properties.     

环中关于理想同余的粗糙集的性质

讨论了环中由理想同余关系所决定的下、上近似的一些特殊性质．