On the chordality of polynomial sets in triangular decomposition in top-down style

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper the chordal graph structures of polynomial sets appearing in triangular decomposition in top-down style are studied when the input polynomial set has a chordal associated graph. We prove that the associated graph of one specific triangular set computed in any algorithm for triangular decomposition in top-down style is a subgraph of the chordal graph of the input polynomial set and that all the polynomial sets, including all the computed triangular sets, appearing in one specific algorithm for triangular decomposition in top-down style (Wang’s method) have associated graphs which are subgraphs of the chordal graph of the input polynomial set.

Original languageEnglish
Title of host publicationISSAC 2018 - Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation
PublisherAssociation for Computing Machinery
Pages287-294
Number of pages8
ISBN (Electronic)9781450355506
DOIs
StatePublished - 11 Jul 2018
Event43rd ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2018 - New York, United States
Duration: 16 Jul 201819 Jul 2018

Publication series

NameProceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC

Conference

Conference43rd ACM International Symposium on Symbolic and Algebraic Computation, ISSAC 2018
Country/TerritoryUnited States
CityNew York
Period16/07/1819/07/18

Keywords

  • Chordal graph
  • Top-down style
  • Triangular decomposition
  • Wang’s method

Fingerprint

Dive into the research topics of 'On the chordality of polynomial sets in triangular decomposition in top-down style'. Together they form a unique fingerprint.

Cite this