arXiv (All)
open access
Antichain polynomials of products of chains and minuscule posets
This paper studies the antichain polynomials of $[k]\times P$, where $P$ is a connected minuscule poset. We give a formula for the number of antichains, counted by size, of an arbitrary poset. Using this formula, we present necessary and sufficient conditions for the palindromicity of antichain poly
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
- On the Tutte polynomial of series-parallel posets#1064068
- A positive solution to the $L^p$ projection centroid conjecture#1052172
- Circular Rearrangement Inequality and Optimal Cyclic Birth and Death Chains#999460
- Burgess-type volume dependent bounds for character sums over $\mathbb{F}_{p^n}$#1050823
- Protected tails and polynomial-time enumeration of permutations avoiding a direct sum of an increasing pattern and 231#1156455
Record · ID 1076639
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