arXiv (All)
open access
Universal set families for maximization of nonnegative submodular and XOS functions
We consider the question of designing a universal family of sets $F \subset 2^{[n]}$ such that for any function $f:2^{[n]} \to R_{\geq 0}$ in a certain class, we have $$\max_{S \in F} f(S) \geq c(n) \cdot \max_{S \subset [n]} f(S).$$ We prove that there is a family of subpolynomial size such that
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
- Explicit Constructions of Maximum-Cardinality Families of Plateaued Functions with Pairwise Disjoint Walsh Supports#1035793
- Choquet-type extensions of set-pair functions, and applications in graph limits, hypergraphs, and metric measure spaces#1156444
- Problem representation for refinement#90032
- Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#793556
- Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem#789552
Record · ID 1014121
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