Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation最新文献

筛选
英文 中文
Irredundant Triangular Decomposition 无冗余三角分解
G. Pogudin, Á. Szántó
{"title":"Irredundant Triangular Decomposition","authors":"G. Pogudin, Á. Szántó","doi":"10.1145/3208976.3208996","DOIUrl":"https://doi.org/10.1145/3208976.3208996","url":null,"abstract":"Triangular decomposition is a classic, widely used and well-developed way to represent algebraic varieties with many applications. In particular, there exist - sharp degree bounds for a single triangular set in terms of intrinsic data of the variety it represents, - powerful randomized algorithms for computing triangular decompositions using Hensel lifting in the zero-dimensional case and for irreducible varieties. However, in the general case, most of the algorithms computing triangular decompositions produce embedded components, which makes it impossible to directly apply the intrinsic degree bounds. This, in turn, is an obstacle for efficiently applying Hensel lifting due to the higher degrees of the output polynomials and the lower probability of success. In this paper, we give an algorithm to compute an irredundant triangular decomposition of an arbitrary algebraic set W defined by a set of polynomials in C[x1, x2, ..., xn]. Using this irredundant triangular decomposition, we are able to give intrinsic degree bounds for the polynomials appearing in the triangular sets and apply Hensel lifting techniques. Our decomposition algorithm is randomized, and we analyze the probability of success.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"76 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116952878","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Desingularization of First Order Linear Difference Systems with Rational Function Coefficients 具有有理函数系数的一阶线性差分系统的非奇异化
M. Barkatou, Maximilian Jaroschek
{"title":"Desingularization of First Order Linear Difference Systems with Rational Function Coefficients","authors":"M. Barkatou, Maximilian Jaroschek","doi":"10.1145/3208976.3208989","DOIUrl":"https://doi.org/10.1145/3208976.3208989","url":null,"abstract":"It is well known that for a first order system of linear difference equations with rational function coefficients, a solution that is holomorphic in some left half plane can be analytically continued to a meromorphic solution in the whole complex plane. The poles stem from the singularities of the rational function coefficients of the system. Just as for differential equations, not all of these singularities necessarily lead to poles in solutions, as they might be what is called removable. In our work, we show how to detect and remove these singularities and further study the connection between poles of solutions and removable singularities. We describe two algorithms to (partially) desingularize a given difference system and present a characterization of removable singularities in terms of shifts of the original system.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125454736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
A Symplectic Kovacic's Algorithm in Dimension 4 一维辛Kovacic算法
Thierry Combot, Camilo Sanabria
{"title":"A Symplectic Kovacic's Algorithm in Dimension 4","authors":"Thierry Combot, Camilo Sanabria","doi":"10.1145/3208976.3209005","DOIUrl":"https://doi.org/10.1145/3208976.3209005","url":null,"abstract":"Let L be a 4th order linear differential operator with coefficients in K(z), with K a computable algebraically closed field. The operator L is called symplectic when up to rational gauge transformation, the fundamental matrix of solutions X satisfies Xt J X=J where J is the standard symplectic matrix. It is called projectively symplectic when it is projectively equivalent to a symplectic operator. We design an algorithm to test if L is projectively symplectic. Furthermore, based on Kovacic's algorithm, we design an algorithm that computes Liouvillian solutions of projectively symplectic operators of order 4. Moreover, using Klein's Theorem, algebraic solutions are given as pullbacks of standard hypergeometric equations.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-02-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129691457","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Real Space Sextics and their Tritangents 真实空间美学及其三角关系
Avinash Kulkarni, Yue Ren, Mahsa Sayyary Namin, B. Sturmfels
{"title":"Real Space Sextics and their Tritangents","authors":"Avinash Kulkarni, Yue Ren, Mahsa Sayyary Namin, B. Sturmfels","doi":"10.1145/3208976.3208977","DOIUrl":"https://doi.org/10.1145/3208976.3208977","url":null,"abstract":"The intersection of a quadric and a cubic surface in 3-space is a canonical curve of genus 4. It has 120 complex tritangent planes. We present algorithms for computing real tritangents, and we study the associated discriminants. We focus on space sextics that arise from del Pezzo surfaces of degree one. Their numbers of planes that are tangent at three real points vary widely; both 0 and 120 are attained. This solves a problem suggested by Arnold Emch in 1928.","PeriodicalId":105762,"journal":{"name":"Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116720838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信