Vol. 8, No. 3, 2015

Download this article
Download this article For screen
For printing
Recent Issues

Volume 11, 1 issue

Volume 10, 5 issues

Volume 9, 5 issues

Volume 8, 5 issues

Volume 7, 6 issues

Volume 6, 4 issues

Volume 5, 4 issues

Volume 4, 4 issues

Volume 3, 4 issues

Volume 2, 5 issues

Volume 1, 2 issues

The Journal
Cover Page
Editorial Board
Editors’ Addresses
Editors’ Interests
About the Journal
Scientific Advantages
Submission Guidelines
Submission Form
Ethics Statement
Subscriptions
Editorial Login
Author Index
Coming Soon
Contacts
 
ISSN: 1944-4184 (e-only)
ISSN: 1944-4176 (print)
On the number of pairwise touching simplices

Bas Lemmens and Christopher Parsons

Vol. 8 (2015), No. 3, 513–520
Abstract

In this note, it is shown that the maximum number of pairwise touching translates of an n-simplex is at least n + 3 for n = 7, and for all n 5 such that n 1 mod 4. The current best known lower bound for general n is n + 2. For n = 2k 1 and k 2, we will also present an alternative construction to give n + 2 touching simplices using Hadamard matrices.

Keywords
touching number, simplices, equilateral sets, $\ell_1$-norm
Mathematical Subject Classification 2010
Primary: 52C17
Secondary: 05B40, 46B20
Milestones
Received: 17 December 2013
Accepted: 23 February 2014
Published: 5 June 2015

Communicated by Kenneth S. Berenhaut
Authors
Bas Lemmens
School of Mathematics, Statistics & Actuarial Science
University of Kent
Cornwallis Building
Canterbury
CT2 7NF
United Kingdom
Christopher Parsons
School of Mathematics, Statistics & Actuarial Science
University of Kent
Cornwallis Building
Canterbury
CT2 7NF
United Kingdom