arXiv (All)
open access
A Generating Polynomial for Convex Subsets of Posets
For any finite poset we define a generating polynomial counting upsets, downsets, and their intersection. We investigate the behaviour of this polynomial with respect to poset operations and show that it distinguishes certain posets constructed with the operations of ordinal sum and disjoint union,
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 Complexity of Forcing and Anti-Forcing Minimum Cuts#1118004
- Local Presentations of Groups: Completion and Smith's Conjecture#1247513
- Balancing linear extensions in posets#348789
- Subset selection problems in planar point sets#925735
- Entropy bounds and global couplings for union-closed families#985661
Record · ID 1387675
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