Search arXivSearch

arXiv · 2109.08151

Families of polytopes with rational linear precision in higher dimensions

Abstract

In this article we introduce a new family of lattice polytopes with rational linear precision. For this purpose, we define a new class of discrete statistical models that we call multinomial staged tree models. We prove that these models have rational maximum likelihood estimators (MLE) and give a criterion for these models to be log-linear. Our main result is then obtained by applying Garcia-Puente and Sottile's theorem that establishes a correspondence between polytopes with rational linear precision and log-linear models with rational MLE. Throughout this article we also study the interplay between the primitive collections of the normal fan of a polytope with rational linear precision and the shape of the Horn matrix of its corresponding statistical model. Finally, we investigate lattice polytopes arising from toric multinomial staged tree models, in terms of the combinatorics of their tree representations.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Isobel Davies, Eliana Duarte, Irem Portakal, Miruna-Stefana Sorea. 2022-07-05. Families of polytopes with rational linear precision in higher dimensions. https://doi.org/10.1007/s10208-022-09583-7

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