Let k be an algebraically closed field. A polynomial F in k[X,Y] is said to be "generally rational" if, for almost all c in k, the curve " F= c '' is rational. It is well known that, if char(k)=0, F is generally rational iff there exists G in k(X,Y) such that k(F,G)=k(X,Y). We give analogous results valid in arbitrary characteristic.
We classify two-variable polynomials which are rational of simple type. These are precisely the two-variable polynomials with trivial homological monodromy.
We determine the Newton trees of the rational polynomials of simple type, thus filling a gap in the proof of the classification of these polynomials given by Neumann and Norbury.
We propose a new lifting and recombination scheme for rational bivariate polynomial factorization that takes advantage of the Newton polytope geometry. We obtain a deterministic algorithm that can be seen as a sparse version of an algorithm of Lecerf, with now a polynomial complexity in the volume of the Newton polytope. We adopt a geometrical point of view, the main tool being derived from some algebraic osculation criterions in toric varieties.
It has been proved several times in the literature that a polynomial map from $C^2$ to $C$ with irreducible rational fibers cannot be a component of a counterexample to the Jacobian Conjecture. This note points out that this result is empty: it is implicit in 1980 work of Miyanish and Sugie that such a polynomial is equivalent to $f(x,y)=x$ by a polynomial automorphism of $C^2$.
This paper is withdrawn. The current main theorem can be proved by using a simple field theory. The main theorem is to placed by another theorem, shortly.
Given rational univariate polynomials f and g such that gcd(f, g) and f / gcd(f, g) are relatively prime, we show that g is non-negative on all the real roots of f if and only if g is a sum of squares of rational polynomials modulo f. We complete our study by exhibiting an algorithm that produces a certificate that a polynomial g is non-negative on the real roots of a non-zero polynomial f , when the above assumption is satisfied.
We construct families of explicit polynomials f with rational coefficients that are sums of squares of polynomials over the real numbers, but not over the rational numbers. Whether or not such examples exist was an open question originally raised by Sturmfels. We also study representations of f as sums of squares of rational functions with rational coefficients. In the case of ternary quartics, we prove that our counterexamples to Sturmfels' question are the only ones.
For each number field k, the Bombieri-Lang conjecture for k-rational points on surfaces of general type implies the existence of a polynomial f(x,y) in k[x,y] inducing an injection k x k --> k.
The aim of this paper is to give two new algorithms, which are elimination free, to find polynomial and rational solutions for a given holonomic system associated to a set of linear differential operators in the Weyl algebra D = k<x_1, ..., x_n, dx_1, ..., dx_n> where k is a subfield of the complex numbers.
We study the problem of computing weighted sum-of-squares (WSOS) certificates for positive polynomials over a compact semialgebraic set. Building on the theory of interior-point methods for convex optimization, we introduce the concept of dual cone certificates, which allows us to interpret vectors from the dual of the sum-of-squares cone as rigorous nonnegativity certificates of a WSOS polynomial. Whereas conventional WSOS certificates are alternative representations of the polynomials they certify, dual certificates are distinct from the certified polynomials; moreover, each dual certificate…
Enumerating ramified coverings of the sphere with fixed ramification types is a well-known problem first considered by A. Hurwitz. Up to now, explicit solutions have been obtained only for some families of ramified coverings, for instant, those realized by polynomials in one complex variable. In this paper we obtain an explicit answer for a large new family of coverings, namely, the coverings realized by simple almost polynomials, defined below. Unlike most other results in the field, our formula is obtained by elementary methods.
An algorithm for annihilator and Bernstein-Sato polynomial of a rational function
Centro de investigación en Matemáticas(数学研究中心);Universidad de La Rioja(拉里奥哈大学);EPAM School of Digital Technologies American University Kyiv(基辅美国大学 EPAM 数字技术学院);Departamento de Matemáticas, IUMA Universidad de Zaragoza(萨拉戈萨大学数学系,IUMA)
We study the change of moduli spaces of Gieseker-semistable torsion free rank-$2$ sheaves on algebraic surfaces as we vary the polarizations. When the surfaces are rational with an effective anti-canonical divisor, the moduli spaces are linked by a series of flips (blowups and blowdowns). Using these results, we compute the transition formulas for Donaldson polynomial invariants of rational surfaces. Part of the work is also obtained independently by Matsuki-Wentworth and Ellingsrud-G{\" o}ttsche.
We consider the finite set of isogeny classes of $g$-dimensional abelian varieties defined over the finite field $\mathbb{F}_q$ with endomorphism algebra being a field. We prove that the class within this set whose varieties have maximal number of rational points is unique, for any prime even power $q$ big enough and verifying mild conditions. We describe its Weil polynomial and we prove that the class is ordinary and cyclic outside the primes dividing an integer that only depends on $g$. In dimension $3$, we prove that the class is ordinary and cyclic and give explicitly its Weil polynomial, …
It is shown that rational points over finite fields of moduli spaces of stable quiver representations are counted by polynomials with integer coefficients. These polynomials are constructed recursively using an identity in the Hall algebra of a quiver.