Activity from matroids to rooted trees and beyond

DOI10.1016/j.jcta.2023.105755zbMath1517.05033arXiv2209.03446OpenAlexW4362605698MaRDI QIDQ6162861

David L. Forge, Rigoberto Flórez

Publication date: 26 June 2023

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.03446

zbMATH Keywords

Tutte polynomialno broken circuithyperplane arrangementcolored treeinterior activitylocal binary search tree

Mathematics Subject Classification ID

Trees (05C05) Graph polynomials (05C31) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lattice points in orthotopes and a huge polynomial Tutte invariant of weighted gain graphs
• Bijections between affine hyperplane arrangements and valued graphs
• Deformations of Coxeter hyperplane arrangements
• Deformations of the braid arrangement and trees
• Gessel polynomials, rooks, and extended linial arrangements
• The Tutte polynomial
• Characteristic polynomials of subspace arrangements and finite fields
• Bijections for faces of the Shi and Catalan arrangements
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Hyperplane arrangements, interval orders, and trees.
• Active orders for matroid bases

This page was built for publication: Activity from matroids to rooted trees and beyond