Reduced Decompositions with One Repetition and Permutation Pattern Avoidance

In 2007, Tenner established a connection between pattern avoidance in permutations and the Bruhat order on permutations by showing that the downset of a permutation in the Bruhat order is a Boolean algebra if and only if the permutation is 3412 and 321 avoiding. Tenner conjectured, but did not prove, that if the permutation is 321 avoiding and contains exactly one 3412 pattern, or if the permutation is 3412 avoiding and contains exactly one 321 pattern, then there exists a reduced decomposition with precisely one repetition. This property actually characterizes permutations with precisely one repetition. The goal of this paper is to prove this equivalence as a first step in our program to count permutations with few repetitions of 321 and 3412 and to understand Bruhat downsets by means of pattern avoidance.     

A Suspension Lemma for Bounded Posets

LetPandQbe bounded posets. In this note, a lemma is introduced that provides a set of sufficient conditions for the proper part ofPbeing homotopy equivalent to the suspension of the proper part ofQ. An application of this lemma is a unified proof of the sphericity of the higher Bruhat orders under both inclusion order (which is a known result) and single step inclusion order (which was not known so far).     

Antichain Cutsets of Strongly Connected Posets

Rival and Zaguia showed that the antichain cutsets of a finite Boolean lattice are exactly the level sets. We show that a similar characterization of antichain cutsets holds for any strongly connected poset of locally finite height. As a corollary, we characterize the antichain cutsets in semimodular lattices, supersolvable lattices, Bruhat orders, locally shellable lattices, and many more. We also consider a generalization to strongly connected d-uniform hypergraphs.     

Initial Chain Algebras on Pseudotrees

We investigate a new class of Boolean algebra, called initial chain algebras on pseudotrees. We discuss the relationship between this class and other classes of Boolean algebras. Every interval algebra, and hence every countable Boolean algebra, is an initial chain algebra. Every initial chain algebra on a tree is a superatomic Boolean algebra, and every initial chain algebra on a pseudotree is a minimally-generated Boolean algebra.We show that a free product of two infinite Boolean algebras is an initial chain algebra if and only if both factors are countable.     

A refinement of Stone duality to skew Boolean algebras

We establish two theorems that refine the classical Stone duality between generalized Boolean algebras and locally compact Boolean spaces. In the first theorem, we prove that the category of left-handed skew Boolean algebras whose morphisms are proper skew Boolean algebra homomorphisms is equivalent to the category of étale spaces over locally compact Boolean spaces whose morphisms are étale space cohomomorphisms over continuous proper maps. In the second theorem, we prove that the category of left-handed skew Boolean -algebras whose morphisms are proper skew Boolean -algebra homomorphisms is equivalent to the category of étale spaces with compact clopen equalizers over locally compact Boolean spaces whose morphisms are injective étale space cohomomorphisms over continuous proper maps.     

Order Continuity of Locally Compact Boolean Algebras

The main purpose of this paper is to exhibit the decisive role that order continuity plays in the structure of locally compact Boolean algebras as well as in that of atomic topological Boolean algebras. We prove that the following three conditions are equivalent for a topological Boolean algebra B: (1) B is compact; (2) B is locally compact, Boolean complete, order continuous; (3) B is Boolean complete, atomic and order continuous. Note that under the discrete topology any Boolean algebra is locally compact.     

Coxeter groups,Coxeter monoids and the Bruhat order

Associated with any Coxeter group is a Coxeter monoid, which has the same elements, and the same identity, but a different multiplication. (Some authors call these Coxeter monoids 0-Hecke monoids, because of their relation to the 0-Hecke algebras—the q=0 case of the Hecke algebra of a Coxeter group.) A Coxeter group is defined as a group having a particular presentation, but a pair of isomorphic groups could be obtained via non-isomorphic presentations of this form. We show that when we have both the group and the monoid structure, we can reconstruct the presentation uniquely up to isomorphism and present a characterisation of those finite group and monoid structures that occur as a Coxeter group and its corresponding Coxeter monoid. The Coxeter monoid structure is related to this Bruhat order. More precisely, multiplication in the Coxeter monoid corresponds to element-wise multiplication of principal downsets in the Bruhat order. Using this property and our characterisation of Coxeter groups among structures with a group and monoid operation, we derive a classification of Coxeter groups among all groups admitting a partial order.     

Maximal Condorcet Domains

A Condorcet domain is a subset of the set of linear orders on a finite set of candidates (alternatives to vote), such that if voters preferences are linear orders belonging to this subset, then the simple majority rule does not yield cycles. It is well-known that the set of linear orders is the Bruhat lattice. We prove that a maximal Condorcet domain is a distributive sublattice in the Bruhat lattice. An explicit lattice formula for the simple majority rule is given. We introduce the notion of a symmetric Condorcet domain and characterize symmetric Condorcet domains of maximal size.     

A Theorem on Higher Bruhat Orders

We show that inclusion order and single-step inclusion coincide for higher Bruhat orders B(n,2) , i.e., . Received April 7, 1998.     

