Prime ideals in 0-distributive posets

In the first section of this paper, we prove an analogue of Stone’s Theorem for posets satisfying DCC by using semiprime ideals. We also prove the existence of prime ideals in atomic posets in which atoms are dually distributive. Further, it is proved that every maximal non-dense (non-principal) ideal of a 0-distributive poset (meet-semilattice) is prime. The second section focuses on the characterizations of (minimal) prime ideals in pseudocomplemented posets. The third section deals with the generalization of the classical theorem of Nachbin. In fact, we prove that a dually atomic pseudocomplemented, 1-distributive poset is complemented if and only if the poset of prime ideals is unordered. In the last section, we have characterized 0-distributive posets by means of prime ideals and minimal prime ideals.     

A note on neutral elements in posets

Neutral elements and central elements are characterized in different classes of posets such as sectionally semi-complemented posets, atomistic posets etc.      

Big elements in irreducible linear groups

Let V be a linear space over a field K of dimension n > 1, and let \({G \leq {\rm GL}(V)}\) be an irreducible linear group. In this paper we prove that the group G contains an element g such that rank \({(g - \alpha E_{n}) \geq \frac{n}{2}}\) for every \({\alpha \in K}\) , where E _n is the identity operator on V. This estimate is sharp for any \({n = 2^{m}}\) . The existence of such an element implies that the conjugacy class of G in GL(V) intersects the big Bruhat cell \({B\dot{w}_{0}B}\) of GL(V) non-trivially (here B is a fixed Borel subgroup of G). The latter fact is equivalent to the existence of a complete flag \({\mathfrak{F}}\) such that the flags \({g(\mathfrak{F}), \mathfrak{F}}\) are in general position for some g ∈ G.     

On irreducible elements of semilattices

The concept of (join)-irreducible elements works well, especially for distributive lattices. Therefore our definition of elements of a given degree of irreducibility employs the notion of distributivity as much as possible, even if the irreducibility is defined for elements of a (meet)-semilattice. Via the lattice of hereditary subsets of the poset ofk-irreducible elements of a semilattice (wherek is a cardinal) we obtain a new construction of a D1_k-reflection (a sort of free distributive extension) of the semilattice, provided that there are sufficiently manyk-irreducible elements. The last property is satisfied, for example, if the original semilattice is the dual of an algebraic lattice [Dilworth and Crawley, 1960], but this condition is too restrictive for semilattices. It turns out that, under certain limitations, the D1_k-reflection of a semilattice both preserves and reflects the degree of irreducibility.Presented by R. Freese.     

Prime elements from prime ideals

The prime ideal theorem for distributive lattices (PIT) is shown to imply that any complete distributive lattice with a compact unit has a prime element, which is then used to deduce from PIT that (1) every nontrivial ring with unit has a prime ideal, and (2) every Wallman locale is spatial.     

GCD matrices,posets, and nonintersecting paths

We show that with any finite partially ordered set P (which need not be a lattice) one can associate a matrix whose determinant factors nicely. This was also noted by D.A. Smith, although his proof uses manipulations in the incidence algebra of P while ours is combinatorial, using nonintersecting paths in a digraph. As corollaries, we obtain new proofs for and generalizations of a number of results in the literature about GCD matrices and their relatives.     

On coatoms in lattices of quasivarieties of algebraic systems

It is found the necessary condition for the lattice of quasivarieties has a finite set of coatoms. In particular if a quasivariety is generated by a finitely generated abelian-by-polycyclic-by-finite group or a totally ordered group then it has a finite set of proper maximal subquasivarieties. Also it is proved that the set of quasiverbal congruence relations of a finitely defined universal algebra is closed under any meets. Received March 23, 1999; accepted in final form June 7, 1999.     

Incidence posets of trees in posets of large dimension

In this paper, we investigate substructures of partially ordered sets which must be present whenever the dimension is large. We show that for eachn1, ifT is a tree onn vertices and ifP is any poset having dimension at least 4n ⁶, then eitherP or its dual contains the incidence poset ofT as a suborder.     

半群的完全素和素模糊理想

通过由模糊点生成的模糊理想给出了半单半群的刻画。同时也刻画了两类半群：一类是所有模糊理想是素理想。另一类是所有模糊理想为安全素理想。     

Socles of Buchsbaum modules, complexes and posets

The socle of a graded Buchsbaum module is studied and is related to its local cohomology modules. This algebraic result is then applied to face enumeration of Buchsbaum simplicial complexes and posets. In particular, new necessary conditions on face numbers and Betti numbers of such complexes and posets are established. These conditions are used to settle in the affirmative Kühnel's conjecture for the maximum value of the Euler characteristic of a 2k-dimensional simplicial manifold on n vertices as well as Kalai's conjecture providing a lower bound on the number of edges of a simplicial manifold in terms of its dimension, number of vertices, and the first Betti number.     

On chains and Sperner k-families in ranked posets,II

A ranked poset P satisfies condition S if for all k the set of elements of the k largest ranks in P is a Sperner k-family. It satisfies condition T if for all k there exist disjoint chains in P which each meet the k largest ranks and which cover the kth largest rank. Griggs employed the theory of saturated partitions to prove that if P satisfies S it also satisfies T, and that the converse is true for posets with unimodal Whitney numbers. Here we present new proofs of these facts which do not require the existence of saturated partitions. The first result is proven with a simple network flow argument and the second is proven directly.