Metraipolis › archive › dc_75e12c22cd5c
Dittert conjecture — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Dittert_conjecture
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T16:44:42.222Z
- SHA-256 of the archived text
6f516dc1ec5e88dceae760af284d15da6ec26c43339629931fcd5208b15363b2- Stable URL of this page
https://metraipolis.com/documento/dc_75e12c22cd5c
How to cite
Dittert conjecture — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Dittert_conjecture (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_75e12c22cd5c (Metraipolis archive dc_75e12c22cd5c, sha256 6f516dc1ec5e88dceae760af284d15da6ec26c43339629931fcd5208b15363b2)
BibTeX
@misc{dc75e12c22cd5c,
title = {Dittert conjecture — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Dittert_conjecture},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_75e12c22cd5c; sha256 6f516dc1ec5e88dceae760af284d15da6ec26c43339629931fcd5208b15363b2},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Dittert_conjecture. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
The Dittert conjecture, or Dittert–Hajek conjecture, is a mathematical hypothesis in combinatorics concerning the maximum achieved by a particular function ϕ {\displaystyle \phi } of matrices with real, nonnegative entries satisfying a summation condition. The conjecture is due to Eric Dittert and (independently) Bruce Hajek. Let A = [ a i j ] {\displaystyle A=[a_{ij}]} be a square matrix of order n {\displaystyle n} with nonnegative entries and with ∑ i = 1 n ( ∑ j = 1 n a i j ) = n {\textstyle \sum _{i=1}^{n}\left(\sum _{j=1}^{n}a_{ij}\right)=n} . Its permanent is defined as per ( A ) = ∑ σ ∈ S n ∏ i = 1 n a i , σ ( i ) , {\displaystyle \operatorname {per} (A)=\sum _{\sigma \in S_{n}}\prod _{i=1}^{n}a_{i,\sigma (i)},} where the sum extends over all elements σ {\displaystyle \sigma } of the symmetric group. The Dittert conjecture asserts that the function ϕ ( A ) {\displaystyle \operatorname {\phi } (A)} defined by ∏ i = 1 n ( ∑ j = 1 n a i j ) + ∏ j = 1 n ( ∑ i = 1 n a i j ) − per ( A ) {\textstyle \prod _{i=1}^{n}\left(\sum _{j=1}^{n}a_{ij}\right)+\prod _{j=1}^{n}\left(\sum _{i=1}^{n}a_{ij}\right)-\operatorname {per} (A)} is (uniquely) maximized when A = ( 1 / n ) J n {\displaystyle A=(1/n)J_{n}} , where J n {\displaystyle J_{n}} is defined to be the square matrix of order n {\displaystyle n} with all entries equal to 1.
Tema degli esploratori: matematica e informatica teorica (deposito sistematico; categoria «Combinatorics»).
Fonte: Wikipedia in inglese, voce «Dittert conjecture» — https://en.wikipedia.org/wiki/Dittert_conjecture
Wikidata Q55609730 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q55609730
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Dittert_conjecture?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1332612042, consultata il 2026-10-06T15:18:47.067Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: f0628fd017a5ad2dbef52a464837b092ccbbaa40846fc1055047f731c4917cab