arXiv (All)
open access
Efficient sampling of the unlabeled structure of uniform random mappings and surjections
This article deals with the sampling and statistics of uniform random mappings and surjections from $[n]=\{1,\ldots,n\}$ to $[k]=\{1,\ldots,k\}$. More precisely, we focus on statistics that are invariant under relabeling of the domain and codomain. The structure of a mapping or surjection up to rela
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
- Estimates of the coverage of parameter space by Latin hypercube and orthogonal array-based sampling#955423
- Smoothness-Based Derandomization of PAC-Bayes Bounds#287151
- Exact Common Information and Exact Channel Synthesis for Correlated Discrete Sources#1050306
- On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem#175146
- Generalizable AI-Generated Image Detection Based on Fractal Self-Similarity in the Spectrum#635576
Record · ID 1357170
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