Algorithm Search⌘K

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.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator