Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.17050

A Cubical Perspective on Complements of Union-Closed Families of Sets

Dhruv Bhasin
View original source ↗Read source document ↗Export metadata ↓

Abstract

Complements of union-closed families of sets, over a finite ground set, are known as simply rooted families of sets. Cubical sets are widely studied topological objects having applications in computational homology. In this paper, we look at simply rooted families of sets from the perspective of cubical sets. That is, for every family $\mathcal F$ of subsets of a finite set, we construct a natural cubical set $X(\mathcal F)$ (corresponding to it). We show that for every simply rooted family $\mathcal F$, containing the empty set, the cubical set $X(\mathcal F)$ is always acyclic (that is, it has trivial reduced cubical homology). As a consequence of this, using the Euler-Poincarè formula, we obtain a formula satisfied by all simply rooted families of sets which contain the empty set. We also provide an elementary proof of this formula.

Explore related subjects

math.COmath.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dhruv Bhasin. 2024-09-25. A Cubical Perspective on Complements of Union-Closed Families of Sets. https://arxiv.org/abs/2409.17050

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