WebSite Logo
  • Content
  • Similar Resources
  • Metadata
  • Cite This
  • Language
    অসমীয়া বাংলা भोजपुरी डोगरी English ગુજરાતી हिंदी ಕನ್ನಡ
    Khasi कोंकणी मैथिली മലയാളം ꯃꯤꯇꯩ ꯂꯣꯟ मराठी Mizo नेपाली
    ଓଡ଼ିଆ ਪੰਜਾਬੀ संस्कृत ᱥᱟᱱᱛᱟᱲᱤ सिन्धी தமிழ் తెలుగు اردو
  • Log-in
  • Fullscreen
Log-in
Do not have an account? Register Now
Forgot your password? Account recovery
  1. Discrete & Computational Geometry
  2. Discrete & Computational Geometry : Volume 56
  3. Discrete & Computational Geometry : Volume 56, Issue 2, September 2016
  4. Nerve Complexes of Circular Arcs
Loading...

Please wait, while we are loading the content...

Discrete & Computational Geometry : Volume 57
Discrete & Computational Geometry : Volume 56
Discrete & Computational Geometry : Volume 56, Issue 4, December 2016
Discrete & Computational Geometry : Volume 56, Issue 3, October 2016
Discrete & Computational Geometry : Volume 56, Issue 2, September 2016
Nerve Complexes of Circular Arcs
Invariants of Random Knots and Links
Computing the Fréchet Distance with a Retractable Leash
Bisector Energy and Few Distinct Distances
Space Exploration via Proximity Search
Fast Domino Tileability
Random Conical Tessellations
Lines, Betweenness and Metric Spaces
The Local Optimality of the Double Lattice Packing
A $$2\times 2$$ Lax Representation, Associated Family, and Bäcklund Transformation for Circular K-Nets
Correction to Our Article “Topology of Random 2-Complexes” Published in DCG 47 (2012),
Discrete & Computational Geometry : Volume 56, Issue 1, July 2016
Discrete & Computational Geometry : Volume 55
Discrete & Computational Geometry : Volume 54
Discrete & Computational Geometry : Volume 53
Discrete & Computational Geometry : Volume 52
Discrete & Computational Geometry : Volume 51
Discrete & Computational Geometry : Volume 50
Discrete & Computational Geometry : Volume 49
Discrete & Computational Geometry : Volume 48
Discrete & Computational Geometry : Volume 47
Discrete & Computational Geometry : Volume 46
Discrete & Computational Geometry : Volume 45
Discrete & Computational Geometry : Volume 44
Discrete & Computational Geometry : Volume 43
Discrete & Computational Geometry : Volume 42
Discrete & Computational Geometry : Volume 41
Discrete & Computational Geometry : Volume 40
Discrete & Computational Geometry : Volume 39
Discrete & Computational Geometry : Volume 38
Discrete & Computational Geometry : Volume 37
Discrete & Computational Geometry : Volume 36
Discrete & Computational Geometry : Volume 35
Discrete & Computational Geometry : Volume 34
Discrete & Computational Geometry : Volume 33
Discrete & Computational Geometry : Volume 32
Discrete & Computational Geometry : Volume 31
Discrete & Computational Geometry : Volume 30
Discrete & Computational Geometry : Volume 29
Discrete & Computational Geometry : Volume 28
Discrete & Computational Geometry : Volume 27
Discrete & Computational Geometry : Volume 26
Discrete & Computational Geometry : Volume 25
Discrete & Computational Geometry : Volume 24
Discrete & Computational Geometry : Volume 23
Discrete & Computational Geometry : Volume 22
Discrete & Computational Geometry : Volume 21
Discrete & Computational Geometry : Volume 20
Discrete & Computational Geometry : Volume 19
Discrete & Computational Geometry : Volume 18
Discrete & Computational Geometry : Volume 17

Similar Documents

...
Extremal Betti Numbers of Vietoris–Rips Complexes

Article

...
Vietoris–Rips Complexes of Planar Point Sets

Article

...
Extremal Betti Numbers of Vietoris–Rips Complexes

Article

...
Geometry-driven Collapses for Converting a Čech Complex into a Triangulation of a Nicely Triangulable Shape

Article

...
Combinatorial 3-Manifolds with Transitive Cyclic Symmetry

Article

...
Nerve complexes of circular arcs

Article

...
On Vietoris-Rips complexes of ellipses

Article

...
Linear-Size Approximations to the Vietoris–Rips Filtration

Article

...
$$f$$ -Vectors Implying Vertex Decomposability

Article

Nerve Complexes of Circular Arcs

