arXiv (All)
open access
The Wang Transform Inequality
We prove the Wang transform inequality in every order: if $n$ is a positive integer, $A$ is a nonnegative $n\times n$ matrix whose row and column sums equal one, and $J_n$ has every entry $1/n$, then \[ \operatorname{per}A\ge \operatorname{per}\!\left(\frac{nJ_n+A}{n+1}\right). \] Equality holds exa
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
- Exponential Rank Bounds for Random Matrices#986280
- Structural Corrections to the Bethe Approximation of the Permanent#819088
- Structural Corrections to the Bethe Approximation of the Permanent#809096
- Bounded Integer Quadratic Programming through Parallelepiped Covers and Discrete Convic Optimization#1011604
- An optimal constant for vector balancing with permutations#1157475
Record · ID 1115750
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