Related papers: Stone space partitions indexed by a poset

We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…

Tukey order are used to compare the cofinal complexity of partially order sets (posets). We prove that there is a $2^\mathfrak{c}$-sized collection of sub-posets in $2^\omega$ which forms an antichain in the sense of Tukey ordering. Using…

We study the enumeration problem of higher dimensional partitions, a natural generalisation of classical integer partitions. We show that their counting problem is equivalent to the enumeration of simpler classes of higher dimensional…

The following is an open problem in topology: Determine whether the Stone-\v{C}ech compactification of a widely-connected space is necessarily an indecomposable continuum. Herein we describe properties of $X$ that are necessary and…

A {\it vector space partition} is here a collection $\mathcal P$ of subspaces of a finite vector space $V(n,q)$, of dimension $n$ over a finite field with $q$ elements, with the property that every non zero vector is contained in a unique…

The aim of this paper is to define and study pointed and multi-pointed partition posets of type A and B (in the classification of Coxeter groups). We compute their characteristic polynomials, incidence Hopf algebras and homology groups. As…

Suppose some random resource (energy, mass or space) $\chi \geq 0$ is to be shared at random between (possibly infinitely many) species (atoms or fragments). Assume ${\Bbb E}\chi =\theta <\infty $ and suppose the amount of the individual…

This paper studies topological properties of the lattices of non-crossing partitions of types A and B and of the poset of injective words. Specifically, it is shown that after the removal of the bottom and top elements (if existent) these…

In this paper, we introduce a natural geometric extension of the partition function. More precisely, we investigate the problem of counting partitions of a rectangle into rectangular blocks with integer sides. Here, two partitions of a…

We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…

It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…

Let $X$ be an unbounded metric space, $B(x,r) = \{y\in X: d(x,y) \leqslant r\}$ for all $x\in X$ and $r\geqslant 0$. We endow $X$ with the discrete topology and identify the Stone-\v{C}ech compactification $\beta X$ of $X$ with the set of…

For a finite non-empty set $X$, let $\mathfrak{P}(X)$ denote the set of all posets with carrier $X$, ordered by inclusion of their partial order relations. We investigate properties of posets $P \in \mathfrak{P}(X)$ for which no lower cover…

A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…

Non-point spatial objects (e.g., polygons, linestrings, etc.) are ubiquitous. We study the problem of indexing non-point objects in memory for range queries and spatial intersection joins. We propose a secondary partitioning technique for…

A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…

Let us denote by $\mathcal{SOMP}$ the class of all set-representable orthomodular posets and by $\mathcal{PD SOMP}$ those elements of $\mathcal{SOMP}$ in which any pair of points in the underlying set $P$ can be distinguished by a set…

An Alexandroff space is a topological space in which every intersection of open sets is open. There is one to one correspondence between Alexandroff $T_0$-spaces and partially ordered sets (posets). We investigate Alexandroff…

Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…