Strong Sperner property of the subgroup lattice of an Abelianp-group

Letn andk be arbitrary positive integers,p a prime number and L_(k ⁿ)(p) the subgroup lattice of the Abelianp-group (Z/p ^k ) ⁿ . Then there is a positive integerN(n,k) such that whenp N(n,k),L _(k ^N )(p) has the strong Sperner property.     

On the existence of symmetric chain decompositions in a quotient of the Boolean lattice

We highlight a question about binary necklaces, i.e., equivalence classes of binary strings under rotation. Is there a way to choose representatives of the n-bit necklaces so that the subposet of the Boolean lattice induced by those representatives has a symmetric chain decomposition? Alternatively, is the quotient of the Boolean lattice , under the action of the cyclic group Z_n, a symmetric chain order? The answer is known to be yes for all prime n and for composite n≤18, but otherwise the question appears to be open. In this note we describe how it suffices to focus on subposets induced by necklaces with periodic block codes, substantially reducing the size of the problem. We mention a motivating application: determining whether minimum-region rotationally symmetric independent families of n curves exist for all n.     

Games of Chains and Cutsets in the Boolean Lattice II

Let 2 ^[n] denote the poset of all subsets of [n]={1,2,...,n} ordered by inclusion. Following Gutterman and Shahriari (Order 14, 1998, 321–325) we consider a game G _n (a,b,c). This is a game for two players. First, Player I constructs a independent maximal chains in 2 ^[n]. Player II will extend the collection to a+b independent maximal chains by finding another b independent maximal chains in 2 ^[n]. Finally, Player I will attempt to extend the collection further to a+b+c such chains. The last Player who is able to complete her move wins. In this paper, we complete the analysis of G _n (a,b,c) by considering its most difficult instance: when c=2 and a+b+2=n. We prove, the rather surprising result, that, for n7, Player I wins G _n (a,n–a–2,2) if and only if a3. As a consequence we get results about extending collections of independent maximal chains, and about cutsets (collections of subsets that intersect every maximal chain) of minimum possible width (the size of largest anti-chain).     

The Dimension of Interior Levels of the Boolean Lattice,II

Extending an old lemma by Dushnik, we establish the dimension d(3, k; n) of the containment order generated by the 3-element and k-element subsets of an n-element set for most k between and n.     

布尔矩阵的指标格(英文)

本文介绍了布尔矩阵的指标格,并讨论了它的性质,得到了从布尔矩阵指标格到一个给定完备格的一个序嵌入映射存在的条件,回答了在什么条件下布尔矩阵的指标格是完全分配格的问题。     

Term rank preservers of Boolean matrices

We obtain some characterizations of linear operators that preserve the term rank of Boolean matrices. That is, a linear operator over Boolean matrices preserves the term rank if and only if it preserves the term ranks 1 and k(≠1) if and only if it preserves the term ranks 2 and l(≠2). Other characterizations of term rank preservers are given.     

The primitive matrices of sandwich semigroups of generalized circulant Boolean matrices

Let Gn（C） be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and Gc（Jr~） the set of all primitive matrices in Gn（C）. In this paper, some necessary and sufficient conditions for A in the semigroup Gn（C） to be primitive are given. We also show that Gc（Jn） is a subsemigroup of Gn（C）.     

Subdirect decompositions and the radical of a generalized Boolean algebra extension of a lattice ordered group

The extension of a lattice ordered group A by a generalized Boolean algebra B will be denoted by A _B . In this paper we apply subdirect decompositions of A _B for dealing with a question proposed by Conrad and Darnel. Further, in the case when A is linearly ordered we investigate (i) the completely subdirect decompositions of A _B and those of B, and (ii) the values of elements of A _B and the radical R(A _B ).     

布尔矩阵的可实现问题及其与色数问题的关系

讨论了布尔矩阵的可实现问题及其与色数问题的关系.首先给出布尔矩阵可实现的一些充要条件,讨论可实现布尔矩阵的性质,其次证明可实现布尔矩阵的容度等于该矩阵所生成的图的色数;简单图的邻接矩阵的对偶阵是可实现的,且其容度就是简单图的色数的一个上界.     

Boolean Hierarchies of Partitions over a Reducible Base

The Boolean hierarchy of partitions was introduced and studied by Kosub and Wagner, primarily over the lattice of NP-sets. Here, this hierarchy is treated over lattices with the reduction property, showing that it has a much simpler structure in this instance. A complete characterization is given for the hierarchy over some important lattices, in particular, over the lattices of recursively enumerable sets and of open sets in the Baire space.     

