arXiv (All)
open access
The Marcus-Minc Transform Inequality
We prove the Marcus-Minc conjecture: let n be any integer at least 2, and let A be a nonnegative n by n matrix whose row and column sums are all one. Form a new matrix by subtracting A from the n by n matrix of ones and dividing by n minus one. Then the permanent of A is at least the permanent of
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
- A Threshold Number for the Shortest Vector Problem in the Infinity Norm#1144726
- A simpler proof of the Matrix Spencer Theorem#1110487
- Real-rootedness of the $Z$-polynomials of sparse paving matroids and strict interlacing for uniform matroids#984545
- Frame Sets and Zeros of Zak Transforms of Extended Gaussians#1012120
- Zero-free columns in character tables of symmetric groups#781015
Record · ID 1077191
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