Table of Contents

• Reflections on elimination theoryDavid A. Cox. 1-4 [doi]
• Positive solutions of sparse polynomial systemsAlicia Dickenstein. 5-7 [doi]
• Ubiquity of the exponent of matrix multiplicationLek-Heng Lim, Ke Ye. 8-11 [doi]
• What do sparse interpolation, padé approximation, gaussian quadrature and tensor decomposition have in common?Annie A. M. Cuyt. 12 [doi]
• Real quantifier elimination by cylindrical algebraic decomposition, and improvements by machine learningMatthew England. 13 [doi]
• Sub-quadratic time for riemann-roch spaces: case of smooth divisors over nodal plane projective curvesSimon Abelard, Alain Couvreur, Grégoire Lecerf. 14-21 [doi]
• On the parallelization of triangular decompositionsMohammadali Asadi, Alexander Brandt, Robert H. C. Moir, Marc Moreno Maza, Yuzhen Xie. 22-29 [doi]
• The orbiter ecosystem for combinatorial dataAnton Betten. 30-37 [doi]
• A Las Vegas algorithm for computing the smith form of a nonsingular integer matrixStavros Birmpilis, George Labahn, Arne Storjohann. 38-45 [doi]
• Computing the N-th term of a q-holonomic sequenceAlin Bostan. 46-53 [doi]
• Separating variables in bivariate polynomial idealsManfred Buchacher, Manuel Kauers, Gleb Pogudin. 54-61 [doi]
• Robots, computer algebra and eight connected componentsJose Capco, Mohab Safey El Din, Josef Schicho. 62-69 [doi]
• Signature-based algorithms for Gröbner bases over tate algebrasXavier Caruso, Tristan Vaccon, Thibaut Verron. 70-77 [doi]
• Syzygies of ideals of polynomial rings over principal ideal domainsHara Charalambous, Kostas Karagiannis, Sotiris Karanikolopoulos, Aristides Kontogeorgis. 78-82 [doi]
• Compatible rewriting of noncommutative polynomials for proving operator identitiesCyrille Chenavier, Clemens Hofstadler, Clemens G. Raab, Georg Regensburger. 83-90 [doi]
• Integral bases for p-recursive sequencesShaoshi Chen, Lixin Du, Manuel Kauers, Thibaut Verron. 91-98 [doi]
• A Gröbner-basis theory for divide-and-conquer recurrencesFrédéric Chyzak, Philippe Dumas. 99-106 [doi]
• μ: bases of parametric surfacesTeresa Cortadellas, Carlos D'Andrea, M. Eulalia Montoro. 107-113 [doi]
• On a non-archimedean broyden methodXavier Dahan, Tristan Vaccon. 114-121 [doi]
• Decidability of membership problems for flat rational subsets of GL(2, Q) and singular matricesVolker Diekert, Igor Potapov, Pavel Semukhin. 122-129 [doi]
• On the apolar algebra of a product of linear formsMichael DiPasquale, Zachary Flores, Chris Peterson. 130-137 [doi]
• Global optimization via the dual SONC cone and linear programmingMareike Dressler, Janin Heuer, Helen Naumann, Timo de Wolff. 138-145 [doi]
• An additive decomposition in logarithmic towers and beyondHao Du, Jing Guo, Ziming Li, Elaine Wong. 146-153 [doi]
• Numerical equality tests for rational maps and signatures of curvesTimothy Duff, Michael Ruddy. 154-161 [doi]
• On fast multiplication of a matrix by its transposeJean-Guillaume Dumas, Clément Pernet, Alexandre Sedoglavic. 162-169 [doi]
• On the bit complexity of finding points in connected components of a smooth real hypersurfaceJesse Elliott, Mark Giesbrecht, Éric Schost. 170-177 [doi]
• The fundamental theorem of tropical partial differential algebraic geometrySebastian Falkensteiner, Cristhian Garay-López, Mercedes Haiech, Marc Paul Noordman, Zeinab Toghani, François Boulier. 178-185 [doi]
• Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degreeAbhibhav Garg, Nitin Saxena 0001. 186-193 [doi]
• Sparse multiplication for skew polynomialsMark Giesbrecht, Qiao-Long Huang, Éric Schost. 194-201 [doi]
• Essentially optimal sparse polynomial multiplicationPascal Giorgi, Bruno Grenet, Armelle Perret du Cray. 202-209 [doi]
• Fast in-place algorithms for polynomial operations: division, evaluation, interpolationPascal Giorgi, Bruno Grenet, Daniel S. Roche. 210-217 [doi]
• Subdivisions for macaulay formulas of sparse systemsFriedemann Groh. 218-225 [doi]
• On the uniqueness of simultaneous rational function reconstructionEleonora Guerrini, Romain Lebreton, Ilaria Zappatore. 226-233 [doi]
• Efficient ECM factorization in parallel with the lyness mapAndrew Hone. 234-240 [doi]
• Algorithmic averaging for studying periodic orbits of planar differential systemsBo Huang. 241-248 [doi]
• New progress in univariate polynomial root findingRémi Imbach, Victor Y. Pan. 249-256 [doi]
• On FGLM algorithms with tropical Gröbner basesYuki Ishihara, Tristan Vaccon, Kazuhiro Yokoyama. 257-264 [doi]
• Modular techniques for effective localization and double ideal quotientYuki Ishihara. 265-272 [doi]
• How many zeros of a random sparse polynomial are real?Gorav Jindal, Anurag Pandey, Himanshu Shukla, Charilaos Zisopoulos. 273-280 [doi]
• On the geometry and the topology of parametric curvesChristina Katsamaki, Fabrice Rouillier, Elias P. Tsigaridas, Zafeirakis Zafeirakopoulos. 281-288 [doi]
• On the skolem problem and prime powersGeorge Kenison, Richard Lipton, Joël Ouaknine, James Worrell 0001. 289-296 [doi]
• Computing the real isolated points of an algebraic hypersurfaceHuu Phuoc Le, Mohab Safey El Din, Timo de Wolff. 297-304 [doi]
• Letterplace: a subsystem of singular for computations with free algebras via letterplace embeddingViktor Levandovskyy, Hans Schönemann, Karim Abou Zeid. 305-311 [doi]
• Computation of free non-commutative gröbner bases over Z with Singular: LetterplaceViktor Levandovskyy, Tobias Metzlaff, Karim Abou Zeid. 312-319 [doi]
• Some properties of multivariate differential dimension polynomials and their invariantsAlexander Levin. 320-327 [doi]
• Further results on the factorization and equivalence for multivariate polynomial matricesDong Lu, DingKang Wang, Fanghui Xiao. 328-335 [doi]
• Punctual Hilbert scheme and certified approximate singularitiesAngelos Mantzaflaris, Bernard Mourrain, Ágnes Szántó. 336-343 [doi]
• rAxel Mathieu-Mahias, Michaël Quisquater. 344-351 [doi]
• WhyMP, a formally verified arbitrary-precision integer libraryGuillaume Melquiond, Raphaël Rieu-Helft. 352-359 [doi]
• On parameterized complexity of the word search problem in the Baumslag-Gersten groupAlexei Miasnikov, Andrey Nikolaev. 360-363 [doi]
• On the chordality of ordinary differential triangular decomposition in top-down styleChenqi Mou. 364-371 [doi]
• Approximate GCD by bernstein basis, and its applicationsKosaku Nagasaka. 372-379 [doi]
• A divide-and-conquer algorithm for computing gröbner bases of syzygies in finite dimensionSimone Naldi, Vincent Neiger. 380-387 [doi]
• Generic bivariate multi-point evaluation, interpolation and modular composition with precomputationVincent Neiger, Johan Rosenkilde, Grigory Solomatov. 388-395 [doi]
• Conditional lower bounds on the spectrahedral representation of explicit hyperbolicity conesRafael Oliveira 0006. 396-401 [doi]
• Ideal Interpolation, H-bases and symmetryErick Rodríguez Bazan, Evelyne Hubert. 402-409 [doi]
• Generalizing the davenport-mahler-mignotte boundVikram Sharma 0001. 410-417 [doi]
• General witness sets for numerical algebraic geometryFrank Sottile. 418-425 [doi]
• Parametric standard system for mixed module and its application to singularity theoryHiroshi Teramoto, Katsusuke Nabeshima. 426-433 [doi]
• Condition numbers for the cube: i: Univariate polynomials and hypersurfacesJosué Tonelli-Cueto, Elias P. Tsigaridas. 434-441 [doi]
• An extended GCD algorithm for parametric univariate polynomials and application to parametric smith normal formDingKang Wang, Hesong Wang, Fanghui Xiao. 442-449 [doi]
• A second order cone characterization for sums of nonnegative circuitsJie Wang 0037, Victor Magron. 450-457 [doi]
• Geometric modeling and regularization of algebraic problemsZhonggang Zeng. 458-465 [doi]