ISSAC 2019 Accepted Papers

Details on the ISSAC 2019 Paper Review Process were published here. Following this process the program committee has accepted the papers below.

Click Here to go back to the ISSAC 2019 Home Page.

Stavros Kousidis. Krawtchouk polynomials and quadratic semi-regular sequences
Shaoshi Chen, Lixin Du and Chaochao Zhu. Existence Problem of Telescopers for Rational Functions in Three Variables: the Mixed Cases
Pei Huang, Minghao Liu, Cunjing Ge, Feifei Ma and Jian Zhang. Investigating the Existence of Orthogonal Golf Designs via Satisfiability Testing
Ashish Dwivedi, Rajat Mittal and Nitin Saxena. Efficiently factoring polynomials modulo $p^4$
Bo Huang and Chee Yap. An Algorithmic Approach to Limit Cycles of Nonlinear Differential Systems: the Averaging Method Revisited
Kisun Lee, Anton Leykin and Michael Burr. Effective certification of approximate solutions to systems of equations involving analytic functions
Taihei Oki. Improved Structural Methods for Nonlinear Differential-Algebraic Equations via Combinatorial Relaxation
Jin-San Cheng and Junyi Wen. Certified Numerical Real Root Isolation for Bivariate Polynomial Systems
Renzhang Liu and Yanbin Pan. Computing Hermite Normal Form Faster via Solving System of Linear Equations
Elisabeth Gaar, Daniel Krenn, Susan Margulies and Angelika Wiegele. An Optimization-Based Sum-of-Squares Approach to Vizing's Conjecture
Manuel Eberl. Verified Real Asymptotics in Isabelle/HOL
Xiaoxian Tang, Timo Wolff and Rukai Zhao. A New Method for Computing Elimination Ideals of Likelihood Equations
Michael Monagan. Linear Hensel Lifting for Fp[x,y] and Z[x] with Cubic Cost
Tao Zheng and Bican Xia. An Effective Framework for Constructing Exponent Lattice Basis of Nonzero Algebraic Numbers
Jean-Guillaume Dumas, Joris van der Hoeven, Clément Pernet and Daniel Roche. LU factorization with errors
Thierry Combot. Symbolic integration of hyperexponential 1-forms
Moulay Barkatou, Thomas Cluzeau and Ali El Hajj. Simple forms and rational solutions of pseudo-linear systems
Erick David Rodriguez Bazan and Evelyne Hubert. Symmetry Preserving Interpolation
Matías R. Bender, Jean-Charles Faugère and Elias Tsigaridas. Gröbner Basis over Semigroup Algebras: Algorithms and Applications for Sparse Polynomial Systems
Pascal Giorgi, Bruno Grenet and Daniel Roche. Generic reductions for in-place polynomial multiplication
Qiaolong Huang. Approaching Asymptotically Optimal Interpolation Algorithms over a Field with Large Characteristic or Characteristic Zero
Luca De Feo, Hugues Randriambololona and Edouard Rousseau. Standard lattices of compatibly embedded finite fields
Felipe Cucker, Alperen A. Ergür and Josue Tonelli-Cueto. Plantinga-Vegter algorithm takes average polynomial time
Andrea Guidolin, Jose Divasón, Ana Romero and Francesco Vaccarino. Computing multipersistence by means of spectral systems
Jie Wang, Haokun Li and Bican Xia. A New Sparse SOS Decomposition Algorithm Based on Term Sparsity
Vladimir Gerdt and Daniel Robertz. Algorithmic approach to strong consistency analysis of finite difference approximations to PDE systems
Yossef Musleh and Eric Schost. Computing the characteristic polynomial of a finite rank-two Drinfeld module
Xavier Caruso, Tristan Vaccon and Thibaut Verron. Gröbner bases over Tate algebras
Florent Bréhard, Mioara Joldes and Jean-Bernard Lasserre. On a moment problem with holonomic functions
Gregory Reid, Zahra Mohammadi and S.-L. Tracy Huang. Introduction of the MapDE algorithm for mappings relating differential equations
Mark Giesbrecht, Armin Jamshidpey and Éric Schost. Quadratic Probabilistic Algorithms for Normal Bases
Mark Giesbrecht, Hui Huang, George Labahn and Eugene Zima. Efficient Integer-Linear Decomposition of Multivariate Polynomials
Pierre Lairez, Marc Mezzarobba and Mohab Safey El Din. Computing the volume of compact semi-algebraic sets
Stavros Birmpilis, George Labahn and Arne Storjohann. Deterministic reduction of integer nonsingular linear system solving to matrix multiplication
Zhenbing Zeng, Lu Yang and Lydia Dehbi. On the Number of Congruent Classes of the Tetrahedra Determined by Given Volume, Circumradius and Face Areas
Jianwei Li and Phong Q. Nguyen. Computing a Lattice Basis Revisited
Anna Maria Bigatti, Eduardo Saenz-De-Cabezon and Jónatan Heras. Monomial resolutions for efficient computation of simplicial homology
Grigoris Paouris, Kaitlyn Phillipson and J. Maurice Rojas. A Faster Solution to Smale's 17th Problem I: Real Binomial Systems
Seung Gyu Hyun, Stephen Melczer, Éric Schost and Catherine St-Pierre. Change of basis for $\mathfrak{m}$-primary ideals in one and two variables
Adam Kurpisz and Timo de Wolff. New Dependencies of Hierarchies in Polynomial Optimization
Chee Yap and Juan Xu. Effective Subdivision Algorithm for Isolating Zeros of Real Systems of Equations, with Complexity Analysis
Victor Magron, Henning Seidler and Timo de Wolff. Exact optimization via sums of nonnegative circuits and arithmetic-geometric-mean-exponentials
Seung Gyu Hyun, Vincent Neiger and Éric Schost. Implementations of efficient univariate polynomial matrix algorithms and application to bivariate resultants
Svyatoslav Covanov, Davood Mohajerani, Marc Moreno Maza and Lin-Xiao Wang. Big Prime Field FFT on Multi-core Processors