Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Ehrhart Bounds for Panhandle and Paving Matroids Through Enumeration of Chain Forests (2311.01640v3)

Published 2 Nov 2023 in math.CO

Abstract: Panhandle matroids are a specific family of lattice-path matroids corresponding to panhandle-shaped Ferrers diagrams. Their matroid polytopes are the subpolytopes carved from a hypersimplex to form matroid polytopes of paving matroids. It has been an active area of research to determine which families of matroid polytopes are Ehrhart positive. We prove Ehrhart positivity for panhandle matroid polytopes, thus confirming a conjecture of Hanely, Martin, McGinnis, Miyata, Nasr, Vindas-Mel\'endez, and Yin (2023). Another standing conjecture posed by Ferroni (2022) asserts that the coefficients of the Ehrhart polynomial of a connected matroid are bounded above by those of the corresponding uniform matroid. We prove Ferroni's conjecture for paving matroids -- a class conjectured to asymptotically contain all matroids. These results follow from purely enumerative statements, the main one being conjectured by Hanely et. al concerning the enumeration of a certain class of ordered chain forests.

Summary

We haven't generated a summary for this paper yet.