Algebraic properties of classes of path ideals of posets

We consider path ideals associated to special classes of posets such as tree posets and cycles. We express their property of being sequentially Cohen–Macaulay in terms of the underlying poset. Moreover, monomial ideals, which arise in algebraic statistics from the Luce-decomposable model and the ascending model, can be viewed as path ideals of certain posets. We study invariants of these so-called Luce-decomposable monomial ideals and ascending ideals for diamond posets and products of chains. In particular, for these classes of posets, we explicitly compute their Krull dimension, their projective dimension, their Castelnuovo–Mumford regularity and their Betti numbers.     

On orbits of order ideals of minuscule posets

An action on order ideals of posets considered by Fon-Der-Flaass is analyzed in the case of posets arising from minuscule representations of complex simple Lie algebras. For these minuscule posets, it is shown that the Fon-Der-Flaass action exhibits the cyclic sieving phenomenon, as defined by Reiner, Stanton, and White. A uniform proof is given by investigation of a bijection due to Stembridge between order ideals of minuscule posets and fully commutative Weyl group elements. This bijection is proven to be equivariant with respect to a conjugate of the Fon-Der-Flaass action and an arbitrary Coxeter element. If P is a minuscule poset, it is shown that the Fon-Der-Flaass action on order ideals of the Cartesian product P×[2] also exhibits the cyclic sieving phenomenon, only the proof is by appeal to the classification of minuscule posets and is not uniform.     

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.     

On the order of prime ideals

A posetX is isomorphic to the poset of all prime ideals of a (distributive) lattice with zero and unit if, and only if,X is the projective limit of an inverse system of finite posets.     

Pattern avoidance and the Bruhat order

The structure of order ideals in the Bruhat order for the symmetric group is elucidated via permutation patterns. The permutations with boolean principal order ideals are characterized. These form an order ideal which is a simplicial poset, and its rank generating function is computed. Moreover, the permutations whose principal order ideals have a form related to boolean posets are also completely described. It is determined when the set of permutations avoiding a particular set of patterns is an order ideal, and the rank generating functions of these ideals are computed. Finally, the Bruhat order in types B and D is studied, and the elements with boolean principal order ideals are characterized and enumerated by length.     

A self paired Hopf algebra on double posets and a Littlewood-Richardson rule

Let D be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On ZD we define a product and a coproduct, together with an internal product, that is, degree-preserving. With these operations ZD is a Hopf algebra. We define a symmetric bilinear form on this Hopf algebra: it counts the number of pictures (in the sense of Zelevinsky) between two double posets. This form is a Hopf pairing, which means that product and coproduct are adjoint each to another. The product and coproduct correspond respectively to disjoint union of posets and to a natural decomposition of a poset into order ideals. Restricting to special double posets (meaning that the second order is total), we obtain a notion equivalent to Stanley's labelled posets, and a Hopf subalgebra already considered by Blessenohl and Schocker. The mapping which maps each double poset onto the sum of the linear extensions of its first order, identified via its second (total) order with permutations, is a Hopf algebra homomorphism, which is isometric and preserves the internal product, onto the Hopf algebra of permutations, previously considered by the two authors. Finally, the scalar product between any special double poset and double posets naturally associated to integer partitions is described by an extension of the Littlewood-Richardson rule.     

Topologies on products of partially ordered sets II: Ideal topologies

Within the theory of ideals in partially ordered sets, several difficulties set in which do not occur in the special case of lattices (or bidirected posets). For example, a finite product of ideals in the factor posets need not be an ideal in the product poset. The notion ofstrict ideals is introduced in order to remedy some deficiencies occurring in the general case of an arbitrary product of posets. Besides other results, we show the following main theorem: The ideal topology (cf. [2]) of a product of non-trivial posets coincides with the product topology if and only if the number of factors is finite (4.19.). Presented by L. Fuchs     

Rank polynomials of fence posets are unimodal

We prove a conjecture of Morier-Genoud and Ovsienko that says that rank polynomials of the distributive lattices of lower ideals of fence posets are unimodal. We do this by proving a stronger version of the conjecture due to McConville, Sagan, and Smyth. Our proof involves introducing a related class of posets, which we call circular fence posets and showing that their rank polynomials are symmetric. We also apply the recent work of Elizalde, Plante, Roby, and Sagan on rowmotion on fences and show many of their homomesy results hold for the circular case as well.     

Integral bilinear forms, Coxeter transformations and Coxeter polynomials of finite posets

Linear algebra technique in the study of linear representations of finite posets is developed in the paper. A concept of a quadratic wandering on a class of posets I is introduced and finite posets I are studied by means of the four integral bilinear forms (1.1), the associated Coxeter transformations, and the Coxeter polynomials (in connection with bilinear forms of Dynkin diagrams, extended Dynkin diagrams and irreducible root systems are also studied). Bilinear equivalences between some of the forms are established and equivalences with the bilinear forms of Dynkin diagrams and extended Dynkin diagrams are discussed. A homological interpretation of the bilinear forms (1.1) is given and Z-bilinear equivalences between them are discussed. By applying well-known results of Bongartz, Loupias, and Zavadskij-Shkabara, we give several characterisations of posets I, with the Euler form weakly positive (resp. with the reduced Euler form weakly positive), and posets I, with the Tits form weakly positive.     

Semiprime Ideals and Separation Theorems for Posets

