Search arXivSearch

arXiv · 2409.16773

Flag complex face structures and decompositions

Abstract

One of the most common and effective methods of obtaining structural information on simplicial complexes is to use tools from algebraic geometry/commutative algebra (often motivated by properties of toric varieties). However, there is no general algebro-geometric description of components of the gamma vector holding for arbitary flag simplicial spheres. This invariant occurs in many different contexts including permutation statistics, signatures of toric varieties, and Euler characteristics of nonpositively curved piecewise Euclidean manifolds. Combinatorial methods resulting from an explicit inverted Chebyshev expansion give rise to new positivity properties and cell complex structures that are of interest in their own right. Note that the focus is on the $f$-vector rather than the $h$-vector in ``algebraic'' settings. For flag simplicial spheres $Δ$, the fact that $h(Δ) = f(Γ)$ and compatibility between Chebyshev expansions and a modification of the $f$-polynomial by work of Hetyei are the key inputs. In the main formula implying new positivity results, local structures of $CAT(0)$ complexes and cubical analogues of barycentric subdivisions give deeper connections with cubical complex structures complementing earlier work related to the top gamma vector component. Afterwards, we return to the motivating example of barycentric subdivisions and consider how $f$-vectors of Cohen--Macaulay and vertex decomposable flag complexes in geometric settings decompose and interact with geometric transformations. This includes subdivisions of simplicial complexes and recursive properties they share with vertex decomposable flag complexes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Soohyun Park. 2025-11-03. Flag complex face structures and decompositions. https://arxiv.org/abs/2409.16773

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