arXiv (OAI Expanded)
open access
Weighted lattice point enumeration in lecture hall order polytopes
We consider weighted lattice point enumeration in lecture hall order polytopes. We observe that these half-open polytopes are closed under weight-lifting for a large class of polynomial weights, including monomials and weights given by binomial coefficients. For rooted trees, we prove that the corre
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Forest polynomials and the class of the permutahedral variety#1104373
- On the closed neighborhood ideal of the square of broom and double broom graphs#971496
- A note on efficient k-limited broadcast domination in graphs#659009
- A note on efficient k-limited broadcast domination in graphs#656873
- A Deterministic $(2+\varepsilon)$-Approximation for Weighted Feedback Vertex Set in Tournaments#1109265
Record · ID 1123629
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive