Related papers: A short proof for the open quadrant problem
The goal of the paper is to give a complete description of the images of noncommutative polynomials with zero constant term on upper triangular matrix algebras over an algebraically closed field. This is a variation of the old and famous…
We first give a characterization for Mathieu subspaces of univariate polynomial algebras over fields in terms of their radicals. We then deduce that for some classes of classical univariate orthogonal polynomials the Image Conjecture is…
The problem of writing real zero polynomials as determinants of linear matrix polynomials has recently attracted a lot of attention. Helton and Vinnikov have proved that any real zero polynomial in two variables has a determinantal…
In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean…
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational…
Although NP-Complete problems are the most difficult decisional problems, it is possible to discover in them polynomial (or easy) observables. We study the Graph Partitioning Problem showing that it is possible to recognize in it two…
For a given graph whose edges are labeled with general real numbers, we consider the set of functions from the vertex set into the Euclidean plane such that the distance between the images of neighbouring vertices is equal to the…
The Hasse principle and weak approximation is established for equations of the shape P(t)=N(x_1,x_2,x_3,x_4), where P is an irreducible quadratic polynomial in one variable and N is a norm form associated to a quartic extension of the…
Orthogonal polynomials on quadratic curves in the plane are studied. These include orthogonal polynomials on ellipses, parabolas, hyperbolas, and two lines. For an integral with respect to an appropriate weight function defined on any…
This paper shows that orbital equations generated by iteration of polynomial maps do not have necessarily a unique representation. Remarkably, they may be represented in an infinity of ways, all interconnected by certain nonlinear…
A hyperoval in the projective plane $\mathbb{P}^2(\mathbb{F}_q)$ is a set of $q+2$ points no three of which are collinear. Hyperovals have been studied extensively since the 1950s with the ultimate goal of establishing a complete…
We prove an explicit upper bound on the number of real quadratic fields that admit a universal quadratic form of a given rank, thus establishing a density zero statement. More generally, we obtain such a result for totally positive definite…
Starting from any given rational-sided, right triangle, for example the $(3,4,5)$-triangle with area $6$, we use Euclidean geometry to show that there are infinitely many other rational-sided, right triangles of the same area. We show…
The concept of open weak CAD is introduced. Every open CAD is an open weak CAD. On the contrary, an open weak CAD is not necessarily an open CAD. An algorithm for computing projection polynomials of open weak CADs is proposed. The key idea…
This work studies path planning in two-dimensional space, in the presence of polygonal obstacles. We specifically address the problem of building a roadmap graph, that is, an abstract representation of all the paths that can potentially be…
We devise a polynomial-time algorithm for partitioning a simple polygon $P$ into a minimum number of star-shaped polygons. The question of whether such an algorithm exists has been open for more than four decades [Avis and Toussaint,…
A polyhedral map is called $\{p, q\}$-equivelar if each face has $p$ edges and each vertex belongs to $q$ faces. In 1983, it was shown that there exist infinitely many geometrically realizable $\{p, q\}$-equivelar polyhedral maps if $q > p…
Let $f$ be a homogeneous polynomial of even degree $d$. We study the decompositions $f=\sum_{i=1}^r f_i^2$ where $\mathrm{deg} f_i=d/2$. The minimal number of summands $r$ is called the $2$-rank of $f$, so that the polynomials having…
We prove that non-hyperbolic non-renormalizable quadratic polynomials are expansion inducing. For renormalizable polynomials a counterpart of this statement is that in the case of unbounded combinatorics renormalized mappings become almost…
We present and discuss different algorithms for converting rectangular imagery into elliptical regions. We mainly focus on methods that use mathematical mappings with explicit and invertible equations. The key idea is to start with…