Effective Localization Using Double Ideal Quotient and Its Implementation

Yuki Ishihara, Kazuhiro Yokoyama

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

5 Citations (Scopus)

Abstract

In this paper, we propose a new method for localization of polynomial ideal, which we call “Local Primary Algorithm”. For an ideal I and a prime ideal P, our method computes a P-primary component of I after checking if P is associated with I by using double ideal quotient (I : (I : P)) and its variants which give us a lot of information about localization of I.

Original languageEnglish
Title of host publicationComputer Algebra in Scientific Computing - 20th International Workshop, CASC 2018, Proceedings
EditorsWolfram Koepf, Werner M. Seiler, Vladimir P. Gerdt, Evgenii V. Vorozhtsov
PublisherSpringer Verlag
Pages272-287
Number of pages16
ISBN (Print)9783319996387
DOIs
Publication statusPublished - 2018
Externally publishedYes
Event20th International Workshop on Computer Algebra in Scientific Computing, CASC 2018 - Lille, France
Duration: 17 Sept 201821 Sept 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11077 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Workshop on Computer Algebra in Scientific Computing, CASC 2018
Country/TerritoryFrance
CityLille
Period17/09/1821/09/18

Keywords

  • Gröbner basis
  • Localization
  • Primary decomposition

Fingerprint

Dive into the research topics of 'Effective Localization Using Double Ideal Quotient and Its Implementation'. Together they form a unique fingerprint.

Cite this