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

Positive semidefiniteness, recursiveness, and the variety condition of a moment matrix are necessary and sufficient conditions to solve the quadratic and quartic moment problems. Also, positive semidefiniteness, combined with another…

Let $f(x_1,\ldots,x_n)$ be a regular indefinite integral quadratic form with $n\ge 9$, and let $t$ be an integer. It is established that $f(x_1,\ldots,x_n)=t$ has solutions in prime variables if there are no local obstructions.

There is studied problem on solvability of linear non-homogeneous differential equation of higher even order. There is proved the theorem on necessary and sufficient conditions on existence of solutions to the equation in the Schwartz…

We extend Theorem 1 of R. Reams, A Galois approach to m-th roots of matrices with rational entries, LAA 258 (1997), 187-194. Let $p(\lambda)$ be any polynomial over $\mathbb{Q}$ and let $A\in M_n(\mathbb{Q})$ have irreducible characteristic…

The main objective of this study is to investigate the existence and forms of solutions of systems of general quadratic functional equations in $\mathbb{C}^n$. By utilizing Nevanlinna theory in $\mathbb{C}^n$, we explore the existence and…

Solving a quadratic nonlinear system of equations (QNSE) is a fundamental, but important, task in nonlinear science. We propose an efficient quantum algorithm for solving $n$-dimensional QNSE. Our algorithm embeds QNSE into a…

We associate with any simplicial complex $\K$ and any integer $m$ a system of linear equations and inequalities. If $\K$ has a simplicial embedding in $\R^m$ then the system has an integer solution. This result extends the work of I. Novik…

Let $F_1,\ldots,F_R$ be homogeneous polynomials of degree $d\ge 2$ with integer coefficients in $n$ variables, and let $\mathbf{F}=(F_1,\ldots,F_R)$. Suppose that $F_1,\ldots,F_R$ is a non-singular system and $n\ge 4^{d+2}d^2R^5$. We prove…

Quantum algorithms for solving the Quantum Linear System (QLS) problem are among the most investigated quantum algorithms of recent times, with potential applications including the solution of computationally intractable differential…

It is shown that a system of $r$ quadratic forms over a ${\mathfrak p}$-adic field has a non-trivial common zero as soon as the number of variables exceeds $4r$, providing that the residue class field has cardinality at least $(2r)^r$.

We prove asymptotic formulae for small weighted solutions of quadratic congruences of the form $\lambda_1x_1^2+\cdots +\lambda_nx_n^2\equiv \lambda_{n+1}\bmod{p^m}$, where $p$ is a fixed odd prime, $\lambda_1,...,\lambda_{n+1}$ are integer…

Let $\textbf{A}$ be a symmetric convex quadratic form on $\mathbb{R}^{Nn}$ and $\Omega\Subset \mathbb{R}^n$ a bounded convex domain. We consider the problem of existence of solutions $u: \Omega \subset \mathbb{R}^n \longrightarrow…

In this work, we introduce a novel variant of the multivariate quadratic problem, which is at the core of one of the most promising post-quantum alternatives: multivariate cryptography. In this variant, the solution of a given multivariate…

We present in this paper a rather general method for the construction of so-called conditionally exactly solvable potentials. This method is based on algebraic tools known from supersymmetric quantum mechanics. Various families of…

Let us fix a prime $p$ and a homogeneous system of $m$ linear equations $a_{j,1}x_1+\dots+a_{j,k}x_k=0$ for $j=1,\dots,m$ with coefficients $a_{j,i}\in\mathbb{F}_p$. Suppose that $k\geq 3m$, that $a_{j,1}+\dots+a_{j,k}=0$ for $j=1,\dots,m$…

This paper study the planar semi-quasi homogeneous polynomial differential systems (short for PSQHPDS), which can be regard as a generalization of semi-homogeneous and of quasi-homogeneous systems. By using the algebraic skills, several…

We prove necessary and sufficient conditions for a system $\dot z_i=z_ip_i(z)$ ($p_i$ a polynomial) to have only entire analytic functions as solutions.

Sextic polynomial oscillator is probably the best known quantum system which is partially exactly {\it alias} quasi-exactly solvable (QES), i.e., which possesses closed-form, elementary-function bound states $\psi(x)$ at certain couplings…

Globally optimizing a nonconvex quadratic over the intersection of $m$ balls in $\mathbb{R}^n$ is known to be polynomial-time solvable for fixed $m$. Moreover, when $m=1$, the standard semidefinite relaxation is exact. When $m=2$, it has…

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…