Problemresearch
Row minima of totally monotone matrices
Also called row minima of Monge arrays.
Find the minimum entry of every row of a totally monotone matrix, which need not be fully read.
Find the minimum entry of every row of a totally monotone matrix, which need not be fully read.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 84YFJJ Edit this page History Report an error