Abstract
In this paper we consider the following question: how many vertices of the discrete torus must be deleted so that no topologically nontrivial cycles remain?
We look at two different edge structures for the discrete torus. For \(({\mathbb Z}^{d}_{m})_{1}\), where two vertices in \({\mathbb Z}_{\it m}\) are connected if their ℓ1 distance is 1, we show a nontrivial upper bound of d \(^{log_{2}{(3/2)}}{\it m}^{{\it d}-1}\) ≈ d \(^{0.6} {\it m}^{{\it d}-1}\) on the number of vertices that must be deleted. For \(({\mathbb Z}^{d}_{m})_{\infty}\), where two vertices are connected if their ℓ ∞ distance is 1, Saks, Samorodnitsky and Zosin [8] already gave a nearly tight lower bound of d (m-1)\(^{{\it d}-1}\) using arguments involving linear algebra. We give a more elementary proof which improves the bound to \({\it m}^{d}-({\it m}-1)^{d}\), which is precisely tight.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Azizoğlu, M.C., Eğecioğlu, Ö.: The isoperimetric number of d-dimensional k-ary arrays. International Journal of Foundations of Computer Science 10(3), 289–300 (1999)
Bollobás, B., Leader, I.: An isoperimetric inequality on the discrete torus. SIAM J. Discret. Math. 3(1), 32–37 (1990)
Chung, F.R.K., Tetali, P.: Isoperimetric inequalities for cartesian products of graphs. Combinatorics, Probability & Computing 7(2), 141–148 (1998)
Feige, U.: Error reduction by parallel repetition — the state of the art. Technical report, Weizmann Institute of Science (1995)
Feige, U.: Personal communication (2005)
Raz, R.: A parallel repetition theorem. SIAM Journal on Computing 27(3), 763–803 (1998)
Rós, A.: The isoperimetric problem. Lecture notes. MSRI summer school (2001), http://www.ugr.es/~aros/isoper.htm
Saks, M.E., Samorodnitsky, A., Zosin, L.: A lower bound on the integrality gap for minimum multicut in directed networks. Combinatorica 24(3), 525–530 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bollobás, B., Kindler, G., Leader, I., O’Donnell, R. (2006). Eliminating Cycles in the Discrete Torus. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_22
Download citation
DOI: https://doi.org/10.1007/11682462_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)