Search arXivSearch

arXiv · 2605.15319

Extended Abstract: Canonical join complex and cubical coordinates for all framing lattices

Abstract

This document is an extended abstract for two articles in preparation. Recently, framing lattices were introduced to generalize many classical lattices such as the Tamari lattice and the weak order on the symmetric group. We define bricks and brick cliques as a combinatorial model for join-irreducible elements and canonical join representations in all framing lattices, generalizing noncrossing arc diagrams of (Reading, 2015) for the weak order on the symmetric group. Our model captures the natural bijection between join and meet canonical representations, as well as duality upon reflections of the framed graph. The proof is bijective, with an explicit reconstruction algorithm in two steps. A useful intermediate construction in our bijective proof is our new definition of cornered cliques. These enable us to define cubical coordinates on a framing lattice, generalizing bracket vectors for the Tamari lattice and providing an efficient comparison criterion.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Jonah Berggren, Clément Chenevière. 2026-05-14. Extended Abstract: Canonical join complex and cubical coordinates for all framing lattices. https://arxiv.org/abs/2605.15319

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