Related papers: When a system of real quadratic equations has a so…

The main goal of this article is to study the existence of a unique positive definite common solution to a pair of matrix equations of the form \begin{eqnarray*} X^r=Q_1 + \displaystyle \sum_{i=1}^{m} {A_i}^*F(X)A_i \mbox{ and } X^s=Q_2 +…

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

We introduce O-systems (Definition \ref{DO}) of orthogonal transformations of ${\Bbb R}^{m}$, and establish $1-1$ correspondences both between equivalence classes of Clifford systems and that of O-systems, and between O-systems and…

In the present paper, we are concerned with entire radially symmetric solutions for a quasilinear system with phi{i}-Laplacian operator.

We consider a set of equations of the form $p_j (x,y) = (10 x+m_j)(10 y + n_j),\,\,x\geq 0, y\geq0$, $j=1,2,3$, such that $\{m_1=7, n_1=3\}$, $\{m_2=n_2=9\}$ and $\{m_3=n_3=1\}$, respectively. It is shown that if $(a(p_j),b(p_j)) \in N…

In this short paper we identify special systems of (an arbitrary number) N of first-order Difference Equations with nonlinear homogeneous polynomials of arbitrary degree M in their right-hand sides, which feature very simple explicit…

Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

A quadratic dynamical system with practical applications is taken into considered. This system is transformed into a new bilinear system with Hadamard products by means of the implicit matrix structure. The corresponding quadratic bilinear…

Building on the blueprint from Goemans and Williamson (1995) for the Max-Cut problem, we construct a polynomial-time approximation algorithm for orthogonally constrained quadratic optimization problems. First, we derive a semidefinite…

We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…

Suppose $Q(x)$ is a real $n\times n$ regular symmetric positive semidefinite matrix polynomial. Then it can be factored as $$Q(x) = G(x)^TG(x),$$ where $G(x)$ is a real $n\times n$ matrix polynomial with degree half that of $Q(x)$ if and…

In this paper we present a numerical scheme for the resolution of matrix Riccati equation, usualy used in control problems. The scheme is unconditionnaly stable and the solution is definite positive at each time step of the resolution. We…

Stationary 1D Schr\"odinger equations with polynomial potentials are reduced to explicit countable closed systems of exact quantization conditions, which are selfconsistent constraints upon the zeros of zeta-regularized spectral…

Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the underdefined…

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

We propose a protocol for solving systems of linear algebraic equations via quantum mechanical methods using the minimal number of qubits. We show that $(M+1)$-qubit system is enough to solve a system of $M$ equations for one of the…

Any satisfiability problem in conjunctive normal form can be solved in polynomial time by reducing it to a 3-sat formulation and transforming this to a Linear Complementarity problem (LCP) which is then solved as a linear program (LP). Any…

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…