Criteria for Componentwise Linearity

We establish characteristic-free criteria for the componentwise linearity of graded ideals. As applications, we classify the componentwise linear ideals among the Gorenstein ideals, the standard determinantal ideals, and the ideals generated by the submaximal minors of a symmetric matrix.     

The Lefschetz Property for Componentwise Linear Ideals and Gotzmann Ideals

Abstract

For standard graded Artinian K-algebras defined by componentwise linear ideals and Gotzmann ideals, we give conditions for the weak Lefschetz property in terms of numerical invariants of the defining ideals.     

Toric rings arising from vertex cover ideals

We extend the sortability concept to monomial ideals which are not necessarily generated in one degree and as an application we obtain normal Cohen-Macaulay toric rings attached to vertex cover ideals of graphs. Moreover, we consider a construction on a graph called a clique multi-whiskering which always produces vertex cover ideals with componentwise linear powers.     

Monomial localizations and polymatroidal ideals

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree monomial ideals where it is equivalent to a well-known characterization of matroids. We prove our conjecture in many other special cases. We also introduce the concept of componentwise polymatroidal ideals and extend several of the results known for polymatroidal ideals to this new class of ideals.     

t-Spread strongly stable monomial ideals*

We introduce the concept of t-spread monomials and t-spread strongly stable ideals. These concepts are a natural generalization of strongly stable and squarefree strongly stable ideals. For the study of this class of ideals we use the t-fold stretching operator. It is shown that t-spread strongly stable ideals are componentwise linear. Their height, their graded Betti numbers and their generic initial ideal are determined. We also consider the toric rings whose generators come from t-spread principal Borel ideals.     

Chorded complexes and a necessary condition for a monomial ideal to have a linear resolution

In this paper we extend one direction of Fröberg?s theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the introduction of d-chorded and orientably-d-cycle-complete simplicial complexes. We show that a certain class of simplicial complexes, the d-dimensional trees, correspond to ideals having linear resolutions over fields of characteristic 2 and we also give a necessary combinatorial condition for a monomial ideal to be componentwise linear over all fields.     

Rigid resolutions and big Betti numbers

The Betti-numbers of a graded ideal I in a polynomial ring and the Betti-numbers of its generic initial ideal Gin(I) are compared. In characteristic zero it is shown that if these Betti-numbers coincide in some homological degree, then they coincide in all higher homological degrees. We also compare the Betti-numbers of componentwise linear ideals which are contained in each other and have the same Hilbert polynomial.     

Integrally closed and componentwise linear ideals

In a two dimensional regular local ring integrally closed ideals have a unique factorization property and their associated graded ring is Cohen–Macaulay. In higher dimension these properties do not hold and the goal of the paper is to identify a subclass of integrally closed ideals for which they do. We restrict our attention to 0-dimensional homogeneous ideals in polynomial rings R of arbitrary dimension. We identify a class of integrally closed ideals, the Goto-class G^*{\mathcal {G}^*}, which is closed under product and it has a suitable unique factorization property. Ideals in G^*{\mathcal {G}^*} have a Cohen–Macaulay associated graded ring if either they are monomial or dim R ≤ 3. Our approach is based on the study of the relationship between the notions of integrally closed, contracted, full and componentwise linear ideals.     

Examples of refinable componentwise polynomials

This short note presents four examples of compactly supported symmetric refinable componentwise polynomial functions: (i) a componentwise constant interpolatory continuous refinable function and its derived symmetric tight wavelet frame; (ii) a componentwise constant continuous orthonormal and interpolatory refinable function and its associated symmetric orthonormal wavelet basis; (iii) a differentiable symmetric componentwise linear polynomial orthonormal refinable function; (iv) a symmetric refinable componentwise linear polynomial which is interpolatory and differentiable.     

Using dual techniques to derive componentwise and mixed condition numbers for a linear function of a linear least squares solution

We prove duality results for adjoint operators and product norms in the framework of Euclidean spaces. We show how these results can be used to derive condition numbers especially when perturbations on data are measured componentwise relatively to the original data. We apply this technique to obtain formulas for componentwise and mixed condition numbers for a linear function of a linear least squares solution. These expressions are closed when perturbations of the solution are measured using a componentwise norm or the infinity norm and we get an upper bound for the Euclidean norm.      

Equivalent condition for approximately Cohen–Macaulay complexes

We give a necessary and sufficient condition for a simplicial complex to be approximately Cohen–Macaulay. Namely it is approximately Cohen–Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear and generated in two consecutive degrees. This completes the result of J. Herzog and T. Hibi who proved that a simplicial complex is sequentially Cohen–Macaulay if and only if the ideal associated to its Alexander dual is componentwise linear.     

Improved componentwise verified error bounds for least squares problems and underdetermined linear systems

Recently Miyajima presented algorithms to compute componentwise verified error bounds for the solution of full-rank least squares problems and underdetermined linear systems. In this paper we derive simpler and improved componentwise error bounds which are based on equalities for the error of a given approximate solution. Equalities are not improvable, and the expressions are formulated in a way that direct evaluation yields componentwise and rigorous estimates of good quality. The computed bounds are correct in a mathematical sense covering all sources of errors, in particular rounding errors. Numerical results show a gain in accuracy compared to previous results.     

Efficient numerical methods for pricing American options under stochastic volatility

