Related papers: Stone space partitions indexed by a poset

A \emph{set partition} of the set $[n]=\{1,...c,n\}$ is a collection of disjoint blocks $B_1,B_2,...c, B_d$ whose union is $[n]$. We choose the ordering of the blocks so that they satisfy $\min B_1<\min B_2<...b<\min B_d$. We represent such…

We consider the Complex Stone-Weierstrass Property (CSWP), which is the complex version of the Stone-Weierstrass Theorem. If X is a compact subspace of a product of three linearly ordered spaces, then X has the CSWP if and only if X has no…

Earlier an arbitrary poset $P$ was proved to be isomorphic to the collection of subsets of a space $M$ with two closures which are closed in the first closure and open in the other. As a space $M$ for this representation an algebraic dual…

Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…

A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…

For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.

Define an expansion poset to be the poset of monomials of a cluster variable attached to an arc in a polygon, where each monomial is represented by the corresponding combinatorial object from some fixed combinatorial cluster expansion…

In this paper we consider the relationship between order and topology in the vector lattice $C_b(X)$ of all bounded continuous functions on a Hausdorff space $X$. We prove that the restriction of $f\in C_b(X)$ to a closed set $A$ induces an…

Until this work, the packing radius of a poset code was only known in the cases where the poset was a chain, a hierarchy, a union of disjoint chains of the same size, and for some families of codes. Our objective is to approach the general…

We examine the lattice of all order congruences of a finite poset from the viewpoint of combinatorial algebraic topology. We will prove that the order complex of the lattice of all nontrivial order congruences (or order-preserving…

We describe some open problems related to homology representations of subposets of the partition lattice, beginning with questions first raised in Stanley's work on group actions on posets.

This work tackles a class of optimization problems in which fixing some well-chosen combinations of the variables makes the problem substantially easier to solve. We consider that the variables space may be partitioned into subsets that fix…

We develop a novel technique, which we call poset splitting, that allows us to solve two open problems regarding minimality of finite models of spaces: the nonexistence of a finite model of the real projective plane with fewer than 13…

We study the problem of constructing universal Steiner trees for undirected graphs. Given a graph $G$ and a root node $r$, we seek a single spanning tree $T$ of minimum {\em stretch}, where the stretch of $T$ is defined to be the maximum…

We derive the exact partition function for a discrete model of random trees embedded in a one-dimensional space. These trees have vertices labeled by integers representing their position in the target space, with the SOS constraint that…

This paper establishes a link between the theory of cluster algebras and the theory of representations of partially ordered sets. We introduce a class of posets by requiring avoidance of certain types of peak-subposets and show that these…

For stacked simplicial complexes, (special subclasses of such are: trees, triangulations of polygons, stacked polytopes), we give an explicit bijection between partitions of facets (for trees: edges), and partitions of vertices into…

We introduce the point degree spectrum of a represented space as a substructure of the Medvedev degrees, which integrates the notion of Turing degrees, enumeration degrees, continuous degrees, and so on. The notion of point degree spectrum…

A partition of a finite poset into chains places a natural upper bound on the size of a union of k antichains. A chain partition is k-saturated if this bound is achieved. Greene and Kleitman proved that, for each k, every finite poset has a…

We investigate infinite versions of vector and affine space partition results, and thus obtain examples and a counterexample for a partition problem for relational structures. In particular we provide two (related) examples of an age…