Related papers: A note on invertible quadratic transformations of …
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 give explicit parametric equations for all irreducible plane projective sextic curves which have at most double points and whose total Milnor number is maximal (is equal to 19). In each case we find a parametrization over a number field…
We show that up to linear equivalence, there is only finitely many polynomial quadratic mappings $f:\Bbb C^2\to\Bbb C^2$ and $f:\Bbb R^2\to \Bbb R^2.$ We list all possibilities.
A certain real number, depending on two neighbouring sides of a quadrilateral and the diagonal meeting these two sides at their common point, is shown to be invariant under affinity. As an application we demonstrate a nice formula for the…
While iterating the quadratic polynomial f_{c}(x)=x^{2}+c the degree of the iterates grows very rapidly, and therefore solving the equations corresponding to periodic orbits becomes very difficult even for periodic orbits with a low period.…
This paper studies binary quadratic programs in which the objective is defined by a Euclidean distance matrix, subject to a general polyhedral constraint set. This class of nonconcave maximisation problems includes the capacitated,…
We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…
An important invariant of a polynomial $f$ is its Jacobian algebra defined by its partial derivatives. Let $f$ be invariant with respect to the action of a finite group of diagonal symmetries $G$. We axiomatically define an orbifold…
Which polygons admit two (or more) distinct lattice tilings of the plane? We call such polygons double tiles. It is well-known that a lattice tiling is always combinatorially isomorphic either to a grid of squares or to a grid of regular…
A polynomial map $F=(P,Q)\in \Z [x,y]^2$ with Jacobian $JF:=P_xQ_y-P_yQ_x\equiv 1$ has a polynomial inverse of integer coefficients if the complex plane curve P=0 has infinitely many integer points.
A method for converting the geometrical problem of rectangle packing to an algebraic problem of solving a system of polynomial equations is described.
The problem of minimizing a (nonconvex) quadratic form over the unit simplex, referred to as a standard quadratic program, admits an exact convex conic formulation over the computationally intractable cone of completely positive matrices.…
We prove a sharp upper bound for the projective dimension of ideals of height two generated by quadrics in a polynomial ring with arbitrary large number of variables.
Elimination theory has many applications, in particular, it describes explicitly an image of a complex line under rational transformation and determines the number of common zeroes of two polynomials in one variable. We generalize classical…
A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…
Real algebraic geometry adapts the methods and ideas from (complex) algebraic geometry to study the real solutions to systems of polynomial equations and polynomial inequalities. As it is the real solutions to such systems modeling…
A non-standard quantum deformation of the Poincar\'e algebra is presented in a null-plane framework for 1+1, 2+1 and 3+1 dimensions. Their corresponding universal $R$-matrices are obtained in a factorized form by choosing suitable bases…
Computation of polynomial relative invariants is a classical tool in algebra. Relative differential invariants are central for the equivalence problem of geometric structures. We address the fundamental problem of finite generation of their…
Theorem. An irreducible cubic polynomial with rational coefficients has a root in a one step radical extension of Q if and only if the discriminate is a square of a rational number. Theorem. An irreducible polynomial x^4+px^2+qx+s with…
This brief note concerns the invertibility of certain alternant matrices. In particular those that consisting of polynomials and products of polynomials and logarithms are shown to be invertible under appropriate conditions on the degrees…