The concept of a semiprime ideal in a poset is introduced. The relations between the semiprime (prime) ideals of a poset and the ideals of the set of all ideals of the poset are established. A result analogous to Separation Theorem is obtained in respect of semiprime ideals. Further, a generalization of Stone’s Separation Theorem for posets is obtained in respect of prime ideals. Some counterexamples are also given.      

Incidence categories

Given a family F of posets closed under disjoint unions and the operation of taking convex subposets, we construct a category C_F called the incidence category ofF. This category is “nearly abelian” in the sense that all morphisms have kernels/cokernels, and possesses a symmetric monoidal structure akin to direct sum. The Ringel-Hall algebra of C_F is isomorphic to the incidence Hopf algebra of the collection P(F) of order ideals of posets in F. This construction generalizes the categories introduced by K. Kremnizer and the author, in the case when F is the collection of posets coming from rooted forests or Feynman graphs.     

偏序集中的弱理想和弱滤子

在偏序集上利用上集算子和下集算子引入了弱理想,弱滤子,弱素理想,弱素滤子,弱极大理想和弱极大滤子等概念,研究了它们的若干性质,同时给出了偏序集上的(DPI),(BPI),(DMI),(BUF)公理并建立了它们与Zorn引理之问的相互关系.     

Distributive lattices of small width, II: A problem from Stanley's 1986 text Enumerative Combinatorics

In Richard P. Stanley's 1986 text, Enumerative Combinatorics, the following problem is posed: Fix a natural number k. Consider the posets P of cardinality n such that, for 0<i<n, P has exactly k order ideals (down-sets) of cardinality i. Let fk(n) be the number of such posets. What is the generating function ∑f₃(n)xn?In this paper, the problem is solved.     

Riesz ideals in generalized effect algebras and in their unitizations

We show that quotients of generalized effect algebras by Riesz ideals preserve some important special properties, e.g., homogeneity and hereditary Riesz decomposition properties; moreover, quotients of generalized orthoalgebras, weak generalized orthomodular posets, generalized orthomodular lattices and generalized MV-algebras with respect to Riesz ideals belong to the same class. We give a necessary and sufficient condition under which a Riesz ideal I of a generalized effect algebra P is a Riesz ideal also in the unitization E of P. We also study relations between Riesz ideals and central elements in GEAs and in their unitizations. In the last section, we demonstrate the notion of Riesz ideals by some illustrative examples. Received June 28, 2005; accepted in final form January 23, 2007.     

On derived equivalences of categories of sheaves over finite posets

A finite poset X carries a natural structure of a topological space. Fix a field k, and denote by D^b(X) the bounded derived category of sheaves of finite dimensional k-vector spaces over X. Two posets X and Y are said to be derived equivalent if D^b(X) and D^b(Y) are equivalent as triangulated categories.We give explicit combinatorial properties of X which are invariant under derived equivalence; among them are the number of points, the Z-congruency class of the incidence matrix, and the Betti numbers. We also show that taking opposites and products preserves derived equivalence.For any closed subset Y⊆X, we construct a strongly exceptional collection in D^b(X) and use it to show an equivalence D^b(X)?D^b(A) for a finite dimensional algebra A (depending on Y). We give conditions on X and Y under which A becomes an incidence algebra of a poset.We deduce that a lexicographic sum of a collection of posets along a bipartite graph S is derived equivalent to the lexicographic sum of the same collection along the opposite .This construction produces many new derived equivalences of posets and generalizes other well-known ones.As a corollary we show that the derived equivalence class of an ordinal sum of two posets does not depend on the order of summands. We give an example that this is not true for three summands.     

On nilpotent ideals in the cohomology ring of a finite group

In this paper we find upper bounds for the nilpotency degree of some ideals in the cohomology ring of a finite group by studying fixed point free actions of the group on suitable spaces. The ideals we study are the kernels of restriction maps to certain collections of proper subgroups. We recover the Quillen-Venkov lemma and the Quillen F-injectivity theorem as corollaries, and discuss some generalizations and further applications.We then consider the essential cohomology conjecture, and show that it is related to group actions on connected graphs. We discuss an obstruction for constructing a fixed point free action of a group on a connected graph with zero “k-invariant” and study the class related to this obstruction. It turns out that this class is a “universal essential class” for the group and controls many questions about the groups essential cohomology and transfers from proper subgroups.     

N-free posets as generalizations of series-parallel posets

N-Free posets have recently taken some importance and motivated many studies. This class of posets introduced by Grillet [8] and Heuchenne [11] are very related to another important class of posets, namely the series-parallel posets, introduced by Lawler [12] and studied by Valdes et al. [21]. This paper shows how N-free posets can be considered as generalizations of series-parallel posets, by giving a recursive construction of N-free posets. Furthermore we propose a linear time algorithm to recognize and decompose any N-free poset. This yields some very naturel problems, namely: which are the properties(such as linear time algorithm for some invariant) of series-parallel posets that are kept for N-free posets?     

Crown multiplications and a higher order Hopf construction

We describe a ternary function (multiplication) from the product of three 12-point crowns into a 4-point crown in the category of partially ordered sets. The ternary map illustrates a version, in the context of posets, of associative multiplication. A higher order analogue of Hopf's construction applied to σ yields a poset model of a certain homotopy class, which we identify, in π₅(S³).