THE MEAN SQUARE OF THE PRODUCT OF THE RIEMANN ZETA FUNCTION WITH DIRICHLET POLYNOMIALS SANDRO BETTIN, VORRAPAN CHANDEE, AND MAKSYM RADZIWILL Abstract. Improving earlier work of Balasubramanian, Conrey and Heath-Brown [BC

Source URL: math.rutgers.edu

Laurent polynomials and Eulerian numbers

Source URL: www.mast.queensu.ca

Rigid motions: Action-angles, relative cohomology and polynomials with roots on the unit circle J.-P. Françoise, P. L. Garrido, and G. Gallavotti Citation: J. Math. Phys. 54, ); doi: View o

Source URL: ergodic.ugr.es

Optimization over Polynomials: Selected Topics Monique Laurent Abstract. Minimizing a polynomial function over a region defined by polynomial inequalities models broad classes of hard problems from combinatorics, geometr

Source URL: homepages.cwi.nl

Tom Sharland* (). Matings of cubic polynomials with a fixed critical point. We investigate the matings of pairs of cubic polynomials which have a fixed critical point. We will show tha

Source URL: jointmathematicsmeetings.org

From Approximate Factorization to Root Isolation with Application to Cylindrical Algebraic Decomposition Kurt Mehlhorn Max Planck Institute for Informatics, Saarbr¨ucken, Germany

Source URL: people.mpi-inf.mpg.de

• Mathematics
• Algebra
• Polynomials
• Computer algebra
• Root-finding algorithms
• Factorization of polynomials
• Factorization
• Splitting circle method
• Polynomial
• Resultant
• Multiplicity
• Factorial

Accelerating Bliss: the geometry of ternary polynomials L´eo Ducas University of California, San Diego Abstract

Source URL: homepages.cwi.nl

REPRESENTATIONS OF NON-NEGATIVE POLYNOMIALS, DEGREE BOUNDS AND APPLICATIONS TO OPTIMIZATION M. Marshall Revised July 6, 2006

Source URL: math.usask.ca

ON THE OPTIMALITY OF THE ARF INVARIANT FORMULA FOR GRAPH POLYNOMIALS MARTIN LOEBL AND GREGOR MASBAUM Abstract. We prove optimality of the Arf invariant formula for the generating function of even subgraphs, or, equivalen

Source URL: iti.mff.cuni.cz

REPRESENTATIONS OF NON-NEGATIVE POLYNOMIALS HAVING FINITELY MANY ZEROS M. Marshall Revised September 23, 2004 Let K be a basic closed semialgebraic set in Rn defined by polynomial inequalities

Source URL: math.usask.ca