English
Related papers

Related papers: Reduction of Elementary Integrability of Polynomia…

200 papers

We provide an algorithm which decides whether a polynomial foliation $\mathcal{F}^{\mathbb{C}^2}$ on the complex plane has a polynomial first integral of genus $g\neq 1$. Except in a specific case, an extension of the algorithm also decides…

Algebraic Geometry · Mathematics 2025-07-15 Carlos Galindo , Francisco Monserrat , Elvira Pérez-Callejo

We discuss criteria for the nonexistence, existence and computation of invariant algebraic surfaces for three-dimensional complex polynomial vector fields, thus transferring a classical problem of Poincar\'e from dimension two to dimension…

Dynamical Systems · Mathematics 2019-07-30 Niclas Kruff , Jaume Llibre , Chara Pantazi , Sebastian Walcher

Let $K$ be a field, and $A=K[a_1,\ldots ,a_n]$ a solvable polynomial algebra in the sense of [K-RW, {\it J. Symbolic Comput.}, 9(1990), 1--26]. Based on the Gr\"obner basis theory for $A$ and for free modules over $A$, an elimination theory…

Rings and Algebras · Mathematics 2019-01-15 Huishi Li

We present algorithms to factorize weighted homogeneous elements in the first polynomial Weyl algebra and $q$-Weyl algebra, which are both viewed as a $\mathbb{Z}$-graded rings. We show, that factorization of homogeneous polynomials can be…

Symbolic Computation · Computer Science 2016-02-19 Albert Heinle , Viktor Levandovskyy

Given a global field $K$ and a positive integer $n$, we present a diophantine criterion for a polynomial in one variable of degree $n$ over $K$ not to have any root in $K$. This strengthens the known result that the set of non-$n$-th-powers…

Number Theory · Mathematics 2019-02-20 Philip Dittmann

In this article, we study model-theoretic properties of algebraic differential equations of order $2$, defined over constant differential fields. In particular, we show that the set of solutions of a general differential equation of order…

Logic · Mathematics 2022-02-09 Rémi Jaoui

Let $K[x]$ be a polynomial algebra in a variable $x$ over a commutative $\Q$-algebra $K$, and $\G'$ be the monoid of $K$-algebra monomorphisms of $K[x]$ of the type $\s : x\mapsto x+\l_2x^2+... +\l_nx^n$, $\l_i\in K$, $\l_n$ is a unit of…

Rings and Algebras · Mathematics 2007-05-23 V. V. Bavula

If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…

Number Theory · Mathematics 2024-09-16 Jose Felipe Voloch

The criterion for an affine primary algebra over the field to be integral, is proven. Using this criterion we give a simple proof that Hilbert scheme of 0-dimensional subschemes of length $l$ of nonsingular $d$-dimensional algebraic variety…

Algebraic Geometry · Mathematics 2015-04-29 Nadezda Timofeeva

We give a method of constructing polynomials of arbitrarily large degree irreducible over a global field F but reducible modulo every prime of F. The method consists of finding quadratic f in F[x] whose iterates have the desired property,…

Number Theory · Mathematics 2012-09-11 Rafe Jones

Kronecker observed that either all roots or only one root of a solvable irreducible equation of odd prime degree with integer coefficients are real. This gives a possibility to construct specific examples of equations not solvable by…

Number Theory · Mathematics 2025-11-06 Juliusz Brzeziński , Jan Stevens

We give a precise description of how the class group of a number field measures the failure of unique factorization in its ring of integers. Specifically, following ideas of Kummer, we determine the structure of all irreducible…

Number Theory · Mathematics 2014-12-30 Kimball Martin

We prove a Darboux-Jouanolou type theorem on the algebraic integrability of polynomial differential $r$-forms over arbitrary fields ($r\geq 1$). We also investigate the Darboux's method for producing integrating factors.

Exactly Solvable and Integrable Systems · Physics 2021-10-19 Edileno de Almeida Santos , Sergio Rodrigues

Deciding whether or not two polynomials have isomoprhic splitting fields over the rationals is the Field Isomorphism Problem. We consider polynomials of the form $f_n(x) = x^4-nx^3-6x^2+nx+1$ with $n \neq 3$ a positive integer and we let…

Number Theory · Mathematics 2024-06-18 David L. Pincus , Lawrence C. Washington

Let $D$ be an integrally closed domain with quotient field $K$. Let $A$ be a torsion-free $D$-algebra that is finitely generated as a $D$-module. For every $a$ in $A$ we consider its minimal polynomial $\mu_a(X)\in D[X]$, i.e. the monic…

Commutative Algebra · Mathematics 2018-10-03 Giulio Peruginelli , Nicholas J. Werner

Let $\mathbb{F}_{q^n}$ be a finite field with $q^n$ elements and $r$ be a positive divisor of $q^n-1$. An element $\alpha \in \mathbb{F}_{q^n}^*$ is called $r$-primitive if its multiplicative order is $(q^n-1)/r$. Also, $\alpha \in…

Number Theory · Mathematics 2022-10-24 Josimar J. R. Aguirre , Victor G. L. Neumann

Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fractions of the ring of formal power series $K[[x_1,\ldots,x_r]]$, $r\geq 2$. More precisely, we view the latter as a subfield of an iterated…

Commutative Algebra · Mathematics 2023-07-11 Michel Hickel , Mickaël Matusinski

We prove that an irreducible polynomial derivation in positive characteristic is a Jacobian derivation if and only if there exists an n-1-element p-basis of its ring of constants. In the case of two variables we characterize these…

Commutative Algebra · Mathematics 2013-06-21 Piotr Jedrzejewicz

Let $D$ be an integral domain with quotient field $K$ and $\Omega$ a finite subset of $D$. McQuillan proved that the ring ${\rm Int}(\Omega,D)$ of polynomials in $K[X]$ which are integer-valued over $\Omega$, that is, $f\in K[X]$ such that…

Rings and Algebras · Mathematics 2018-10-03 G. Peruginelli

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena