We partially strengthen a result of Shelah from [Sh] by proving that if $\kappa ={\kappa }^{\omega }$ and $P$ is a CCC partial order with e.g. $\left|P\right|\le {\kappa }^{+\omega }$ (the ${\omega }^{\text{th}}$ successor of $\kappa$) and $\left|P\right|\le 2^{\kappa }$ then $P$ is $\kappa$-linked.

Generalizing Reiner’s notion of set partitions of type B n, we define colored B n-partitions by coloring the elements in and not in the zero-block respectively. Considering the generating function of colored B n-partitions, we get the exact formulas for the expectation and variance of the number of non-zero-blocks in a random colored B n-partition. We find an asymptotic expression of the total number of colored B n-partitions up to an error of O(n −1/2log7/2 n], and prove that the centralized and...

Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality and restrictions of the distance to finite chains may or may not coincide with the natural, difference-of-height distance measured in a chain. It is shown that for semilattices the semimodularity ensures the good behaviour of the distances considered. The Jordan-Dedekind chain condition, which is weaker than semimodularity, is equivalent to the...

We use categories to recast the combinatorial theory of full heaps, which are certain labelled partially ordered sets that we introduced in previous work. This gives rise to a far simpler set of definitions, which we use to outline a combinatorial construction of the so-called loop algebras associated to affine untwisted Kac--Moody algebras. The finite convex subsets of full heaps are equipped with a statistic called parity, and this naturally gives rise to Kac's asymmetry function. The latter is...

We maximize the total height of order ideals in direct products of finitely many finite chains. We also consider several order ideals simultaneously. As a corollary, a shifting property of some integer sequences, including digit sum sequences, is derived.

Let $Q$ be the lexicographic sum of finite ordered sets $Q_x$ over a finite ordered set $P$. For some $P$ we can give a formula for the jump number of $Q$ in terms of the jump numbers of $Q_x$ and $P$, that is, $s\left(Q\right)=s\left(P\right)+{\sum }_{x\in P}s\left(Q_x\right)$, where $s\left(X\right)$ denotes the jump number of an ordered set $X$. We first show that $w\left(P\right)-1+{\sum }_{x\in P}s\left(Q_x\right)\le s\left(Q\right)\le s\left(P\right)+{\sum }_{x\in P}s\left(Q_x\right)$, where $w\left(X\right)$ denotes the width of an ordered set $X$. Consequently, if $P$ is a Dilworth ordered set, that is, $s\left(P\right)=w\left(P\right)-1$, then the formula holds. We also show that it holds again if $P$ is bipartite. Finally, we prove that the lexicographic sum of...

In this paper, the structures of collection of pronormal subgroups of dicyclic, symmetric and alternating groups $G$ are studied in respect of formation of lattices $\mathrm{L}\left(G\right)$ and sublattices of $\mathrm{L}\left(G\right)$. It is proved that the collections of all pronormal subgroups of ${\mathrm{A}}_n$ and S${}_n$ do not form sublattices of respective $\mathrm{L}\left({\mathrm{A}}_n\right)$ and $\mathrm{L}\left({\mathrm{S}}_n\right)$, whereas the collection of all pronormal subgroups $\mathrm{LPrN}\left({\mathrm{Dic}}_n\right)$ of a dicyclic group is a sublattice of $\mathrm{L}\left({\mathrm{Dic}}_n\right)$. Furthermore, it is shown that $\mathrm{L}\left({\mathrm{Dic}}_n\right)$ and $\mathrm{LPrN}({\mathrm{Dic}}_n$) are lower semimodular lattices.

The main result of the paper is that for a circular element c in a C*-probability space, $(cⁿ,c^{n*})$ is an R-diagonal pair in the sense of Nica and Speicher for every n = 1,2,... The coefficients of the R-series are found to be the generalized Catalan numbers of parameter n-1.

L’espace des configurations de $p$ points distincts de ${\mathbf{R}}^{\infty }$ admet une filtration naturelle qui est induite par les inclusions des ${\mathbf{R}}^n$ dans ${\mathbf{R}}^{\infty }$. Nous caractérisons le type d’homotopie de cette filtration par les propriétés combinatoires d’une structure cellulaire sous-jacente, étroitement liée à la théorie des $E_n$-opérades de May. Cela donne une approche unifiée des différents modèles combinatoires d’espaces de lacets itérés et redémontre les théorèmes d’approximation de Milgram, Smith et Kashiwabara.

It is shown that if α,ζ are ordinals such that 1 ≤ ζ < α < ζω, then there is an operator from $C\left({\omega }^{{\omega }^{\alpha }}\right)$ onto itself such that if Y is a subspace of $C\left({\omega }^{{\omega }^{\alpha }}\right)$ which is isomorphic to $C\left({\omega }^{{\omega }^{\alpha }}\right)$, then the operator is not an isomorphism on Y. This contrasts with a result of J. Bourgain that implies that there are uncountably many ordinals α for which for any operator from $C\left({\omega }^{{\omega }^{\alpha }}\right)$ onto itself there is a subspace of $C\left({\omega }^{{\omega }^{\alpha }}\right)$ which is isomorphic to $C\left({\omega }^{{\omega }^{\alpha }}\right)$ on which the operator is an isomorphism.