IMTL代数上的素布尔滤子格

本文研究IMTL代数M上的索布尔滤子的运算性质。令FB（M）为膨上全体素布尔滤子集,FB（M）=FB（M）∪{φ},通过在集合FB（M）引进格并、交运算和逆序对合对应,证明了FB（M）构成一个拟布黎代数。进一步在FB（M）可定义一个伴随对,证明FB（M）也构成一个剩余格。     

On the maximal subgroup of the sandwich semigroup of generalized circulant Boolean matrices

Let n be a positive integer, and C _n (r) the set of all n × n r-circulant matrices over the Boolean algebra B = {0, 1}, . For any fixed r-circulant matrix C (C ≠ 0) in G _n , we define an operation “*” in G _n as follows: A * B = ACB for any A, B in G _n , where ACB is the usual product of Boolean matrices. Then (G _n , *) is a semigroup. We denote this semigroup by G _n (C) and call it the sandwich semigroup of generalized circulant Boolean matrices with sandwich matrix C. Let F be an idempotent element in G _n (C) and M(F) the maximal subgroup in G _n (C) containing the idempotent element F. In this paper, the elements in M(F) are characterized and an algorithm to determine all the elements in M(F) is given.     

On certain spaces of lattice diagram determinants

The aim of this work is to study some lattice diagram determinants Δ_L(X,Y) as defined in (Adv. Math. 142 (1999) 244) and to extend results of Aval et al. (J. Combin. Theory Ser. A, to appear). We recall that M_L denotes the space of all partial derivatives of Δ_L. In this paper, we want to study the space M_i,j^k(X,Y) which is defined as the sum of M_L spaces where the lattice diagrams L are obtained by removing k cells from a given partition, these cells being in the “shadow” of a given cell (i,j) in a fixed Ferrers diagram. We obtain an upper bound for the dimension of the resulting space M_i,j^k(X,Y), that we conjecture to be optimal. This dimension is a multiple of n! and thus we obtain a generalization of the n! conjecture. Moreover, these upper bounds associated to nice properties of some special symmetric differential operators (the “shift” operators) allow us to construct explicit bases in the case of one set of variables, i.e. for the subspace M_i,j^k(X) consisting of elements of 0 Y-degree.     

Boolean algebras of lattice uniformities and decompositions of modular functions

We study decomposition theorems for modular functions on lattices and the relationship between such decompositions and lattice properties of a suitable system of uniformities. We give a purely topological characterization for the validity of a decomposition theorem of a certain type and examine when this topological condition is satisfied, namely when a system of lattice uniformities is a Boolean algebra consisting of permutable uniformities.      

Mailbox¶Boolean products of indecomposables

No Abstract. Received August 24, 2002; accepted in final form October 23, 2002.     

Torsion classes of Specker lattice ordered groups

In this paper we investigate the relations between torsion classes of Specker lattice ordered groups and torsion classes of generalized Boolean algebras.     

Networks and chain coverings in partial orders and their products

For an arbitrary poset P, subposets {P _i : 1ik} form a transitive basis of P if P is the transitive closure of their union. Let u be the minimum size of a covering of P by chains within posets of the basis, s the maximum size of a family of elements with no pair comparable in any basis poset, and a the maximum size of an antichain in P. Define a dense covering to be a collection D of chains within basis posets such that each element belongs to a chain in D within each basis poset and is the top of at least k-1 chains and the bottom of at least k-1 chains in D. Dense coverings generalize ordinary chain coverings of poset. Let d=min {|D|–(k–1)|P|}. For an arbitrary poset and transitive basis, a convenient network model for dense coverings yields the following: Theorem 1: da, with equality iff P has a minimum chain decomposition in which every pair of consecutive elements on each chain are comparable in some basis poset. Theorem 2: usda. Theorem 3: s=d iff s=a. The most interesting special case is where the transitive basis expresses P as the product of two posets, in which case u and s measure the minimum and maximum sizes of unichain coverings and semiantichains.     

Weak homogeneity of lattice ordered groups

In this paper we deal with weakly homogeneous direct factors of lattice ordered groups. The main result concerns the case when the lattice ordered groups under consideration are archimedean, projectable and conditionally orthogonally complete. Supported by VEGA grant 2/4134/24. This work has been partially supported by the Slovak Academy of Sciences via the project Center of Excellence-Physics of Information.