Related papers: Complementary problems with polynomial data

It is well-known that the finite difference discretization of the Laplacian eigenvalue problem $-\Delta u = \lambda u$ leads to a matrix eigenvalue problem (EVP) $A x= \lambda x$ where the matrix $A$ is Toeplitz-plus-Hankel. Analytical…

The existence of sufficiently many finite order meromorphic solutions of a differential equation, or difference equation, or differential-difference equation, appears to be a good indicator of integrability. In this paper, we investigate…

In this paper we have found a necessary and sufficient condition for equivalence of two norms on a linear space using the theory of exponential vector space. Exponential vector space is an ordered algebraic structure which can be considered…

Two continuous maps $f, g : \mathbb{C}^2\to\mathbb{C}^2$ are said to be topologically equivalent if there exist homeomorphisms $\varphi,\psi:\mathbb{C}^2\to\mathbb{C}^2$ satisfying $\psi\circ f\circ\varphi = g$. It is known that there are…

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of…

The purpose of this paper is to study a class of ill-posed differential equations. In some settings, these differential equations exhibit uniqueness but not existence, while in others they exhibit existence but not uniqueness. An example of…

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

The paper is concerned with the completeness problem of root functions of general boundary value problems for first order systems of ordinary differential equations. Namely, we introduce and investigate the class of \emph{weakly regular…

Generalization problems in languages with binders involve computing the most common structure between expressions while respecting bound variable renaming and freshness constraints. These problems often lack a least general solution.…

We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Let $K$ be a field, $R=K[x, y]$ the polynomial ring and $\mathcal{M}(K)$ the set of all pairs of square matrices of the same size over $K.$ Pairs $P_1=(A_1,B_1)$ and $P_2=(A_2,B_2)$ from $\mathcal{M}(K)$ are called similar if…

We consider the following boundary value problem -\Delta u= g(x,u) + f(x,u) x\in \Omega u=0 x\in \partial \Omega where $g(x,-\xi)=-g(x,\xi)$ and $g$ has subcritical exponential growth in $\mathbb{R} ^2$. Using the method developed by Bolle,…

In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly…

A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…

We consider the following equations: \begin{equation*} \left\{\begin{array}{ll} (-\triangle)^{\alpha/2}u(x)=f(v(x)), \\ (-\triangle)^{\beta/2}v(x)=g(u(x)), &x \in R^{n},\\ u,v\geq 0, &x \in R^{n}, \end{array} \right. \end{equation*} for…

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

In this work we provide conditions for the existence of solutions to nonlinear boundary value problems of the form \begin{equation*} y(t+n)+a_{n-1}(t)y(t+n-1)+\cdots a_0(t)y(t)=g(t,y(t+m-1)) \end{equation*} subject to \begin{equation*}…