Content Provider Springer Nature Link
Author Adams, Henry Peterson, Chris Frick, Florian Adamaszek, Michał Previte Johnson, Corrine
Copyright Year 2016
Abstract We show that the nerve and clique complexes of n arcs in the circle are homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension. Moreover this homotopy type can be computed in time $$O(n\log n)$$ . For the particular case of the nerve complex of evenly-spaced arcs of the same length, we determine explicit homology bases and we relate the complex to a cyclic polytope with n vertices. We give three applications of our knowledge of the homotopy types of nerve complexes of circular arcs. First, we show that the Lovász bound on the chromatic number of a circular complete graph is either sharp or off by one. Second, we use the connection to cyclic polytopes to give a novel topological proof of a known upper bound on the distance between successive roots of a homogeneous trigonometric polynomial. Third, we show that the Vietoris–Rips or ambient Čech simplicial complex of n points in the circle is homotopy equivalent to either a point, an odd-dimensional sphere, or a wedge sum of spheres of the same even dimension, and furthermore this homotopy type can be computed in time $$O(n\log n)$$ .
Ending Page 273
Page Count 23
Starting Page 251
File Format PDF
ISSN 01795376
e-ISSN 14320444
Journal Discrete & Computational Geometry
Issue Number 2
Volume Number 56
Language English
Publisher Springer US
Publisher Date 2016-07-13
Publisher Place New York
Access Restriction One Nation One Subscription (ONOS)
Subject Keyword Cyclic polytope Vietoris–Rips complex Computational Mathematics and Numerical Analysis Symmetry properties of polytopes Nerve complex Čech complex Combinatorial aspects of simplicial complexes Circular arc Combinatorics
Content Type Text
Resource Type Article
Subject Discrete Mathematics and Combinatorics Theoretical Computer Science Computational Theory and Mathematics Geometry and Topology
  • About
  • Disclaimer
  • Feedback
  • Sponsor
  • Contact
About National Digital Library of India (NDLI)
NDLI logo

National Digital Library of India (NDLI) is a virtual repository of learning resources which is not just a repository with search/browse facilities but provides a host of services for the learner community. It is sponsored and mentored by Ministry of Education, Government of India, through its National Mission on Education through Information and Communication Technology (NMEICT). Filtered and federated searching is employed to facilitate focused searching so that learners can find the right resource with least effort and in minimum time. NDLI provides user group-specific services such as Examination Preparatory for School and College students and job aspirants. Services for Researchers and general learners are also provided. NDLI is designed to hold content of any language and provides interface support for 10 most widely used Indian languages. It is built to provide support for all academic levels including researchers and life-long learners, all disciplines, all popular forms of access devices and differently-abled learners. It is designed to enable people to learn and prepare from best practices from all over the world and to facilitate researchers to perform inter-linked exploration from multiple sources. It is developed, operated and maintained from Indian Institute of Technology Kharagpur.

Learn more about this project from here.

Disclaimer

NDLI is a conglomeration of freely available or institutionally contributed or donated or publisher managed contents. Almost all these contents are hosted and accessed from respective sources. The responsibility for authenticity, relevance, completeness, accuracy, reliability and suitability of these contents rests with the respective organization and NDLI has no responsibility or liability for these. Every effort is made to keep the NDLI portal up and running smoothly unless there are some unavoidable technical issues.

Feedback

Sponsor

Ministry of Education, through its National Mission on Education through Information and Communication Technology (NMEICT), has sponsored and funded the National Digital Library of India (NDLI) project.

Contact National Digital Library of India
Central Library (ISO-9001:2015 Certified)
Indian Institute of Technology Kharagpur
Kharagpur, West Bengal, India | PIN - 721302
See location in the Map
03222 282435
Mail: support@ndl.gov.in
Sl. Authority Responsibilities Communication Details
1 Ministry of Education (GoI),
Department of Higher Education
Sanctioning Authority https://www.education.gov.in/ict-initiatives
2 Indian Institute of Technology Kharagpur Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project https://www.iitkgp.ac.in
3 National Digital Library of India Office, Indian Institute of Technology Kharagpur The administrative and infrastructural headquarters of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
4 Project PI / Joint PI Principal Investigator and Joint Principal Investigators of the project Dr. B. Sutradhar  bsutra@ndl.gov.in
Prof. Saswat Chakrabarti  will be added soon
5 Website/Portal (Helpdesk) Queries regarding NDLI and its services support@ndl.gov.in
6 Contents and Copyright Issues Queries related to content curation and copyright issues content@ndl.gov.in
7 National Digital Library of India Club (NDLI Club) Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach clubsupport@ndl.gov.in
8 Digital Preservation Centre (DPC) Assistance with digitizing and archiving copyright-free printed books dpc@ndl.gov.in
9 IDR Setup or Support Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops idr@ndl.gov.in
Cite this Content
Loading...