We use the theory of poset resolutions to construct the minimal free resolution of an arbitrary stable monomial ideal in the polynomial ring whose coefficients are from a field. This resolution is recovered by utilizing a poset of Eliahou-Kervaire admissible symbols associated to a stable ideal. The structure of the poset under consideration is quite rich and in related analysis, we exhibit a r...

In this paper, we investigate the Möbius function μS associated to a (locally finite) poset arising from a semigroup S of Zm. We introduce and develop a new approach to study μS by using the Hilbert series of S. The latter enables us to provide formulas for μS when S belongs to certain families of semigroups. Finally, a characterization for a locally finite poset to be isomorphic to a semigroup...

Brualdi et al. introduced the concept of poset codes, and gave an example of poset structure which admits the extended binary Hamming code to be a double-error-correcting perfect P-code. Our study is motivated by this example. In this paper we classify all poset structures which admit the extended binary Hamming code to be a double or triple-error-correcting perfect P-code. © 2004 Elsevier B.V....

Let Q(k, l) be a poset whose Hasse diagram is a regular spider with k+1 legs having the same length l (cf. Fig. 1). We show that for any n ≥ 1 the nth cartesian power of the spider poset Q(k, l) is a Macaulay poset for any k ≥ 0 and l ≥ 1. In combination with our recent results [2] this provides a complete characterization of all Macaulay posets which are cartesian powers of upper semilattices,...

We study differential posets, a family of partially ordered sets discovered by Richard Stanley. In the first half of this paper we present an introduction to poset theory as relevant to differential posets and theorems on the structure and combinatorial properties of differential posets, culminating in the explicit definition of a new differential poset. In the second half we focus on Young’s l...

A t-box representation of a graph encodes each vertex as a box in t-space determined by the (integer) coordinates of its lower and upper corner, such that vertices are adjacent if and only if the corresponding boxes intersect. The boxicity of a graph G is the minimum t for which this can be done; equivalently, it is the minimum t such that G can be expressed as the intersection graph of interva...

The notation and terminology used here are introduced in the following papers: [18], [13], [17], [14], [19], [7], [1], [8], [6], [20], [3], [9], [2], [10], [15], [16], [5], [11], [4], and [12]. Let us observe that there exists a lattice which is finite. Let us mention that every lattice which is finite is also complete. Let L be a lattice and let D be a subset of the carrier of L. The functor D...

We study the poset of Borel congruence classes of symmetric matrices ordered by containment of closures. We give a combinatorial description of this poset and calculate its rank function. We discuss the relation between this poset and the Bruhat poset of involutions of the symmetric group. Also we present the poset of Borel congruence classes of anti-symmetric matrices ordered by containment of...

In this paper we study topological properties of the poset of injective words and the lattice of classical non-crossing partitions. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these posets are doubly Cohen-Macaulay. This extends the well-known result that those posets are shellable. Both results rely on a new poset fiber theorem, for doubly homo...

In this paper we study pseudoultrametrics, which are a natural mixture of ultrametrics and pseudometrics. They satisfy stronger form the triangle inequality than usual pseudometrics naturally arise in problems classification recognition. The text focuses on partial order set all pseudoultrametrics fixed (not necessarily finite) set. addition to “way below” relation induced by order, introduce i...