Five numerical methods for pricing American put options under Heston's stochastic volatility model are described and compared. The option prices are obtained as the solution of a two‐dimensional parabolic partial differential inequality. A finite difference discretization on nonuniform grids leading to linear complementarity problems with M‐matrices is proposed. The projected SOR, a projected multigrid method, an operator splitting method, a penalty method, and a componentwise splitting method are considered. The last one is a direct method while all other methods are iterative. The resulting systems of linear equations in the operator splitting method and in the penalty method are solved using a multigrid method. The projected multigrid method and the componentwise splitting method lead to a sequence of linear complementarity problems with one‐dimensional differential operators that are solved using the Brennan and Schwartz algorithm. The numerical experiments compare the accuracy and speed of the considered methods. The accuracies of all methods appear to be similar. Thus, the additional approximations made in the operator splitting method, in the penalty method, and in the componentwise splitting method do not increase the error essentially. The componentwise splitting method is the fastest one. All multigrid‐based methods have similar rapid grid independent convergence rates. They are about two or three times slower that the componentwise splitting method. On the coarsest grid the speed of the projected SOR is comparable with the multigrid methods while on finer grids it is several times slower. ©John Wiley & Sons, Inc. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

The Hilbert functions which force the Weak Lefschetz Property

The purpose of this note is to characterize the finite Hilbert functions which force all of their artinian algebras to enjoy the Weak Lefschetz Property (WLP). Curiously, they turn out to be exactly those (characterized by Wiebe in [A. Wiebe, The Lefschetz property for componentwise linear ideals and Gotzmann ideals, Comm. Algebra 32 (12) (2004) 4601-4611]) whose Gotzmann ideals have the WLP.This implies that, if a Gotzmann ideal has the WLP, then all algebras with the same Hilbert function (and hence lower Betti numbers) have the WLP as well. However, we will answer in the negative, even in the case of level algebras, the most natural question that one might ask after reading the previous sentence: If A is an artinian algebra enjoying the WLP, do all artinian algebras with the same Hilbert function as A and Betti numbers lower than those of A have the WLP as well?Also, as a consequence of our result, we have another (simpler) proof of the fact that all codimension 2 algebras enjoy the WLP (this fact was first proven in [T. Harima, J. Migliore, U. Nagel, J. Watanabe, The weak and strong Lefschetz properties for Artinian K-algebras, J. Algebra 262 (2003) 99-126], where it was shown that even the Strong Lefschetz Property holds).     

On mixed and componentwise condition numbers for Moore-Penrose inverse and linear least squares problems

Classical condition numbers are normwise: they measure the size of both input perturbations and output errors using some norms. To take into account the relative of each data component, and, in particular, a possible data sparseness, componentwise condition numbers have been increasingly considered. These are mostly of two kinds: mixed and componentwise. In this paper, we give explicit expressions, computable from the data, for the mixed and componentwise condition numbers for the computation of the Moore-Penrose inverse as well as for the computation of solutions and residues of linear least squares problems. In both cases the data matrices have full column (row) rank.

     

On condition numbers for Moore–Penrose inverse and linear least squares problem involving Kronecker products

In this paper, we investigate the normwise, mixed, and componentwise condition numbers and their upper bounds for the Moore–Penrose inverse of the Kronecker product and more general matrix function compositions involving Kronecker products. We also present the condition numbers and their upper bounds for the associated Kronecker product linear least squares solution with full column rank. In practice, the derived upper bounds for the mixed and componentwise condition numbers for Kronecker product linear least squares solution can be efficiently estimated using the Hager–Higham Algorithm. Copyright © 2012 John Wiley & Sons, Ltd.     

A condition analysis of the weighted linear least squares problem using dual norms

In this paper, based on the theory of adjoint operators and dual norms, we define condition numbers for a linear solution function of the weighted linear least squares problem. The explicit expressions of the normwise and componentwise condition numbers derived in this paper can be computed at low cost when the dimension of the linear function is low due to dual operator theory. Moreover, we use the augmented system to perform a componentwise perturbation analysis of the solution and residual of the weighted linear least squares problems. We also propose two efficient condition number estimators. Our numerical experiments demonstrate that our condition numbers give accurate perturbation bounds and can reveal the conditioning of individual components of the solution. Our condition number estimators are accurate as well as efficient.     

Positive solutions of positive linear systems

Easily verifiable sufficient conditions are obtained for the existence of a positive solution (componentwise) of a linear nonhomogeneous system of equations with positive coefficients.     

解一类线性互补问题的区间方法

1引言线性互补问题简记为LCP(M,q)是指对给定的n×n阶实方阵M和N维实向量q,求满足下列条件的实向量x：x≥0,Mx q≥0,(1．1) x~T(Mx q)=0．它在工程物理、管理学、经济学、约束最优化等领域有着广泛的应用背景．备受人们关注     

Note on bounds for multiplicities

Let S=K[x₁,…,x_n] be a polynomial ring and R=S/I be a graded K-algebra where I⊂S is a graded ideal. Herzog, Huneke and Srinivasan have conjectured that the multiplicity of R is bounded above by a function of the maximal shifts in the minimal graded free resolution of R over S. We prove the conjecture in the case that codim(R)=2 which generalizes results in (J. Pure Appl. Algebra 182 (2003) 201; Trans. Amer. Math. Soc. 350 (1998) 2879). We also give a proof for the bound in the case in which I is componentwise linear. For example, stable and squarefree stable ideals belong to this class of ideals.