P100 · Extremal configurations · Classic

Rectangle-free binary matrices · n = 25

Place as many ones as possible in an n × n grid. No two rows and two columns may meet at four ones.

Instancen = 25
ObjectiveMaximize number of ones

Record comparison

number of ones · Higher is better
RecordValue / intervalAuthor / holderSource
Proven optimum130Narjess Afzaly & Brendan McKayExtremal Graphs and Turan Numbers ↗
Site recordNo player record yet——

Formal definition

  • GridFill each cell of an n-row, n-column grid with zero or one.
  • RectangleChoose any two distinct rows and any two distinct columns. At most three of the four corners may contain ones, regardless of the entries inside.
  • ConstructionSupply the entire matrix, including any all-zero rows or columns.
  • ObjectiveScore one point for each one. Maximize the total.
Inspect in editor ↗

Layout shown: starter layout

VERIFIED CONSTRUCTION130 ones

Getting a feel for it

How often can a column pair occur?

Three ones in one row use three pairs of columns. If another row uses even one of those pairs, the four ones form a rectangle.

The current arrangement for Rectangle-free binary matrices n = 25
LAYOUT & HISTORY

Starter layout

Inspect the layout, solver notes and record history.

The optimum is proven; no further improvement is possibleSubmit a proof / idea ↓Share a proof or bound argument in the discussion board. Accepted contributions earn proof points.
ANSWER FORMAT

How to write your answer

Submit an array named rows containing n strings of length n, using only 0 and 1.

Starter answer

{
  "rows": [
    "1101000000001000000100000",
    "1010001100000000000001000",
    "0110100000100000001000000",
    "0011010010000000000010000",
    "1000110000000100100000100",
    "0001101000010001000000001",
    "0100010100000011000000010",
    "0100001011000000010000100",
    "0001000101000100001000000",
    "0000010001110000000001000",
    "0000000110101000100000001",
    "1000000010010010001000000",
    "0010000000011100010000010",
    "0000100001001010000010000",
    "0000001000100110000100000",
    "0010000001000001100100000",
    "1000000000100001010010000",
    "0001000000000010110001000",
    "0000010000000000011100001",
    "0000001000000000101010010",
    "0000000100010000000110100",
    "0000000000001001001001100",
    "0000100010000000000101010",
    "0100000000000100000011001",
    "0001000000100000000000110"
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 25
}

Starter answer

{
  "rows": [
    "1101000000001000000100000",
    "1010001100000000000001000",
    "0110100000100000001000000",
    "0011010010000000000010000",
    "1000110000000100100000100",
    "0001101000010001000000001",
    "0100010100000011000000010",
    "0100001011000000010000100",
    "0001000101000100001000000",
    "0000010001110000000001000",
    "0000000110101000100000001",
    "1000000010010010001000000",
    "0010000000011100010000010",
    "0000100001001010000010000",
    "0000001000100110000100000",
    "0010000001000001100100000",
    "1000000000100001010010000",
    "0001000000000010110001000",
    "0000010000000000011100001",
    "0000001000000000101010010",
    "0000000100010000000110100",
    "0000000000001001001001100",
    "0000100010000000000101010",
    "0100000000000100000011001",
    "0001000000100000000000110"
  ]
}

Submit an array named rows containing n strings of length n, using only 0 and 1. · Verifier v1.0.0

DISCUSSION

Discussion

Discuss strategies, share construction methods, or ask questions. Any signed-in user can post under their public byline and unique #UID. New posts appear after moderation.

No threads yet. Start the first discussion.