Skip to main content
SpringerLink
Log in

Tree Checking for Sparse Complexes

  • Conference paper
Mathematical Software - ICMS 2006 (ICMS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4151))

Included in the following conference series:

  • 884 Accesses

Abstract

We detail here the sparse variant of the algorithm sketched in [2] for checking if a simplicial complex is a tree. A full worst case complexity analysis is given and several optimizations are discussed. The practical complexity is discussed for some examples.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Caboara, M., Faridi, S., Selinger, P.: Prototype implementation of tree algorithms, available at: http://www.dm.unipi.it/~caboara/Research

  2. Caboara, M., Faridi, S., Selinger, P.: Simplicial cycles and the computation of simplicial trees. Journal of Symbolic Computation (to appear)

    Google Scholar 

  3. CoCoA Team, COCOA: a system for doing Computations in Commutative Algebra, available at: http://cocoa.dima.unige.it/

  4. Faridi, S.: The facet ideal of a simplicial complex. Manuscripta Mathematica 109, 159–174 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  5. Faridi, S.: Cohen-Macaulay properties of square-free monomial ideals. Journal of Combinatorial Theory, Series A 109(2), 299–329 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  6. Faridi, S.: Simplicial trees are sequentially Cohen-Macaulay. J. Pure and Applied Algebra 190, 121–136 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  7. Faridi, S.: Monomial ideals via square-free monomial ideals. Lecture Notes in Pure and Applied Mathematics (to appear)

    Google Scholar 

  8. Simis, A., Vasconcelos, W., Villarreal, R.: On the ideal theory of graphs. J. Algebra 167(2), 389–416 (1994)

    Article  MATH  MathSciNet  Google Scholar 

  9. Villarreal, R.: Cohen-Macaulay graphs. Manuscripta Math. 66(3), 277–293 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  10. Zheng, X.: Homological properties of monomial ideals associated to quasi-trees and lattices, Ph.D. thesis, Universität Duisburg-Essen (August 2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Pisa, Italy

    Massimo Caboara

  2. Dalhousie University, Halifax, Canada

    Sara Faridi & Peter Selinger

Authors
  1. Massimo Caboara
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sara Faridi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Peter Selinger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics and Computational Sciences, University of Cantabria, Avda. de los Castros, s/n, E-39005, Santander, Spain

    Andrés Iglesias

  2. Faculty of Science Department of Mathematics, Kobe University, 1-1, Rokkodai, Nada-ku, 657-8501, Kobe, Japan

    Nobuki Takayama

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Caboara, M., Faridi, S., Selinger, P. (2006). Tree Checking for Sparse Complexes. In: Iglesias, A., Takayama, N. (eds) Mathematical Software - ICMS 2006. ICMS 2006. Lecture Notes in Computer Science, vol 4151. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11832225_10

Download citation

  • DOI: https://doi.org/10.1007/11832225_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-38084-9

  • Online ISBN: 978-3-540-38086-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation