In mathematics applied to computer science, Monge arrays, or Monge matrices, are mathematical objects named for their discoverer, the French mathematician Gaspard Monge. An m-by-n matrix is said to be a Monge array if, for all i , j , k , ℓ {\displaystyle i,j,k,\ell } such that 1 ≤ i < k ≤ m and 1 ≤ j < ℓ ≤ n , {\displaystyle 1\leq i<k\leq m{\text{ and }}1\leq j<\ell \leq n,} one obtains A [ i , j ] + A [ k , ℓ ] ≤ A [ i , ℓ ] + A [ k , j ] .
In mathematics applied to computer science, Monge arrays, or Monge matrices, are mathematical objects named for their discoverer, the French mathematician Gaspard Monge. An m-by-n matrix is said to be a Monge array if, for all i , j , k , ℓ {\displaystyle i,j,k,\ell } such that 1 ≤ i < k ≤ m and 1 ≤ j < ℓ ≤ n , {\displaystyle 1\leq i<k\leq m{\text{ and }}1\leq j<\ell \leq n,} one obtains A [ i , j ] + A [ k , ℓ ] ≤ A [ i , ℓ ] + A [ k , j ] .
Source: Wikipedia "Monge array" · CC BY-SA 4.0
Share this article: X · Bluesky