ECONOMICAL TORIC SPINES VIA CHEEGER'S INEQUALITY

Author:

ALON NOGA12,KLARTAG BO'AZ34

Affiliation:

1. Schools of Mathematics and Computer Science, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, 69978, Israel

2. IAS, Princeton, NJ 08540, USA

3. Department of Mathematics, Princeton University, Princeton, NJ 08544, USA

4. School of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv 69978, Israel

Abstract

Let [Formula: see text] denote the graph whose set of vertices is {0,…,m - 1}d, where two distinct vertices are adjacent if and only if they are either equal or adjacent in the m-cycle Cm in each coordinate. Let [Formula: see text] denote the graph on the same set of vertices in which two vertices are adjacent if and only if they are adjacent in one coordinate in Cm and equal in all others. Both graphs can be viewed as graphs of the d-dimensional torus. We prove that one can delete [Formula: see text] vertices of G1 so that no topologically nontrivial cycles remain. This improves an O(d log 2 (3/2)md - 1) estimate of Bollobás, Kindler, Leader and O'Donnell. We also give a short proof of a result implicit in a recent paper of Raz: one can delete an [Formula: see text] fraction of the edges of G so that no topologically nontrivial cycles remain in this graph. Our technique also yields a short proof of a recent result of Kindler, O'Donnell, Rao and Wigderson; there is a subset of the continuous d-dimensional torus of surface area [Formula: see text] that intersects all nontrivial cycles. All proofs are based on the same general idea: the consideration of random shifts of a body with small boundary and no nontrivial cycles, whose existence is proved by applying the isoperimetric inequality of Cheeger or its vertex or edge discrete analogues.

Publisher

World Scientific Pub Co Pte Lt

Subject

Geometry and Topology,Analysis

Reference4 articles.

1. Eigenvalues and expanders

2. T. H. Cormen, Introduction to Algorithms, 2nd edn. (MIT Press and McGraw-Hill, 2001) pp. 643–700.

3. A Lower Bound On The Integrality Gap For Minimum Multicut In Directed Networks

Cited by 13 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. An integer parallelotope with small surface area;Journal of Functional Analysis;2023-11

2. Parallel repetition for all 3-player games over binary alphabet;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09

3. Spatio-spectral limiting on discrete tori: adjacency invariant spaces;Sampling Theory, Signal Processing, and Data Analysis;2021-08-03

4. Subexponential Algorithms for Unique Games and Related Problems;Journal of the ACM;2015-11-02

5. (The Estimation of Chinese Term Structure of Interest Rate and Treasury Bonds Pricing);SSRN Electronic Journal;2015

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3