Related papers: Algebraic integrability with bounded genus

Let G be a Lie groupoid with Lie algebroid g. It is known that, unlike in the case of Lie groups, not every subalgebroid of g can be integrated by a subgroupoid of G. In this paper we study conditions on the invariant foliation defined by a…

Let $\mathbb F$ be an algebraically closed field, $G$ be an abelian group, and let $A$ and $B$ be arbitrary finite-dimensional $G$-graded simple algebras over $\mathbb F$. We prove that $A$ and $B$ are isomorphic if, and only if, they…

Can an ideal I in a polynomial ring k[x] over a field be moved by a change of coordinates into a position where it is generated by binomials $x^a - cx^b$ with c in k, or by unital binomials (i.e., with c = 0 or 1)? Can a variety be moved…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

The bivariate difference filed $(\mathbb{F}(\alpha, \beta), \sigma)$ provides an algebraic framework for a sequence satisfying a recurrence of order two and it could transform the summation involving a sequence satisfying a recurrence of…

Let $F$ be an integral linear recurrence, $G$ be an integer-valued polynomial splitting over the rationals, and $h$ be a positive integer. Also, let $\mathcal{A}_{F,G,h}$ be the set of all natural numbers $n$ such that $\gcd(F(n), G(n)) =…

A group $G$ has cube-free order if no prime to the third power divides $|G|$. We describe an algorithm that given two cube-free groups $G$ and $H$ of known order, decides whether $G\cong H$, and, if so, constructs an isomorphism $G\to H$.…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

This work deals with the definability problem by quantifier-free first-order formulas over a finite algebraic structure. We show the problem to be coNP-complete and present two decision algorithms based on a semantical characterization of…

The aim of this paper is to show that there exists a deterministic algorithm that can be applied to compute the factors of a polynomial of degree 2, defined over a finite field, given certain conditions.

We study under the standpoint of integrable complex analytic 1-forms (complex analytic foliations), a class of second order ordinary differential equations with periodic coefficients. More precisely, we study Hill's equations of motion of…

Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

We study algebraic integrability of complex planar polynomial vector fields $X=A (x,y)(\partial/\partial x) + B(x,y) (\partial/\partial y) $ through extensions to Hirzebruch surfaces. Using these extensions, each vector field $X$ determines…

We consider the problem of extending germs of plane holomorphic foliations to foliations of compact surfaces. We show that the germs that become regular after a single blow up and admit meromorphic first integrals can be extended, after…

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. An algebra is said to be affine complete if every congruence preserving function is a polynomial…

We give a classification of pairs (F, f) where F is a holomorphic foliation on a projective surface and f is a non-invertible dominant rational map preserving F. We prove that both the map and the foliation are integrable in a suitable…

We present fast algorithms for computing rational first integrals with bounded degree of a planar polynomial vector field. Our approach is inspired by an idea of Ferragut and Giacomini. We improve upon their work by proving that rational…

Let K be a global field and f in K[X] be a polynomial. We present an efficient algorithm which factors f in polynomial time.