8 citations · 10 across the 8 of their papers we have counts for
8 papers
Sub-25-dimensional counterexamples to Borsuk's conjecture in the Leech lattice?
Thomas Jenrich
In 1933, Karol Borsuk asked whether each bounded set in the -dimensional Euclidean space can be divided into +1 parts of smaller diameter. Because it would not make sense oth…
Maximal cocliques of a strongly regular graph with parameters (2048,276,44,36)
Thomas Jenrich
This article considers a strongly regular graph with parameters (2048,276,44,36) that is related to the extended binary Golay code. That graph is known since about 1975 but there s…
More two-distance counterexamples to Borsuk's conjecture from strongly regular graphs
Thomas Jenrich
In 2013 Andriy V. Bondarenko showed how to construct a two-distance counterexample to Borsuk's conjecture from any strongly regular graph whose vertex set is not the union of at mo…
On the counterexamples to Borsuk's conjecture by Kahn and Kalai
Thomas Jenrich
In the concluding remarks of their 1993 published and now famous paper, Jeff Kahn and Gil Kalai wrote in particular: "Our construction shows that Borsuk's conjecture is false for d…
New strongly regular graphs derived from the G2(4) graph
Thomas Jenrich
We consider simple loopless finite undirected graphs. Such a graph is called strongly regular with parameter set (v,k,l,m), for short a srg(v,k,l,m), iff it has exactly v vertices,…
Successful strategies for a queens placing game on an n x n chess board
Thomas Jenrich
In his list of open problems, Martin Erickson described a certain game: "Two players alternately put queens on an n x n chess board so that each new queen is not in range of any qu…
A 64-dimensional two-distance counterexample to Borsuk's conjecture
Thomas Jenrich
In 1933 Karol Borsuk asked whether each bounded set in the n-dimensional Euclidean space can be divided into n+1 parts of smaller diameter. The diameter of a set is defined as the…
Guaranteed successful strategies for a square achievement game on an n by n grid
Thomas Jenrich
At some places (see the references) Martin Erickson describes a certain game: "Two players alternately write O's (first player) and X's (second player) in the unoccupied cells of a…