Answers are grounded in this paper and cite their sources.
We prove the equivalence of two-symbol supersaturated designs (SSDs) with <a:math xmlns:a="http://www.w3.org/1998/Math/MathML" id="M2"><a:mi>N</a:mi></a:math> (even) rows, <c:math xmlns:c="http://www.w3.org/1998/Math/MathML" id="M3"><c:mi>m</c:mi></c:math> columns, and <e:math xmlns:e="http://www.w3.org/1998/Math/MathML" id="M4"><e:msub><e:mrow><e:mi>s</e:mi></e:mrow><e:mrow><e:mi mathvariant="normal">max</e:mi></e:mrow></e:msub><e:mo>=</e:mo><e:mn>4</e:mn><e:mi>t</e:mi><e:mo>+</e:mo><e:mi>i</e:mi></e:math> , where <h:math xmlns:h="http://www.w3.org/1998/Math/MathML" id="M5"><h:mi>i</h:mi><h:mo>∈</h:mo><h:mfenced open="{" close="}"><h:mrow><h:mn>0</h:mn><h:mo>,</h:mo><h:mn>2</h:mn></h:mrow></h:mfenced></h:math> and <l:math xmlns:l="http://www.w3.org/1998/Math/MathML" id="M6"><l:mi>t</l:mi><l:mo>∈</l:mo><l:msup><l:mrow><l:mi>ℤ</l:mi></l:mrow><l:mrow><l:mo>≥</l:mo><l:mn>0</l:mn></l:mrow></l:msup></l:math> and resolvable incomplete block designs (RIBDs) whose any two blocks intersect in at most <n:math xmlns:n="http://www.w3.org/1998/Math/MathML" id="M7"><n:mfenced open="(" close=")"><n:mrow><n:mi>N</n:mi><n:mo>+</n:mo><n:mn>4</n:mn><n:mi>t</n:mi><n:mo>+</n:mo><n:mi>i</n:mi></n:mrow></n:mfenced><n:mo>/</n:mo><n:mn>4</n:mn></n:math> points. Using this equivalence, we formulate the search for two-symbol <r:math xmlns:r="http://www.w3.org/1998/Math/MathML" id="M8"><r:mi>E</r:mi><r:mfenced open="(" close=")"><r:mrow><r:msup><r:mrow><r:mi>s</r:mi></r:mrow><r:mrow><r:mn>2</r:mn></r:mrow></r:msup></r:mrow></r:mfenced></r:math> -optimal and minimax-optimal SSDs with <v:math xmlns:v="http://www.w3.org/1998/Math/MathML" id="M9"><v:msub><v:mrow><v:mi>s</v:mi></v:mrow><v:mrow><v:mi mathvariant="normal">max</v:mi></v:mrow></v:msub><v:mo>∈</v:mo><v:mfenced open="{" close="}"><v:mrow><v:mn>2</v:mn><v:mo>,</v:mo><v:mn>4</v:mn><v:mo>,</v:mo><v:mn>6</v:mn></v:mrow></v:mfenced></v:math> as a search for RIBDs whose blocks intersect accordingly. This allows developing a bit-parallel tabu search (TS) algorithm. The TS algorithm found <ab:math xmlns:ab="http://www.w3.org/1998/Math/MathML" id="M10"><ab:mi>E</ab:mi><ab:mfenced open="(" close=")"><ab:mrow><ab:msup><ab:mrow><ab:mi>s</ab:mi></ab:mrow><ab:mrow><ab:mn>2</ab:mn></ab:mrow></ab:msup></ab:mrow></ab:mfenced></ab:math> -optimal and minimax-optimal SSDs achieving the sharpest known <eb:math xmlns:eb="http://www.w3.org/1998/Math/MathML" id="M11"><eb:mi>E</eb:mi><eb:mfenced open="(" close=")"><eb:mrow><eb:msup><eb:mrow><eb:mi>s</eb:mi></eb:mrow><eb:mrow><eb:mn>2</eb:mn></eb:mrow></eb:msup></eb:mrow></eb:mfenced></eb:math> lower bound with <ib:math xmlns:ib="http://www.w3.org/1998/Math/MathML" id="M12"><ib:msub><ib:mrow><ib:mi>s</ib:mi></ib:mrow><ib:mrow><ib:mi mathvariant="normal">max</ib:mi></ib:mrow></ib:msub><ib:mo>∈</ib:mo><ib:mfenced open="{" close="}"><ib:mrow><ib:mn>2</ib:mn><ib:mo>,</ib:mo><ib:mn>4</ib:mn><ib:mo>,</ib:mo><ib:mn>6</ib:mn></ib:mrow></ib:mfenced></ib:math> of sizes <nb:math xmlns:nb="http://www.w3.org/1998/Math/MathML" id="M13"><nb:mfenced open="(" close=")"><nb:mrow><nb:mi>N</nb:mi><nb:mo>,</nb:mo><nb:mi>m</nb:mi></nb:mrow></nb:mfenced><nb:mo>=</nb:mo><nb:mfenced open="(" close=")"><nb:mrow><nb:mn>16</nb:mn><nb:mo>,</nb:mo><nb:mn>25</nb:mn></nb:mrow></nb:mfenced></nb:math> , (16, 26), (16, 27), (18, 23), (18, 24), (18, 25), (18, 26), (18, 27), (18, 28), (18, 29), (20, 21), (22, 22), (22, 23), (24, 24), and (24, 25). In each of these cases, no such SSD could previously be found.
No takes yet. Share an insight, caveat, or question.
Morales et al. (2023) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: