A family of matrix-tree multijections

DOI10.5802/ALCO.181MaRDI QIDQ2065707zbMATH OpenOpenAlexFDO

Authors Alex McDonough

Publication date 12 January 2022

Published in Algebraic Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

arithmetic matroidmultijectionsandpile group

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Combinatorial aspects of simplicial complexes (05E45) Tilings in (n) dimensions (aspects of discrete geometry) (52C22) Oriented matroids in discrete geometry (52C40)

Abstract: For a natural class of $rimesn$ integer matrices, we construct a non-convex polytope which periodically tiles $mathbb{R}^n$. From this tiling, we provide a family of geometrically meaningful maps from a generalized sandpile group to a set of generalized spanning trees which give multijective proofs for several higher-dimensional matrix-tree theorems. In particular, these multijections can be applied to graphs, regular matroids, cell complexes with a torsion-free spanning forest, and representable arithmetic matroids with a multiplicity one basis. This generalizes a bijection given by Backman, Baker, and Yuen and extends work by Duval, Klivans, and Martin.

Recommendations

• A combinatorial mapping for the higher-dimensional matrix-tree theorem
• Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
• Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
• Simplicial matrix-tree theorems
• The sand-pile model and Tutte polynomials

Cites work

• Algebraic properties of generalized graph Laplacians: resistor networks, critical groups, and homological algebra
• Chip-Firing and Rotor-Routing on Directed Graphs
• Chip-firing and the critical group of a graph
• Circuit-cocircuit reversing systems in regular matroids
• Computing the Continuous Discretely
• Critical groups of simplicial complexes
• Cuts and flows of cell complexes
• Enumerating degree sequences in digraphs and a cycle--cocycle reversing system
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
• Geometric bijections for regular matroids, zonotopes, and Ehrhart theory
• scientific article; zbMATH DE number 1600999 (Why is no real title available?)
• scientific article; zbMATH DE number 4680 (Why is no real title available?)
• scientific article; zbMATH DE number 5047784 (Why is no real title available?)
• Matrix tree theorems
• Orientable arithmetic matroids
• Self-organized criticality
• Simplicial matrix-tree theorems
• The chip-firing game
• The lattice of integral flows and the lattice of integral cuts on a finite graph
• The mathematics of chip-firing
• Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings

Cited in

(7)

• Standard monomials of 1-skeleton ideals of graphs and generalized signless Laplacians
• A combinatorial mapping for the higher-dimensional matrix-tree theorem
• Fragmenting any parallelepiped into a signed tiling
• Chip-firing and critical groups of signed graphs
• Extension-lifting bijections for oriented matroids
• Fragmenting any parallelepiped into a signed tiling
• Generalized Laplacian tilings and root zonotopes

This page was built for publication: A family of matrix-tree multijections

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2065707)