Search arXivSearch

arXiv · 1509.03008

Volume polynomials and duality algebras of multi-fans

Abstract

We introduce a theory of volume polynomials and corresponding duality algebras of multi-fans. Any complete simplicial multi-fan $Δ$ determines a volume polynomial $V_Δ$ whose values are the volumes of multi-polytopes based on $Δ$. This homogeneous polynomial is further used to construct a Poincare duality algebra $\mathcal{A}^*(Δ)$. We study the structure and properties of $V_Δ$ and $\mathcal{A}^*(Δ)$ and give applications and connections to other subjects, such as Macaulay duality, Novik--Swartz theory of face rings of simplicial manifolds, generalizations of Minkowski's theorem on convex polytopes, cohomology of torus manifolds, computations of volumes, and linear relations on the powers of linear forms. In particular, we prove that the analogue of the $g$-theorem does not hold for multi-polytopes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Anton Ayzenberg, Mikiya Masuda. 2015-09-10. Volume polynomials and duality algebras of multi-fans. https://doi.org/10.1007/s40598-016-0048-4

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