Search arXivSearch

arXiv · 1002.0810

Ring of Polytopes, Quasi-symmetric functions and Fibonacci numbers

Abstract

In this paper we study the ring $\mathcal{P}$ of combinatorial convex polytopes. We introduce the algebra of operators $\mathcal{D}$ generated by the operators $d_k$ that send an $n$-dimensional polytope $P^n$ to the sum of all its $(n-k)$-dimensional faces. It turns out that $\mathcal{D}$ is isomorphic to the universal Leibnitz-Hopf algebra with the antipode $χ(d_k)=(-1)^kd_k$. Using the operators $d_k$ we build the generalized $f$-polynomial, which is a ring homomorphism from $\mathcal{P}$ to the ring $\Qsym[t_1,t_2,...][α]$ of quasi-symmetric functions with coefficients in $\mathbb Z[α]$. The images of two polytopes coincide if and only if their flag $f$-vectors are equal. We describe the image of this homomorphism over the integers and prove that over the rationals it is a free polynomial algebra with dimension of the $n$-th graded component equal to the $n$-th Fibonacci number. This gives a representation of the Fibonacci series as an infinite product. The homomorphism is an isomorphism on the graded group $BB$ generated by the polytopes introduced by Bayer and Billera to find the linear span of flag $f$-vectors of convex polytopes. This gives the group $BB$ a structure of the ring isomorphic to $f(\mathcal{P})$. We show that the ring of polytopes has a natural Hopf comodule structure over the Rota-Hopf algebra of posets. As a corollary we build a ring homomorphism $l_α\colon\mathcal{P}\to\mathcal{R}[α]$ such that $F(l_α(P))=f(P)^*$, where $F$ is the Ehrenborg quasi-symmetric function.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Victor M. Buchstaber, Nickolai Erokhovets. 2010-02-03. Ring of Polytopes, Quasi-symmetric functions and Fibonacci numbers. https://arxiv.org/abs/1002.0810

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