Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2409.13898

Maximal chains in lattices from graph associahedra: Tamari to the weak order

Samantha Dahlberg·Susanna Fishel
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper, we study the maximal chains of lattices which generalizes both the weak order and the Tamari lattice: certain lattices of maximal tubings. A maximal tubing poset $\mathfrak{L}(G)$ is defined for any graph $G$, but for the graphs we consider in this paper, the poset is a lattice. Just as the weak order is an orientation of the $1$-skeleton of the permutahedron and the Tamari of the associahedron, each tubing lattice is an orientation of the $1$-skeleton of a graph associahedron. The partial order on $\mathfrak{L}(G)$ is given by a projection from $\mathfrak{S}_n$ to $\mathfrak{L}(G)$. In particular, when the graph is the complete graph, the graph associahedron is the the permutahedron, and when it is the path graph, it is the Stasheff associahedron. Our main results are for lollipop graphs, graphs that ``interpolate'' between the path and the complete graphs. For lollipop graphs, the lattices consist of permutations which satisfy a generalization of $312$-avoiding. The maximum length chains correspond to partially shiftable tableaux under the Edelman-Greene's Coxeter-Knuth bijection. We also consider functions defined analogously to Stanley's symmetric function for the maximum length chains and find their expansion in terms of Young quasisymmetric Schur functions.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Samantha Dahlberg, Susanna Fishel. 2024-09-20. Maximal chains in lattices from graph associahedra: Tamari to the weak order. https://arxiv.org/abs/2409.13898

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

On nut graphs with two vertex and three edge orbits

Nut graphs are graphs whose adjacency matrix is singular with one-dimensional null space spanned by a vector with no zero entries. In a recent paper, Bašić, Fowler and Pisanski proved that the automorphism group of a nut graph has more orbits on the edge set than on the vertex set. They classified all orders for which a vertex-transitive nut graph with precisely two edge orbits exists, and conjectured that a nut graph with two vertex and three edge orbits exists for each non-prime order $n \ge 9$. Motivated by this conjecture, we introduce a very general construction that provides graphs with the desired symmetry properties, and we determine some sufficient spectral and structural conditions under which they are nut graphs. The construction yields infinite families of examples and confirms the above conjecture for all odd non-prime orders up to $2\,500$ and for at least $99.8$ percent of all odd non-prime orders up to a million. Finally, we present some additional interesting examples of nut graphs with two vertex and three edge orbits that do not arise from this construction.

math.CO↗
arXiv2026

On vertex-minimal simplicial maps to the sphere

For positive integers $n,d$, let $λ(n,d)$ be the minimal number of vertices of a triangulation of the $n$-sphere which admits a degree $d$ simplicial map onto the boundary of the $(n+1)$-simplex. We show that for $h=\lfloor\frac{n+1}2\rfloor$, the function $λ(n,d)^h$ has linear order of growth in $d$, answering a question of O. Musin. All triangulations we obtained are isomorphic to boundaries of convex polytopes in $\mathbb{R}^{n+1}$.

math.CO↗