Search arXivSearch

arXiv · 2205.07581

On the $f$-vectors of $r$-multichain subdivisions

Abstract

For a poset $P$ and an integer $r\geq 1$, let $P_r$ be a collection of all $r$-multichains in $P$. Corresponding to each strictly increasing map $ı:[r]\rightarrow [2r]$, there is an order $\preceq_ı$ on $P_r$. Let $\D(G_ı(P_r))$ be the clique complex of the graph $G_ı$ associated to $P_r$ and $ı$. In a recent paper \cite{NW}, it is shown that $\D(G_ı(P_r))$ is a subdivision of $P$ for a class of strictly increasing maps. In this paper, we show that all these subdivisions have the same $f$-vector. We give an explicit description of the transformation matrices from the $f$- and $h$-vectors of $Δ$ to the $f$- and $h$-vectors of these subdivisions when $P$ is a poset of faces of $\D$. We study two important subdivisions Cheeger-Müller-Schrader's subdivision and the $r$-colored barycentric subdivision which fall in our class of $r$-multichain subdivisions.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shaheen Nazir. 2022-05-16. On the $f$-vectors of $r$-multichain subdivisions. https://arxiv.org/abs/2205.07581

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