Search arXivSearch

arXiv · 2509.05299

Order-generation in posets and convolution of closure operators

Abstract

Motivated by the Hofmann--Lawson theorem, which states that every continuous lattice is inf-generated by its irreducible elements, we explore how to represent posets by extreme points with respect to a closure operator. For this purpose, we introduce the convolution product of closure operators, and prove that the Krein--Milman property can be transferred from one collection of subsets to another by convolution. This result underpins two new representation theorems of topological flavor, which generalize existing ones, even in posets lacking lattice or semilattice structures. We also prove a third representation theorem: given a poset equipped with a closure operator $\mathfrak{c}$ with adequate properties, we show that the set of kit points, defined as an extension of compact points, has the Krein--Milman property with respect to the convolution product of $\mathfrak{c}$ with the dual Alexandrov operator $\uparrow\!\! \cdot$; moreover, every kit point is sup-generated by a unique antichain of compact points, finite if $\mathfrak{c}$ is finitary.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Paul Poncet. 2025-08-16. Order-generation in posets and convolution of closure operators. https://arxiv.org/abs/2509.05299

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO