Related papers: Algebraic integrability with bounded genus
We give an algorithm to decide whether an algebraic plane foliation F has a rational first integral and to compute it in the affirmative case. The algorithm runs whenever we assume the polyhedrality of the cone of curves of the surface…
We solve the Poincar\'e problem for plane foliations with only one dicritical divisor. Moreover, in this case, we give an algorithm that decides whether a foliation has a rational first integral and computes it in the affirmative case. We…
Let F be a holomorphic foliation of general type on CP(2) which admits a rational first integral. We provide bounds for the degree of the first integral of F just in function of the degree, the birational invariants of F and the geometric…
We determine topological and algebraic conditions for a germ of holomorphic foliation $\mathcal F(X)$ induced by a generic vector field $X$ on $(\mathbb{C}^{3},0)$ to have a holomorphic first integral, i.e., a germ of holomorphic map $F…
We give an algorithm for deciding whether a planar polynomial differential system has a first integral which factorizes as a product of defining polynomials of curves with only one place at infinity. In the affirmative case, our algorithm…
We introduce and study birational invariants for foliations on projective surfaces built from the adjoint linear series of positive powers of the canonical bundle of the foliation. We apply the results in order to investigate the effective…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
We study the existence of first integral for holomorphic foliations in different scenarios and under different conditions, for instance germ of foliations given by vector fields and having a formal first integral or infinitely many…
In this paper we consider the question of bounding the degree of an divisor $D$ invariant by a $\F$ holomorphic foliation, without rational first integral, on smooth algebraic variety $X$ in terms of degree of $\F$ and some invariants of…
We give a characterization theorem for non-degenerated plane foliations of degree different from 1 having a rational first integral. Moreover, we prove that the degree $r$ of a non-degenerated foliation as above provides the minimum number,…
Given an order, a commutative ring whose additive group is free of finite rank, a natural computational question is whether a fixed univariate polynomial $f \in \mathbb{Z}[X]$ has a root in this ring. In this paper, we show that the…
We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.
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…
We prove that foliations on the projective plane admitting a Liouvillian first integral but not admitting a rational first integral always have invariant algebraic curves of degree bounded by a function of the degree of the foliation. We…
Let $\mathcal{F}$ be a foliation defined on a complex projective manifold $M$ of dimension $n$ and admitting a holomorphic vector field $X$ tangent to it along some non-empty Zariski-open set. In this paper we prove that if $X$ has…
We determine all F,G in C[X] of degree at least 2 for which the semigroup generated by F and G under composition is not the free semigroup on the letters F and G. We also solve the same problem for F,G in X^2 C[[X]], and prove partial…
We develop a practical algorithm to decide whether a finitely generated subgroup of a solvable algebraic group $G$ is arithmetic. This incorporates a procedure to compute a generating set of an arithmetic subgroup of $G$. We also provide a…
We study groups of germs of complex diffeomorphisms having a property called irreducibility. The notion is motivated by the similar property of the fundamental group of the complement of na irreducible hypersurface in the complex projective…
In this paper, we give polynomial-time algorithms that can take a graph G with a given combinatorial embedding on an orientable surface S of genus g and produce a planar drawing of G in R^2, with a bounding face defined by a polygonal…
Given a squarefree monomial ideal $I$ of a polynomial ring $Q$, we show that if the minimal free resolution $\mathbb{F}$ of $Q/I$ admits the structure of a differential graded (dg) algebra, then so does any ``pruning" of $\mathbb{F}$. In…