We investigate the minimal graded free resolutions of ideals of at most n + 1 fat points in general position in Pn. Our main theorem is that these ideals are componentwise linear. This result yields a number of corollaries, including the multiplicity conjecture of Herzog, Huneke, and Srinivasan in this case. On the computational side, using an iterated mapping cone process, we compute formulas ...

For certain families of multivariable vector-valued functions to be approximated, the accuracy of approximation schemes made up of linear combinations of computational units containing adjustable parameters is investigated. Upper bounds on the approximation error are derived that depend on the Rademacher complexities of the families. The estimates exploit possible relationships among the compon...

a celebrated result of i. schur asserts that the derived subgroup of a group is finite provided the group modulo its center is finite, a result that has been the source of many investigations within the theory of groups. in this paper we exhibit a similar result to schur's theorem for vector spaces, acted upon by certain groups. the proof of this analogous result depends on the characteristic o...

A perturbation matrix A = A is considered, where A 2 IR and 0 2 IR. The matrix A is singular i A contains a real singular matrix. A problem is to decide if A is singular or nonsingular, a NP-hard problem. The decision can be made by the computation of the componentwise distance to the nearest singular matrix de ned on the basis of the real spectral radius, and by the solution of 4 eigenvalue pr...

By defining two important terms called basic perturbation vectors and obtaining their linear bounds, we obtain the componentwise bounds for unitary factors upper triangular of generalized Schur decomposition. The diagonal elements invariant subspace are also derived. From former, present an bound a condition number eigenvalue. Furthermore, with numerical iterative method, nonlinear decompositio...

In order to understand knowledge acquisition in autonomous systems, we introduce a representational framework in which knowledge about the world is represented as a point in a knowledge space. This is a homogeneous linear space, with an unusual vector product (the componentwise multiplication of vectors). We demonstrate how motions in the world lead to an induced linear transformation on the kn...

Let G be a simple undirected graph on n vertices, and let I(G) ⊆ R = k[x1, . . . , xn] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi’s theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and impl...

A number of optimization methods require as a rst step the construction of a dominating set (a set containing an optimal solution) enjoying properties such as compactness or convexity. In this note we address the problem of constructing dominating sets for problems whose objective is a componentwise nondecreasing function of (possibly an in nite number of) convex functions, and we show how to o...

In classical linear algebra, the eigenvalues of a matrix are sometimes defined as the roots of the characteristic polynomial. An algorithm to compute the roots of a polynomial by computing the eigenvalues of the corresponding companion matrix turns the tables on the usual definition. We derive a firstorder error analysis of this algorithm that sheds light on both the underlying geometry of the ...