Advertisement

Discrete & Computational Geometry

, Volume 61, Issue 2, pp 271–284 | Cite as

New Results on Tripod Packings

  • Patric R. J. ÖstergårdEmail author
  • Antti Pöllänen
Article
  • 76 Downloads

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.

Keywords

Clique Monotonic matrix Packing Semicross Stein corner Tripod 

Mathematics Subject Classification

52C17 

Notes

Acknowledgements

The authors would like to thank Sándor Szabó for encouraging them to work on tripod packings. The research was supported in part by the Academy of Finland, Project # 289002.

References

  1. 1.
    Ahlswede, R., Aydinian, H., Khachatrian, L.H.: Unidirectional error control codes and related combinatorial problems. In: Proceedings of the 8th International Workshop on Algebraic and Combinatorial Coding Theory, Tsarskoe Selo, Russia, 8–14 September, 2002, pp. 6–9Google Scholar
  2. 2.
    Golomb, S.W.: A general formulation of error metrics. IEEE Trans. Inf. Theory 15(3), 425–426 (1969)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Hamaker, W., Stein, S.: Combinatorial packing of \({\mathbb{R}}^3\) by certain error spheres. IEEE Trans. Inf. Theory 30(2), 364–368 (1984)CrossRefzbMATHGoogle Scholar
  4. 4.
    Kaski, P., Östergård, P.R.J.: Classification Algorithms for Codes and Designs. Algorithms and Computation in Mathematics, vol. 15. Springer, Berlin (2006)Google Scholar
  5. 5.
    Kløve, T., Luo, J., Yari, S.: Codes correcting single errors of limited magnitude. IEEE Trans. Inf. Theory 58(4), 2206–2219 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Niskanen, S., Östergård, P.R.J.: Cliquer User’s Guide: Version 1.0. Technical report T48. Communications Laboratory, Helsinki University of Technology, Espoo (2003)Google Scholar
  7. 7.
    Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Appl. Math. 120(1–3), 197–207 (2002)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Östergård, P.R.J., Pöllänen, A.: Dataset for New results on tripod packings [Dataset]. Zenodo (26 April 2018).  https://doi.org/10.5281/zenodo.1230276
  9. 9.
    Stein, S.K.: Factoring by subsets. Pac. J. Math. 22(3), 523–541 (1967)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Stein, S.: Packings of \({\mathbb{R}}^n\) by certain error spheres. IEEE Trans. Inf. Theory 30(2), 356–363 (1984)CrossRefzbMATHGoogle Scholar
  11. 11.
    Stein, S.K., Szabó, S.: Algebra and Tiling: Homomorphisms in the Service of Geometry. Carus Mathematical Monographs, vol. 25. Mathematical Association of America, Washington, DC (1994)Google Scholar
  12. 12.
    Szabó, S.: Monotonic matrices and clique search in graphs. Ann. Univ. Sci. Bp. Sect. Comput. 41, 307–322 (2013)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Tiskin, A.: Packing tripods: narrowing the density gap. Discrete Math. 307(16), 1973–1981 (2007)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  1. 1.Department of Communications and NetworkingAalto University School of Electrical EngineeringAaltoFinland

Personalised recommendations