{"title":"Exploiting symmetry in the power flow equations using monodromy","authors":"J. Lindberg, N. Boston, B. Lesieutre","doi":"10.1145/3457341.3457346","DOIUrl":"https://doi.org/10.1145/3457341.3457346","url":null,"abstract":"We propose solving the power flow equations using monodromy. We prove the variety under consideration decomposes into trivial and nontrivial subvarieties and that the nontrivial subvariety is irreducible. We also show various symmetries in the solutions. We finish by giving numerical results comparing monodromy against polyhedral and total degree homotopy methods and giving an example of a network where we can find all solutions to the power flow equation using monodromy where other homotopy techniques fail. This work gives hope that finding all solutions to the power flow equations for networks of realistic size is possible.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"100 - 104"},"PeriodicalIF":0.1,"publicationDate":"2020-11-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3457341.3457346","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48258669","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}
{"title":"On sparse interpolation of rational functions and gcds","authors":"J. Hoeven, Grégoire Lecerf","doi":"10.1145/3466895.3466896","DOIUrl":"https://doi.org/10.1145/3466895.3466896","url":null,"abstract":"In this note, we present a variant of a probabilistic algorithm by Cuyt and Lee for the sparse interpolation of multivariate rational functions. We also present an analogous method for the computation of sparse gcds.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"55 1","pages":"1 - 12"},"PeriodicalIF":0.1,"publicationDate":"2020-11-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3466895.3466896","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46329629","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}
{"title":"CQF Magma package","authors":"P. Koprowski","doi":"10.1145/3427218.3427224","DOIUrl":"https://doi.org/10.1145/3427218.3427224","url":null,"abstract":"CQF is a free, open-source Magma package for doing computations in quadratic forms theory. We present some selected ingredients of the package.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"53 - 56"},"PeriodicalIF":0.1,"publicationDate":"2020-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3427218.3427224","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42753804","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}
{"title":"The 2019 Richard D. Jenks memorial prize","authors":"M. Monagan","doi":"10.1145/3427218.3427226","DOIUrl":"https://doi.org/10.1145/3427218.3427226","url":null,"abstract":"","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"61 - 61"},"PeriodicalIF":0.1,"publicationDate":"2020-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3427218.3427226","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42693273","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}
{"title":"Checkpoints in searching for rational solutions of linear ordinary difference and differential systems","authors":"S. Abramov, D. E. Khmelnov, A. Ryabenko","doi":"10.1145/3427218.3427219","DOIUrl":"https://doi.org/10.1145/3427218.3427219","url":null,"abstract":"It is quite common that search algorithms for those solutions of difference and differential equations and systems that belong to a fixed class of functions are designed so that nonexistence of solutions of the desired type is detected only in the last stages of the algorithm. However, performing additional tests on the intermediate results makes it possible to stop the algorithm as soon as these tests imply that no solutions of the desired type exist. This gives an opportunity to save time and other computing resources. So, it makes sense to equip algorithms with checkpoints and some tests. We consider these questions in connection with the search for rational solutions of linear homogeneous difference and differential systems with polynomial coefficients, and propose a scheme equipped with such checkpoints and tests, and also report results of experiments with our implementation of the scheme in Maple.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"18 - 29"},"PeriodicalIF":0.1,"publicationDate":"2020-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3427218.3427219","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47265975","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}
Christina Katsamaki, F. Rouillier, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos
{"title":"PTOPO: a maple package for the topology of parametric curves","authors":"Christina Katsamaki, F. Rouillier, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos","doi":"10.1145/3427218.3427223","DOIUrl":"https://doi.org/10.1145/3427218.3427223","url":null,"abstract":"PTOPO is a maple package computing the topology and describing the geometry of a parametric plane curve. The algorithm behind PTOPO constructs an abstract graph that is isotopic to the curve. PTOPO exploits the benefits of the parametric representation and performs all computations in the parameter space using exact computing. PTOPO computes the topology and visualizes the curve in less than a second for most examples in the literature. Comparison of maple parametric plot vs PTOPO 1 Topology of Parametric Curves The study of parametric curves is a classical topic in computational algebra and geometry (Sendra and Winkler (1999); Boissonnat and Teillaud (2006)). The interest for computing with parametric curves has been motivated, among others, by the omnipresence of parametric representations in computer modeling and computer aided geometric design (Manocha and Canny (1992); Pérez-Dı́az (2006); Sendra et al. (2008)). ⇤Supported by the Fondation Sciences Mathématiques de Paris (FSMP)","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"49-52"},"PeriodicalIF":0.1,"publicationDate":"2020-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3427218.3427223","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"64034674","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}
Antonio Jiménez-Pastor, A. Bostan, F. Chyzak, Pierre Lairez
{"title":"The Sage package comb_walks for walks in the quarter plane","authors":"Antonio Jiménez-Pastor, A. Bostan, F. Chyzak, Pierre Lairez","doi":"10.1145/3427218.3427220","DOIUrl":"https://doi.org/10.1145/3427218.3427220","url":null,"abstract":"We present in this extended abstract a new software designed to work with generating functions that count walks in the quarter plane. With this software we offer a cohesive package that brings together all the required procedures for manipulating these generating functions, as well as a unified interface to deal with them. We also display results that this package offers on a public webpage.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"30 - 38"},"PeriodicalIF":0.1,"publicationDate":"2020-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3427218.3427220","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46492496","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}
{"title":"A calculus for monomials in Chow group of zero cycles in the moduli space of stable curves","authors":"Jiayue Qi","doi":"10.1145/3457341.3457344","DOIUrl":"https://doi.org/10.1145/3457341.3457344","url":null,"abstract":"We introduce an algorithm for computing the value of all monomials in the Chow group of zero cycles in the moduli space of stable curves.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"91 - 94"},"PeriodicalIF":0.1,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3457341.3457344","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46735245","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}
{"title":"Improved divisor arithmetic on generic hyperelliptic curves","authors":"Sebastian Lindner, L. Imbert, M. Jacobson","doi":"10.1145/3457341.3457345","DOIUrl":"https://doi.org/10.1145/3457341.3457345","url":null,"abstract":"The divisor class group of a hyperelliptic curve defined over a finite field is a finite abelian group at the center of a number of important open questions in algebraic geometry, number theory and cryptography. Many of these problems lend themselves to numerical investigation, and as emphasized by Sutherland [14, 13], fast arithmetic in the divisor class group is crucial for their efficiency. Besides, implementations of these fundamental operations are at the core of the algebraic geometry packages of widely-used computer algebra systems such as Magma and Sage.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"95 - 99"},"PeriodicalIF":0.1,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3457341.3457345","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44761796","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}
{"title":"Optimal monomial quadratization for ODE systems","authors":"A. Bychkov, G. Pogudin","doi":"10.1145/3457341.3457350","DOIUrl":"https://doi.org/10.1145/3457341.3457350","url":null,"abstract":"Transformation of a polynomial ODE system to a special quadratic form has been successfully used recently as a preprocessing step for model order reduction methods. However, to the best of our knowledge, there has been no practical algorithm for performing this step automatically with any optimality guarantees. We present an algorithm that, given a system of polynomial ODEs, finds a transformation into a quadratic ODE system by introducing new variables which are monomials of the original variables. The algorithm is guaranteed to produce an optimal transformation of this form. The algorithm is implemented, and we demonstrate it on examples from the literature.","PeriodicalId":41965,"journal":{"name":"ACM Communications in Computer Algebra","volume":"54 1","pages":"119 - 123"},"PeriodicalIF":0.1,"publicationDate":"2020-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1145/3457341.3457350","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46707568","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}