The size of maximal systems of brick islands

For integers $m_1,...,m_d>0$ and a cuboid $M=[0,m_1]\times ... \times [0,m_d]\subset \mathbb{R}^d$, a brick of $M$ is a closed cuboid whose vertices have integer coordinates. A set $H$ of bricks in $M$ is a system of brick islands if for each pair of bricks in $H$ one contains the other or they are disjoint. Such a system is maximal if it cannot be extended to a larger system of brick islands. Extending the work of Lengv\'{a}rszky, we show that the minimum size of a maximal system of brick islands in $M$ is $\sum_{i=1}^d m_i - (d-1)$. Also, in a cube $C=[0,m]^d$ we define the corresponding notion of a system of cubic islands, and prove bounds on the sizes of maximal systems of cubic islands.Comment: 12 page

CD-independent subsets in meet-distributive lattices

A subset $X$ of a finite lattice $L$ is CD-independent if the meet of any two incomparable elements of $X$ equals 0. In 2009, Cz\'edli, Hartmann and Schmidt proved that any two maximal CD-independent subsets of a finite distributive lattice have the same number of elements. In this paper, we prove that if $L$ is a finite meet-distributive lattice, then the size of every CD-independent subset of $L$ is at most the number of atoms of $L$ plus the length of $L$. If, in addition, there is no three-element antichain of meet-irreducible elements, then we give a recursive description of maximal CD-independent subsets. Finally, to give an application of CD-independent subsets, we give a new approach to count islands on a rectangular board.Comment: 14 pages, 4 figure

Spectra of Tukey types of ultrafilters on Boolean algebras

Extending recent investigations on the structure of Tukey types of ultrafilters on $\mathcal{P}(\omega)$ to Boolean algebras in general, we classify the spectra of Tukey types of ultrafilters for several classes of Boolean algebras, including interval algebras, tree algebras, and pseudo-tree algebras.Comment: 18 page

Capacity and coding in digital communications

+164hlm.;24c