arXiv (All)
open access
On the Average Sizes of Ideals and Antichains in Some Infinite Families of Posets
We study the average sizes of ideals and antichains in several families of posets arising from rooted unlabeled trees. For ideals, we encode order ideals by coloring vertices red, with the condition that every descendant of a red vertex is also red. Using generating functions and singularity analysi
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
- The interval posets of permutations seen from the decomposition tree perspective#156434
- Erdős-Sós via random cyclic orderings#1035127
- Greedy Uniformity on Trees: Exact Obstruction and Near-Uniform Spiders#1186590
- Convergence and compactness of discrete aggregation trees#1070568
- Ideal Membership in Polynomial Calculus: Complexity and Reductions#1064787
Record · ID 1188257
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