Name
Abstract | ||
|---|---|---|
Consider an \(n \times n \times n\) cube Q consisting of \(n^3\) unit cubes. A tripod of order n is obtained by taking the \(3n-2\) unit cubes along three mutually adjacent edges of Q. The unit cube corresponding to the vertex of Q where the edges meet is called the center cube of the tripod. The function f(n) is defined as the largest number of integral translates of such a tripod that have disjoint interiors and whose center cubes coincide with unit cubes of Q. The value of f(n) has earlier been determined for \(n \le 9.\) The function f(n) is here studied in the framework of the maximum clique problem, and the values \(f(10) = 32\) and \(f(11)=38\) are obtained computationally. Moreover, by prescribing symmetries, constructive lower bounds on f(n) are obtained for \(n \le 26.\) A conjecture that f(n) is always attained by a packing with a symmetry of order 3 that rotates Q around the axis through two opposite vertices is disproved. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1007/s00454-018-0012-2 | Discrete & Computational Geometry |
Keywords | Field | DocType |
Clique, Monotonic matrix, Packing, Semicross, Stein corner, Tripod, 52C17 | Combinatorics,Disjoint sets,Vertex (geometry),Clique,Unit cube,Conjecture,Mathematics,Homogeneous space,Clique problem,Cube | Journal |
Volume | Issue | ISSN |
61 | 2 | 1432-0444 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Patric R. J. Östergård | 1 | 609 | 70.61 |
| Antti Pöllänen | 2 | 0 | 0.34 |