Related papers: Algebraic integrability with bounded genus

In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…

Let $n$ be a positive integer and let $f_1, \ldots, f_r$ be polynomials in $n^2$ indeterminates over an algebraically closed field $K$. We describe an algorithm to decide if the invertible matrices contained in the variety of $f_1, \ldots,…

Let $\mathcal{F}$ denote a singular holomorphic foliation on $\mathbb{P}^2$ having a finite automorphism group $\mbox{aut}(\mathcal{F})$. Fixed the degree of $\mathcal{F}$, we determine the maximal value that $|\mbox{aut}(\mathcal{F})|$ can…

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.

We study a necessary condition for the integrability of the polynomials fields in the plane by means of the differential Galois theory. More concretely, by means of the variational equations around a particular solution it is obtained a…

We produce algorithms to detect whether a complex affine variety computed and presented numerically by the machinery of numerical algebraic geometry corresponds to an associated component of a polynomial ideal.

We show that, for any fixed genus $g$, the ordinary generating function for the genus $g$ partitions of an $n$-element set into $k$ blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a…

Let $\mathbb{F}_q$ be a finite field. Given two irreducible polynomials $f,g$ over $\mathbb{F}_q$, with $\mathrm{deg} f$ dividing $\mathrm{deg} g$, the finite field embedding problem asks to compute an explicit description of a field…

The classical Lyapunov-Poincar\'e center theorem assures the existence of a first integral for an analytic one-form near a center singularity in dimension two, provided that the first jet of the one-form is nondegenerate. The basic point is…

Let $\mathcal{P}_4$ be the linear family of foliations of degree 4 in $\mathbb{P}^2$ given by A. Lins Neto, whose set of parameters with first integral $I_p(\mathcal{P}_4)$ is dense and countable. In this work, we will calculate explicitly…

We present a new algorithm to decide isomorphism between finite graded algebras. For a broad class of nilpotent Lie algebras, we demonstrate that it runs in time polynomial in the order of the input algebras. We introduce heuristics that…

A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…

A univariate polynomial f over a field is decomposable if f = g o h = g(h) for nonlinear polynomials g and h. In order to count the decomposables, one wants to know, under a suitable normalization, the number of equal-degree collisions of…

In this note we consider the Milnor fiber $F$ associated to a reduced projective plane curve $C$. A computational approach for the determination of the characteristic polynomial of the monodromy action on the first cohomology group of $F$,…

We address univariate root isolation when the polynomial's coefficients are in a multiple field extension. We consider a polynomial $F \in L[Y]$, where $L$ is a multiple algebraic extension of $\mathbb{Q}$. We provide aggregate bounds for…

Computer algebra systems are really good at factoring polynomials, i.e. writing f as a product of irreducible factors. It is relatively easy to verify that we have a factorisation, but verifying that these factors are irreducible is a much…

We prove a complete classification of degree-$2$ foliations on $\mathbb{P}^n$ in any dimension, assuming they are not algebraically integrable. If $\mathcal{F}$ is such a foliation, then either $\mathcal{F}$ is the linear pull-back of a…

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

In the complexity estimation for an attack that reduces a cryptosystem to solving a system of polynomial equations, the degree of regularity and an upper bound of the first fall degree are often used in cryptanalysis. While the degree of…

Let G be a finite group and A a finite dimensional G-graded algebra over a field of characteristic zero. When A is simple as a G-graded algebra, by mean of Regev central polynomials we construct multialternating graded polynomials of…