Related papers: Algebraic integrability with bounded genus
We consider germs of holomorphic vector fields at the origin of $\mathbb{C}^3$, with non-isolated singularities that are tangent to a holomorphic foliation of codimension one. This configuration is known as a $2$-flag of foliations. The…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
We introduce a procedure based on computational algebraic geometry to determine whether two algebras are isomorphic. We then apply it to show that if $R$ is a commutative unital ring in which $2$ is not invertible, $G$ is a group of order…
In this paper we provide an algorithm, similar to the simplex algorithm, which determines a rational cp-factorization of a given matrix, whenever the matrix allows such a factorization. This algorithm can be used to show that every integral…
Recent work introduced Generalized First Order Decision Diagrams (GFODD) as a knowledge representation that is useful in mechanizing decision theoretic planning in relational domains. GFODDs generalize function-free first order logic and…
Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…
For every graph $H$, there exists a polynomial-time algorithm deciding if a planar input graph $G$ can be contracted to~$H$. However, the degree of the polynomial depends on the size of $H$. In this paper, we identify a class of graphs…
Suppose $P$ is a symmetric convex polygon in the plane. We give a polynomial time algorithm that decides if $P$ can tile the plane by transations at some level (not necessarily at level one; this is multiple tiling). The main technical…
We consider the problem of identity testing and recovering (that is, interpolating) of a "hidden" monic polynomials $f$, given an oracle access to $f(x)^e$ for $x\in\mathbb F_q$, where $\mathbb F_q$ is the finite field of $q$ elements and…
Aiming to provide weak as possible axiomatic assumptions in which one can develop basic linear algebra, we give a uniform and integral version of the short propositional proofs for the determinant identities demonstrated over $GF(2)$ in…
Deciding whether a given graph has a square root is a classical problem that has been studied extensively both from graph theoretic and from algorithmic perspectives. The problem is NP-complete in general, and consequently substantial…
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…
Given a univariate polynomial f(x) over a ring R, we examine when we can write f(x) as g(h(x)) where g and h are polynomials of degree at least 2. We answer two questions of Gusic regarding when the existence of such g and h over an…
We investigate the polynomial closure operation (C -> Pol(C)) defined on classes of regular languages. We present an interesting and useful connection relating the separation problem for the class C and the membership problem for it…
We prove that, under mild restrictions, the space of codimension-one foliations of degree one on a smooth projective complete intersection has two irreducible components of logarithmic type. We also prove that the same conclusion holds for…
We give a geometrical demonstration to the existence of holomorphic first integrals for certain kind of vector fields in $\mathbb{C}^2$ and $\mathbb{C}^3$.
Motivated by index theory for semisimple groups, we study the relationship between the foliation C^*-algebras on manifolds admitting multiple fibrations. Let F_1,...,F_r be a collection of smooth foliations of a manifold X. We impose a…
Let A be a finite dimensional algebra over a field of characteristic zero graded by a finite abelian group G. Here we study a growth function related to the graded polynomial identities satisfied by A by computing the exponential rate of…
The definition of $1$-planar graphs naturally extends graph planarity, namely a graph is $1$-planar if it can be drawn in the plane with at most one crossing per edge. Unfortunately, while testing graph planarity is solvable in linear time,…
Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…