We show that prohibiting a combinatorial tree in the Priestley duals determines an axiomatizable class of distributive lattices. On the other hand, prohibiting $n$-crowns with $n\ge 3$ does not. Given what is known about the diamond, this is another strong indication that this fact characterizes combinatorial trees. We also discuss varieties of 2-Heyting algebras in this context.

We study combinatorial properties of the partial order (Dense(ℚ),⊆). To do that we introduce cardinal invariants ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$, ${}_{\mathbb{Q}}$ describing properties of Dense(ℚ). These invariants satisfy ${}_{\mathbb{Q}}$ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ ≤ ℚ$.WecomparethemwiththeiranaloguesinthewellstudiedBooleanalgebra\left(\omega \right)/fin.Weshowthat$ℚ = p$,$ℚ = t$and$ℚ = i$,whereas$ℚ > h$and$ℚ > r$arebothshowntoberelativelyconsistentwithZFC.Wealsoinvestigatecombinatoricsoftheidealnwdofnowheredensesubsetsof,\mathbb{Q}.Inparticular,weshowthat$non(M)=min||: ⊆ Dense(R) ∧ (∀I ∈ nwd(R))(∃D ∈ )(I ∩ D = ∅) and cof(M) = min||: ⊆ Dense(ℚ) ∧ (∀I ∈ nwd)(∃D ∈ )(I ∩ = ∅). We use these facts to show that cof(M) ≤ i, which improves a result of S. Shelah.

The concept of a commutative directoid was introduced by J. Ježek and R. Quackenbush in 1990. We complete this algebra with involutions in its sections and show that it can be converted into a certain implication algebra. Asking several additional conditions, we show whether this directoid is sectionally complemented or whether the section is an NMV-algebra.

We study commutative directoids with a greatest element, which can be equipped with antitone bijections in every principal filter. These can be axiomatized as algebras with two binary operations satisfying four identities. A minimal subvariety of this variety is described.

We investigate the variety of residuated lattices with a commutative and idempotent monoid reduct.

Posets with property DINT which are compact pospaces with respect to the interval topologies are characterized.

The aim of this paper is to provide upper bounds for the entropy numbers of summation operators on trees in a critical case. In a recent paper [Studia Math. 202 (2011)] we elaborated a framework of weighted summation operators on general trees where we related the entropy of the operator to those of the underlying tree equipped with an appropriate metric. However, the results were left incomplete in a critical case of the entropy behavior, because this case requires much more involved techniques....

We investigate compactness properties of weighted summation operators $V_{\alpha ,\sigma }$ as mappings from ℓ₁(T) into ${\ell }_q\left(T\right)$ for some q ∈ (1,∞). Those operators are defined by $\left(V_{\alpha ,\sigma }x\right)\left(t\right):=\alpha \left(t\right){\sum }_{s⪰t}\sigma \left(s\right)x\left(s\right)$, t ∈ T, where T is a tree with partial order ⪯. Here α and σ are given weights on T. We introduce a metric d on T such that compactness properties of (T,d) imply two-sided estimates for $eₙ\left(V_{\alpha ,\sigma }\right)$, the (dyadic) entropy numbers of $V_{\alpha ,\sigma }$. The results are applied to concrete trees, e.g. moderately increasing, biased or binary trees and to weights with α(t)σ(t)...