Related papers: Solving square polynomial systems : a practical me…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
Using the circle method, we obtain asymptotic formulae for the number of integer solutions to certain quadratic polynomials that are uniform in the coefficients of the polynomial.
Over a finite field $\mathbb{F}_{q^m}$, the evaluation of skew polynomials is intimately related to the evaluation of linearized polynomials. This connection allows one to relate the concept of polynomial independence defined for skew…
Given a zero-dimensional polynomial system consisting of n integer polynomials in n variables, we propose a certified and complete method to compute all complex solutions of the system as well as a corresponding separating linear form l…
Finding the solutions to a system of multivariate polynomial equations is a fundamental problem in mathematics and computer science. It involves evaluating the polynomials at many points, often chosen from a grid. In most current methods,…
We consider systems of strict multivariate polynomial inequalities over the reals. All polynomial coefficients are parameters ranging over the reals, where for each coefficient we prescribe its sign. We are interested in the existence of…
This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…
This paper is concerned with the factorization and equivalence problems of multivariate polynomial matrices. We present some new criteria for the existence of matrix factorizations for a class of multivariate polynomial matrices, and obtain…
The multivariate resultant is a fundamental tool of computational algebraic geometry. It can in particular be used to decide whether a system of n homogeneous equations in n variables is satisfiable (the resultant is a polynomial in the…
In this paper, we prove several theorems on systems of polynomials with at least one positive real zero based on the theory of conceive polynomials. These theorems provide sufficient conditions for systems of multivariate polynomials…
The problem of computing a representation for a real polynomial as a sum of minimum number of squares of polynomials can be casted as finding a symmetric positive semidefinite real matrix (Gram matrix) of minimum rank subject to linear…
For nonempty subsets $S_0, \dots, S_{n-1}$ of a (large enough) finite field $\mathbb{F}$ satisfying $$|S_1|, \dots, |S_{n-1}| > 2 \quad \mathrm{or} \quad |S_1|,|S_{n-1}| > n - 1,$$ we show that there exist $a_0 \in S_0, \dots, a_{n-1} \in…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
We study representation of square-free polynomials in the polynomial ring F[t] over a finite field F by polynomials in F[t][x]. This is a function field version of the well-studied problem of representing squarefree integers by integer…
Finite discrete-time dynamical systems (FDDS) model phenomena that evolve deterministically in discrete time. It is possible to define sum and product operations on these systems (disjoint union and direct product, respectively) giving a…
A very first step to develop non-commutative algebraic geometry is the arithmetic of polynomials in non-commuting variables over a commutative field, that is, the study of elements in free associative algebras. This investigation is…
Given a quadratic map Q : K^n -> K^k defined over a computable subring D of a real closed field K, and a polynomial p(Y_1,...,Y_k) of degree d, we consider the zero set Z=Z(p(Q(X)),K^n) of the polynomial p(Q(X_1,...,X_n)). We present a…
Polynomial Systems, or at least their algorithms, have the reputation of being doubly-exponential in the number of variables [Mayr and Mayer, 1982], [Davenport and Heintz, 1988]. Nevertheless, the Bezout bound tells us that that number of…
A square matrix is said to be circular bidiagonal whenever (i) each nonzero entry is on the diagonal, or the subdiagonal, or in the top-right corner; (ii) each subdiagonal entry is nonzero, and the entry in the top-right corner is nonzero.…
We prove that the Jacobian conjecture is false if and only if there exists a solution to a certain system of polynomial equations. We analyse the solution set of this system. In particular we prove that it is zero dimensional.