Table of Contents

• The Complexity of DiagonalizationNikhil Srivastava. 1-6 [doi]
• 3Rekha R. Thomas. 7-12 [doi]
• Least distortion Euclidean embeddings of flat toriFrank Vallentin, Philippe Moustrou. 13-23 [doi]
• Matrix Structures and Matrix FunctionsPaola Boito. 24-30 [doi]
• Invariants: Computation and ApplicationsIrina A. Kogan. 31-40 [doi]
• Algebra-Based Loop AnalysisLaura Kovács. 41-42 [doi]
• The Tropical Nullstellensatz and Positivstellensatz for Sparse Polynomial SystemsMarianne Akian, Antoine Béreau, Stéphane Gaubert. 43-52 [doi]
• Moment Varieties for Mixtures of ProductsYulia Alexandr, Joe Kileel 0001, Bernd Sturmfels. 53-60 [doi]
• An Algorithm to Enumerate Grid Signed Permutation ClassesSaúl A. Blanco, Daniel E. Skora. 61-69 [doi]
• Beating binary powering for polynomial matricesAlin Bostan, Vincent Neiger, Sergey Yurkevich. 70-79 [doi]
• Fast Algorithms for Discrete Differential EquationsAlin Bostan, Hadrien Notarantonio, Mohab Safey El Din. 80-89 [doi]
• Validated Root Enclosures for Interval Polynomials with MultiplicitiesFlorent Bréhard, Adrien Poteaux, Léo Soudant. 90-99 [doi]
• Generalised cone complexes and tropical moduli in polymakeDominic Bunnett, Michael Joswig, Julian Pfeifle. 100-106 [doi]
• Real zeros of mixed random fewnomial systemsPeter Bürgisser. 107-115 [doi]
• Certified simultaneous isotopic approximation of pairs of curves via subdivisionMichael A. Burr, Michael Byrd. 116-125 [doi]
• Isolating clusters of zeros of analytic systems using arbitrary-degree inflationMichael A. Burr, Kisun Lee, Anton Leykin. 126-134 [doi]
• An effective description of the roots of bivariates mod pk and the related Igusa's local zeta functionSayak Chakrabarti, Nitin Saxena 0001. 135-144 [doi]
• Deciding first-order formulas involving univariate mixed trigonometric-polynomialsRizeng Chen, Bican Xia. 145-154 [doi]
• Hermite Reduction for D-finite Functions via Integral BasesShaoshi Chen, Lixin Du, Manuel Kauers. 155-163 [doi]
• Stability Problems on D-finite FunctionsShaoshi Chen, Ruyong Feng, Zewang Guo, Wei Lu. 164-172 [doi]
• A New Black Box Factorization Algorithm - the Non-monic CaseTian Chen, Michael B. Monagan. 173-181 [doi]
• Further results on the computation of the annihilators of integro-differential operatorsThomas Cluzeau, Camille Pinto, Alban Quadrat. 182-190 [doi]
• Hyperelliptic Integrals to Elliptic IntegralsThierry Combot. 191-198 [doi]
• Blendstrings: an environment for computing with smooth functionsRobert M. Corless. 199-207 [doi]
• Chinese Remainder Theorem for bivariate lexicographic Gröbner basesXavier Dahan. 208-217 [doi]
• Lazard-style CAD and Equational ConstraintsJames Harold Davenport, Akshar Sajive Nair, Gregory Kumar Sankaran, Ali Kemal Uncu. 218-226 [doi]
• Sensitivity analysis of discrete preference functions using Koszul simplicial complexesJose Divasón, Fatemeh Mohammadi, Eduardo Sáenz-de-Cabezón, Henry P. Wynn. 227-235 [doi]
• Termination of linear loops under commutative updatesRuiwen Dong 0001. 236-241 [doi]
• Computing Logarithmic Parts by Evaluation Homomorphisms✱Hao Du 0001, Yiman Gao, Jing Guo, Ziming Li 0002. 242-250 [doi]
• Using monodromy to recover symmetries of polynomial systemsTimothy Duff, Viktor Korotynskiy, Tomás Pajdla, Margaret H. Regan. 251-259 [doi]
• A Direttissimo Algorithm for Equidimensional DecompositionChristian Eder, Pierre Lairez, Rafael Mohr, Mohab Safey El Din. 260-269 [doi]
• Refined F5 Algorithms for Ideals of Minors of Square MatricesSriram Gopalakrishnan, Vincent Neiger, Mohab Safey El Din. 270-279 [doi]
• A note on the computational complexity of the moment-SOS hierarchy for polynomial optimizationSander Gribling, Sven Polak, Lucas Slot. 280-288 [doi]
• Towards Practical Fast Matrix Multiplication based on Trilinear AggregationTor Hadas, Oded Schwartz. 289-297 [doi]
• Signature Gröbner bases in free algebras over ringsClemens Hofstadler, Thibaut Verron. 298-306 [doi]
• Using Symbolic Computation to Analyze Zero-Hopf Bifurcations of Polynomial Differential SystemsBo Huang. 307-314 [doi]
• New Sparse Multivariate Polynomial Factorization Algorithms over IntegersQiao-Long Huang, Xiao-Shan Gao. 315-324 [doi]
• Fast evaluation and root finding for polynomials with floating-point coefficientsRémi Imbach, Guillaume Moroz. 325-334 [doi]
• Multiplication polynomials for elliptic curves over finite local ringsRiccardo Invernizzi, Daniele Taufer. 335-344 [doi]
• Algorithm for Connectivity Queries on Real Algebraic CurvesMd. Nazrul Islam, Adrien Poteaux, Rémi Prébet. 345-353 [doi]
• On the Order of Power Series and the Sum of Square Roots ProblemGorav Jindal, Louis Gaillard. 354-362 [doi]
• On Isolating Roots in a Multiple Field ExtensionChristina Katsamaki, Fabrice Rouillier. 363-371 [doi]
• Transcendence Certificates for D-finite FunctionsManuel Kauers, Christoph Koutschan, Thibaut Verron. 372-380 [doi]
• Flip Graphs for Matrix MultiplicationManuel Kauers, Jakob Moosbauer. 381-388 [doi]
• Order bounds for C2-finite sequencesManuel Kauers, Philipp Nuspl, Veronika Pillwein. 389-397 [doi]
• From Polynomial Invariants to Linear LoopsGeorge Kenison, Laura Kovács, Anton Varonka. 398-406 [doi]
• The Membership Problem for Hypergeometric Sequences with Quadratic ParametersGeorge Kenison, Klara Nosan, Mahsa Shirmohammadi, James Worrell 0001. 407-416 [doi]
• Factorization and root-finding for polynomials over division quaternion algebrasPrzemyslaw Koprowski. 417-424 [doi]
• Pourchet's theorem in action: decomposing univariate nonnegative polynomials as sums of five squaresPrzemyslaw Koprowski, Victor Magron, Tristan Vaccon. 425-433 [doi]
• A Unified Approach to Unimodality of Gaussian PolynomialsChristoph Koutschan, Ali Kemal Uncu, Elaine Wong. 434-442 [doi]
• Sum of Squares Bounds for the Empty Integral Hull ProblemAdam Kurpisz, Elias Samuel Wirth. 443-451 [doi]
• Faster real root decision algorithm for symmetric polynomialsGeorge Labahn, Cordian Riener, Mohab Safey El Din, Éric Schost, Thi Xuan Vu. 452-460 [doi]
• Computing the Characteristic Polynomial of Endomorphisms of a finite Drinfeld Module using Crystalline CohomologyYossef Musleh, Éric Schost. 461-469 [doi]
• SLRA Interpolation for Approximate GCD of Several Multivariate PolynomialsKosaku Nagasaka. 470-479 [doi]
• Exact computations with quasiseparable matricesClément Pernet, Hippolyte Signargout, Gilles Villard. 480-489 [doi]
• New Characterization of the Factor Refinement Algorithm with ApplicationsAditya Ravi, Ilya Volkovich. 490-497 [doi]
• Refined telescoping algorithms in RΠΣ -extensions to reduce the degrees of the denominators✱Carsten Schneider. 498-507 [doi]
• p-adic algorithm for bivariate Gröbner basesÉric Schost, Catherine St-Pierre. 508-516 [doi]
• Universal Analytic Gröbner Bases and Tropical GeometryTristan Vaccon, Thibaut Verron. 517-525 [doi]
• Elimination ideal and bivariate resultant over finite fieldsGilles Villard. 526-534 [doi]
• Efficient Generic Quotients Using Exact ArithmeticStephen Michael Watt. 535-544 [doi]
• A Characterization of Perfect Strategies for Mirror GamesSizhuo Yan, Jianting Yang, Tianshi Yu, Lihong Zhi. 545-554 [doi]