Related papers: Algebraic integrability with bounded genus

We present an algorithm to determine the Galois group of an irreducible monic polynomial $f(x) \in \mathbb{Z}[x]$ of degree at most five. Following work of Conrad, Dummit, and Stauduhar this comes down to answering two questions: Is a given…

In 2010, A. Shpilka and I. Volkovich established a prominent result on the equivalence of polynomial factorization and identity testing. It follows from their result that a multilinear polynomial over the finite field of order 2 can be…

A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

We investigate the interplay between invariant varieties of vector fields and the inflection locus of linear systems with respect to the vector field. Among the consequences of such investigation we obtain a computational criteria for the…

We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…

We study foliations $\mathcal{F}$ on Hirzebruch surfaces $S_\delta$ and prove that, similarly to those on the projective plane, any $\mathcal{F}$ can be represented by a bi-homogeneous polynomial affine $1$-form. In case $\mathcal{F}$ has…

We describe simple algebraic and combinatorial characterisations of finite relational core structures admitting finitely many obstructions. As a consequence, we show that it is decidable to determine whether a constraint satisfaction…

Modular algorithm are widely used in computer algebra systems (CAS), for example to compute efficiently the gcd of multivariate polynomials. It is known to work to compute Groebner basis over $\Q$, but it does not seem to be popular among…

We describe an algorithm to compute the essentially different factorizations of a given image primitive integer-valued polynomial $f(X)=g(X)/d\in\Q[X]$, where $g\in\Z[X]$ and $d\in\N$ is square-free, assuming that the factorization of…

In this paper, we study the holomorphic foliations admitting a common invariant algebraic set $C$ defined by a polynomial $f$ in $ \mathbb{K}[x_1,x_2,...,x_n]$ over any characteristic $0$ subfield $\mathbb{K}\subseteq\mathbb{C}$. For the…

Let $G$ be the group $SL(2,\mathbb{R})$, $P\subset G$ be the parabolic subgroup of upper triangular matrices and $\Gamma\subset G$ be a cocompact lattice. A right action of $P$ on $\Gamma\backslash G$ defines an orbit foliation…

We consider the problems of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the result of the modification satisfies some property definable in first-order logic. We establish a number…

We construct a family of root-finding algorithms which exploit the branched covering structure of a polynomial of degree $d$ with a path-lifting algorithm for finding individual roots. In particular, the family includes an algorithm that…

We give an algorithm to compute representatives of the conjugacy classes of semisimple square integral matrices with given minimal and characteristic polynomials. We also give an algorithm to compute the $\mathbb{F}_q$-isomorphism classes…

Consider a planar polynomial vector field $X$, and assume it admits a symbolic first integral $\mathcal{F}$, i.e. of the $4$ classes, in growing complexity: Rational, Darbouxian, Liouvillian and Riccati. If $\mathcal{F}$ is not rational, it…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…

Let $p$ be a prime and $n$ a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra $\mathbb{F}_p[A_1,\dots,A_t]$ with $A_1,\dots,A_t \in \mathrm{GL}(n,\mathbb{F}_p)$ is a…

In this paper, we give algorithms for determining the existence of isomorphism between two finite-dimensional Lie algebras and compute such an isomorphism in the affirrmative case. We also provide algorithms for determining algebraic…