Related papers: A short proof for the open quadrant problem

Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…

In this paper we have given an algorithmic proof of an long standing Barnette's conjecture (1969) that every 3-connected bipartite cubic planar graph is hamiltonian. Our method is quite different than the known approaches and it rely on the…

We complete the complexity classification by degree of minimizing a polynomial over the integer points in a polyhedron in $\mathbb{R}^2$. Previous work shows that optimizing a quadratic polynomial over the integer points in a polyhedral…

One can associate to any bivariate polynomial P(X,Y) its Newton polygon. This is the convex hull of the points (i,j) such that the monomial X^i Y^j appears in P with a nonzero coefficient. We conjecture that when P is expressed as a sum of…

The problem of polynomial regression in which the usual monomial basis is replaced by the Bernstein basis is considered. The coefficient matrix A of the overdetermined system to be solved in the least squares sense is then a rectangular…

In our previous works (2012, 2013), we provided a finite list of properties characterizing all potential types of quadratic birational transformations of a projective space into a factorial variety, whose base locus is smooth and…

The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…

Illumination of scenes is usually generated in computer graphics using polygonal meshes. In this paper, we present a geometric method using projections. Starting from an implicit polynomial equation of a surface in 3-D or a curve in 2-D, we…

We explore the interplay between algebraic combinatorics and algorithmic problems in graph theory by defining a polynomial with connections to correspondence colouring (also known as DP-colouring), a recent generalization of list-colouring,…

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

We present subquadratic algorithms, in the algebraic decision-tree model of computation, for detecting whether there exists a triple of points, belonging to three respective sets $A$, $B$, and $C$ of points in the plane, that satisfy a…

For a field $E$ of characteristic different from $2$ and cohomological $2$-dimension one, quadratic forms over the rational function field $E(X)$ are studied. A characterisation in terms of polynomials in $E[X]$ is obtained for having that…

In this paper, an algorithm for determining 3-colorability, i.e. the decision problem (YES/NO), in planar graphs is presented. The algorithm, although not exact (it could produce false positives) has two very important features: (i) it has…

To any combinatorial triangulation $T$ of a square, there is an associated polynomial relation $p_T$ among the areas of the triangles of $T$. With the goal of understanding this polynomial, we consider polynomials obtained from $p_T$ by…

We describe a polynomial time algorithm that takes as input a polygon with axis-parallel sides but irrational vertex coordinates, and outputs a set of as few rectangles as possible into which it can be dissected by axis-parallel cuts and…

We show that the iterated images of a Jacobian pair stabilize; that is, the k-th iterates of a polynomial map of complex two-space to itself with a nonzero constant Jacobian determinant all have the same image for sufficiently large k. More…

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in an arbitrary field $K$. Kaplansky conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of $n$ by $n$ matrices is either…

In this paper, we investigate the subset obtained by evaluations of a fixed multilinear polynomial on a given algebra. We provide an example of a multilinear polynomial, whose image is not a vector subspace; namely, the product of two…

We revisit the classical Perspective-Three-Point (P3P) problem, which aims to recover the absolute pose of a calibrated camera from three 2D-3D correspondences. It has long been known that P3P can be reduced to a quartic polynomial with…

In this paper we prove existence of matings between a large class of renormalizable cubic polynomials with one fixed critical point and another cubic polynomial having two fixed critical points. The resulting mating is a Newton map. Our…