Fixed Points of Zircon Automorphisms

A zircon is a poset in which every principal order ideal is finite and equipped with a so-called special matching. We prove that the subposet induced by the fixed points of any automorphism of a zircon is itself a zircon. This provides a natural context in which to view recent results on Bruhat orders on twisted involutions in Coxeter groups.     

完备布尔代数商格的注

本文研究了完备布尔代数L的商格Q(L),建立 L上q-集构成的集合Q′(L)与Q(L)之间的同构,得出了完备布尔代数的商格仍是完备布尔代数,并给出了完备布尔代数范畴的某些性质.     

Mask Formulas for Cograssmannian Kazhdan-Lusztig Polynomials

We give two constructions of sets of masks on cograssmannian permutations that can be used in Deodhar’s formula for Kazhdan–Lusztig basis elements of the Iwahori–Hecke algebra. The constructions are respectively based on a formula of Lascoux–Schützenberger and its geometric interpretation by Zelevinsky. The first construction relies on a basis of the Hecke algebra constructed from principal lower order ideals in Bruhat order and a translation of this basis into sets of masks. The second construction relies on an interpretation of masks as cells of the Bott–Samelson resolution. These constructions give distinct answers to a question of Deodhar.     

On the Flag f-vector of a Graded Lattice with Nontrivial Homology

It is proved that the Boolean algebra of rank n minimizes the flag f-vector among all graded lattices of rank n, whose proper part has nontrivial top-dimensional homology. The analogous statement for the flag h-vector is conjectured in the Cohen-Macaulay case.     

关于Robbins代数与Heyting代数的类似性质

Ｓ．Ｗｉｎｋｅｒ在文〔１〕中给出了Ｒｏｂｂｉｎｓ代数成为Ｂｏｏｌｅａｎ代数的一个较弱的条件。本文将讨论Ｈｅｙｔｉｎｇ代数成为Ｂｏｏｌｅａｎ代数的条件，我们发现Ｈｅｙｉｎｇ代数成为Ｂｏｏｌｅａｎ代数的条件与Ｒｏｂｂｉｎｓ代数成为Ｂｏｏｌｅａｎ代数的条件相似，从而提示了Ｈｅｙｔｉｎｇ代数与Ｒｏｂｂｉｎｓ代数之间具有一定的关系。     

关于蕴涵BCK—代数的伴随半群

我们证明了蕴涵BCK-代数的伴随半群是一个上半格;具有条件（s)的蕴涵BCK-代数的伴随半群是一个广义布尔代数。更进一步证明了有界蕴涵BCK-代数的伴随半群是一个布尔代数。     

The Boolean algebra of the theory of linear orders

We characterize the isomorphism type of the Boolean algebra of sentences of the theory of linear orders. It is isomorphic to the sentence algebras of the theory of equivalence relations, the theory of permutations and the theory of well-orderings. This work was partially supported by the National Science Foundation under research grant MCS 76-07249.     

Pattern avoidance and Boolean elements in the Bruhat order on involutions

We show that the principal order ideal of an element w in the Bruhat order on involutions in a symmetric group is a Boolean lattice if and only if w avoids the patterns 4321, 45312 and 456123. Similar criteria for signed permutations are also stated. Involutions with this property are enumerated with respect to natural statistics. In this context, a bijective correspondence with certain Motzkin paths is demonstrated. This article is largely based on results from the second author’s M.Sc. thesis [15].     

Projectivity,prime ideals,and chain conditions of Stone algebras

Some properties of projective stone algebras are exhibited, which are connected with the ordered set of prime ideals. From this we derive a simple characterization of finite projective Stone algebras, and of those projective Stone algebras, whose centre is a projective Boolean algebra, and whose dense set is a projective Stone algebras, whose centre is a projective Boolean algebra, and whose dense set is a projective distributive lattice. Finally, we give some conditions under which a Stone algebra has no chains of type λ, where λ is an infinite regular cardinal. The results of this paper are part of the author's Ph.D. Thesis written under the direction of S. Koppelberg. The author wishes to express his gratitude to Prof. Koppelberg for her guidance and her patience. Presented by K. A. Baker.     

Order topology in vector lattices with closure by one step

An order topology in vector lattices and Boolean algebras is studied under the additional condition of “closure by one step” that generalizes the well-known “regularity” property of Boolean algebras and K-spaces. It is proved that in a vector lattice or a Boolean algebra possessing such a property there exists a basis of solid neighborhoods of zero with respect to an order topology. An example of a Boolean algebra without basis of solid neighborhoods of zero (an algebra of regular open subsets of the interval (0, 1)) is given. Bibliography: 3 titles. Translated fromProblemy Matematicheskogo Analiza, No. 15 1995, pp. 213–220.     

Sets of reflections defining twisted Bruhat orders

Twisted Bruhat orders are certain partial orders on a Coxeter system (W,S) associated to initial sections of reflection orders, which are certain subsets of the set of reflections T of a Coxeter system. We determine which subsets of T give rise to a partial order on W in the same way.