Related papers: Stone space partitions indexed by a poset
The coset construction is a powerful tool for building theories that non-linearly realize symmetries. We show that when the symmetry group is not semisimple and includes spacetime symmetries, different parametrizations of the coset space…
There exists a physically well motivated method for approximating manifolds by certain topological spaces with a finite or a countable set of points. These spaces, which are partially ordered sets (posets) have the power to effectively…
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
We define semi-pointed partition posets, which are a generalisation of partition posets and show that they are Cohen-Macaulay. We then use multichains to compute the dimension and the character for the action of the symmetric groups on…
We introduce a universal approach for applying the partition rank method, an extension of Tao's slice rank polynomial method, to tensors that are not diagonal. This is accomplished by generalizing Naslund's distinctness indicator to what we…
We study two different objects attached to an arbitrary quadrangulation of a regular polygon. The first one is a poset, closely related to the Stokes polytopes introduced by Baryshnikov. The second one is a set of some paths configurations…
We define combinatorially a partial order on the set partitions and show that it is equivalent to the Bruhat-Chevalley-Renner order on the upper triangular matrices. By considering subposets consisting of set partitions with a fixed number…
Consider a homogeneous multifold convex conic system $$ Ax = 0, \; x\in K_1\times...\times K_r $$ and its alternative system $$ A\transp y \in K_1^*\times...\times K_r^*, $$ where $K_1,..., K_r$ are regular closed convex cones. We show that…
We observe that if $R:=(I,\rho, J)$ is an incidence We observe that if $R:=(I,\rho, J)$ is an incidence structure, viewed as a matrix, then the topological closure of the set of columns is the Stone space of the Boolean algebra generated by…
We introduce a new topological encoding of executions of round-based, full-information distributed protocols via spectral spaces. Such protocols constitute a model of distributed computations which are functorially presented and englobe…
We devise a polynomial-time algorithm for partitioning a simple polygon $P$ into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint,…
We study two new parameters for finite posets motivated by the problem of efficiently determining the set of successors of a given element. A plane map of a poset $P=(X,\leq)$ is an injective mapping of $X$ into the Cartesian plane…
We present a matrix-theoretic approach for studying and enumerating finite posets through their incidence representations, referred to as poset matrices. Naturally labelled posets are encoded as Boolean lower triangular matrices, allowing a…
Stone's representation theorem asserts a duality between Boolean algebras on the one hand and Stone space, which are compact, Hausdorff, and totally disconnected, on the other. This duality implies a natural isomorphism between the…
We study the topos $\mathcal{E}=\mathsf{Sh}(H\ltimes 2^{\mathbb{N}})$ arising from a nontrivial finite group $H$ acting freely on Cantor space. Using a local embedding property for the relevant epimorphisms together with effective descent…
This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…
Partially ordered sets (posets) play a universal role as an abstract structure in many areas of mathematics. For finite posets, an explicit enumeration of distinct partial orders on a set of unlabelled elements is known only up to a…
We introduce a family of univariate polynomials indexed by integer partitions. At prime powers, they count the number of subspaces in a finite vector space that transform under a regular diagonal matrix in a specified manner. This…
We study the space of ends of groups. For a finitely generated group, this is a Cantor space as soon as it is infinite. In contrast, we show that for infinitely generated countable groups, it exhibits several behaviors. For instance, we…