P100 · Extremal configurations · Classic · Hard

Rectangle-free binary matrices · n = 32

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

Instancen = 32
ObjectiveMaximize number of ones

Record comparison

number of ones · Higher is better
RecordValue / intervalAuthor / holderSource
External best known189Narjess 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.
Open full editor ↗

Layout shown: starter layout

VERIFIED CONSTRUCTION189 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 = 32
LAYOUT & HISTORY

Starter layout

Inspect the layout, solver notes and record history.

Challenge this record ↗Submit 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": [
    "11010000000010000001000000100000",
    "10100011000000000000010001000001",
    "01101000001000000010000000010000",
    "00110100100000000000100000000100",
    "10001100000001001000001000000000",
    "00011010000100010000000010000000",
    "01000101000000110000000100000000",
    "01000010110000000100001000000000",
    "00010001010001000010000000000010",
    "00000100011100000000010000100000",
    "00000001101010001000000010000000",
    "10000000100100100010000000001000",
    "00100000000111000100000100000000",
    "00001000010010100000100001000000",
    "00000010001001100001000000000100",
    "00100000010000011001000000001000",
    "10000000001000010100100000000010",
    "00010000000000101100010000010000",
    "00000100000000000111000011000000",
    "00000010000000001010100100100000",
    "00000001000100000001101000010000",
    "00000000000010010010011000000100",
    "00001000100000000001010100000010",
    "01000000000001000000110010001000",
    "00010000001000000000001101001000",
    "00100000000000100000001010100010",
    "00000000100001010000000001110000",
    "10000000010000000000000110010100",
    "00001001000000000100000000101100",
    "00000110000010000000000000011010",
    "01000000000100001000000001000100",
    "01000000000000000000000000000011"
  ]
}
Submission format and technical detailsOpen this when you are ready to prepare a JSON answer+

Instance parameters

{
  "n": 32
}

Starter answer

{
  "rows": [
    "11010000000010000001000000100000",
    "10100011000000000000010001000001",
    "01101000001000000010000000010000",
    "00110100100000000000100000000100",
    "10001100000001001000001000000000",
    "00011010000100010000000010000000",
    "01000101000000110000000100000000",
    "01000010110000000100001000000000",
    "00010001010001000010000000000010",
    "00000100011100000000010000100000",
    "00000001101010001000000010000000",
    "10000000100100100010000000001000",
    "00100000000111000100000100000000",
    "00001000010010100000100001000000",
    "00000010001001100001000000000100",
    "00100000010000011001000000001000",
    "10000000001000010100100000000010",
    "00010000000000101100010000010000",
    "00000100000000000111000011000000",
    "00000010000000001010100100100000",
    "00000001000100000001101000010000",
    "00000000000010010010011000000100",
    "00001000100000000001010100000010",
    "01000000000001000000110010001000",
    "00010000001000000000001101001000",
    "00100000000000100000001010100010",
    "00000000100001010000000001110000",
    "10000000010000000000000110010100",
    "00001001000000000100000000101100",
    "00000110000010000000000000011010",
    "01000000000100001000000001000100",
    "01000000000000000000000000000011"
  ]
}

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.