P100 · Extremal configurations · Classic

Rectangle-free binary matrices · n = 23

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

Instancen = 23
ObjectiveMaximize number of ones

Record comparison

number of ones · Higher is better
RecordValue / intervalAuthor / holderSource
Proven optimum115Narjess 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 CONSTRUCTION115 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 = 23
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": [
    "11010000001000000000010",
    "10100100000010000000001",
    "01101000010000000001000",
    "00110001100000001000000",
    "10001010100000000000100",
    "00010110010000010000000",
    "00001101001000100000000",
    "01000011000010000010000",
    "00000000111100000000001",
    "01000100000101001000000",
    "00100010000100100000010",
    "10000001000100010100000",
    "00011000000011000100000",
    "10000000010001100010000",
    "00100000001001010000100",
    "00000000100010110001000",
    "00000010001000001101000",
    "00001000000000011010001",
    "00000100100000000110010",
    "00010000000100000011100",
    "00000000010010001000110",
    "01000000000000100100101",
    "00000001000001000001011"
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 23
}

Starter answer

{
  "rows": [
    "11010000001000000000010",
    "10100100000010000000001",
    "01101000010000000001000",
    "00110001100000001000000",
    "10001010100000000000100",
    "00010110010000010000000",
    "00001101001000100000000",
    "01000011000010000010000",
    "00000000111100000000001",
    "01000100000101001000000",
    "00100010000100100000010",
    "10000001000100010100000",
    "00011000000011000100000",
    "10000000010001100010000",
    "00100000001001010000100",
    "00000000100010110001000",
    "00000010001000001101000",
    "00001000000000011010001",
    "00000100100000000110010",
    "00010000000100000011100",
    "00000000010010001000110",
    "01000000000000100100101",
    "00000001000001000001011"
  ]
}

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.