The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic monomial ideals. The second one is an incremental algorithm, which computes decompositions of ideals by adding one generator at a time. Our analysis shows that th...

In this paper we primarily study monomial ideals and their minimal free resolutions by studying their associated lcm-lattices. In particular, we formally define the notion of coordinatizing a finite atomic lattice P to produce a monomial ideal whose lcm-lattice is P , and we give a characterization of all such coordinatizations. We prove that all relations in the lattice L(n) of all finite atom...

In recent work, Clark and Tchernev introduced the notion of monomial resolution supported on a poset. In this talk, I will review this notion, and the related notion of monomial resolution supported on a CW complex. I will discuss a result of mine that shows that resolutions supported on a CW complex are also supported on the face poset of a CW complex. This relates to the work of Clark and Tch...

We characterize monomial ideals which are intersections of powers of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.

We show that the number of elements generating a squarefree monomial ideal up to radical can always be bounded above in terms of the number of its minimal monomial generators and the maximal height of its minimal primes.

We characterize the approximate monomial complexity, sign monomial complexity, and the approximate L1 norm of symmetric functions in terms of simple combinatorial measures of the functions. Our characterization of the approximate L1 norm solves the main conjecture in [AFH12]. As an application of the characterization of the sign monomial complexity, we prove a conjecture in [ZS09] and provide a...

Let K be a eld; let P K n be a nite set and let =(P) Kx 1 ; : : :; x n ] be the ideal of P. A purely combinatorial algorithm to obtain a linear basis of the quotient algebra Kx 1 ; : : :; x n ]==(P) is given. Such a basis is represented by an n-dimensional Ferrers diagram of monomials which is minimal with respect to the inverse lexicographical order i:l:. It is also shown how this algorithm ca...

We consider algebras over a field K defined by a presentation K〈x1, . . . , xn : R〉, where R consists of ( n 2 ) square-free relations of the form xixj = xkxl with every monomial xixj , i 6= j, appearing in one of the relations. Certain sufficient conditions for the algebra to be noetherian and PI are determined. For this, we prove more generally that right noetherian algebras of finite Gelfand...

Nowadays polynomial system solvers are involved in sophisticated computations in algebraic geometry as well as in practical engineering. The most popular algorithms are based on Gröbner bases, resultants, Macaulay matrices, or triangular decompositions. In all these algorithms, multivariate polynomials are expanded in a monomial basis, and the computations mainly reduce to linear algebra. The m...