Search arXivSearch

arXiv · 2609.20656

Framingtopes

Abstract

Framing lattices arise from the dual graphs of framed (or DKK) triangulations of flow polytopes and provide a common framework encompassing classical lattices such as the Boolean, Tamari, and weak-order lattices, as well as $τ$-tilting posets of certain gentle algebras. In this paper, we introduce the \emph{framingtope}, a polytopal complex that provides a geometric counterpart to a framing lattice: its edge graph is the Hasse diagram of the framing lattice. We prove that the framingtope admits three equivalent descriptions, in terms of interior faces of the framed triangulation, sets of pairwise coherent routes covering the graph, and pure intervals of the framing lattice. We further construct a tropical realization of the framingtope as the bounded-cell complex of an arrangement of tropical hypersurfaces associated with an admissible height function. This construction yields explicit vertex coordinates for broad classes of framed graphs, including plane framed graphs and multioruga graphs. In the multioruga case, these coordinates give tropical realizations of weak orders on multipermutations and, in the ordinary oruga case, recover the classical permutahedron.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sergio Alejandro Fernandez de soto Guerrero, Cesar Ceballos, Matias von Bell. 2026-09-17. Framingtopes. https://arxiv.org/abs/2609.20656

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