Related papers: A discrete Farkas lemma
In this paper, we study the existence of solution for the following class of nonlocal problem, $$ \left\{ \begin{array}{lcl} -\Delta u=\left(\lambda f(x)-\int_{\R^N}K(x,y)|u(y)|^{\gamma}dy\right)u,\quad \mbox{in} \quad \R^{N}, \\…
\noindent Using the techniques connected with the measure of noncompactness we investigate the neutral difference equation of the following form \begin{equation*} \Delta \left(r_{n}\left(\Delta \left(x_{n}+p_{n}x_{n-k}\right) \right)…
Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…
We consider the question of determining whether or not a given system of fractional-order differential equations is (asymptotically) stable. In particular, we admit systems where each constituent equation may have its own order, independent…
We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…
This work is devoted to the study of the existence of at least one weak solution to nonlocal equations involving a general integro-differential operator of fractional type. As a special case, we derive an existence theorem for the…
This paper is devoted to the study of meromorphic solutions of nonlinear differential equations, specifically the equation \[ (f^n)^{(k)}(g^n)^{(k)} = \alpha^2, \] where $k$ and $n$ are positive integers with $n>2k$, and $\alpha$ is a…
In one of his papers, the author introduces the class of Farkas-related vectors for which a version of Farkas' lemma over integers is derived. In this paper, two similar classes are introduced and studied.
In this paper we consider a linear homogeneous system of $m$ equations in $n$ unknowns with integer coefficients over the reals. Assume that the sum of the absolute values of the coefficients of each equation does not exceed $k+1$ for some…
For a primal-dual pair of conic linear problems that are described by convex cones $S\subset X$, $T\subset Y$, bilinear symmetric objective functions $\langle\cdot,\cdot\rangle_X$, $\langle\cdot,\cdot\rangle_Y$ and a linear operator…
Dantzig and Eaves claimed that fundamental duality theorems of linear programming were a trivial consequence of Fourier elimination. Another property of Fourier elimination is considered here, regarding the existence of implicit equalities…
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…
We provide a complete study of existence and uniqueness (uniqueness up to multiples in the case $\mathbf{d} = \mathbf{0}$) of non-negative and non-trivial solutions $\mathbf{x}$ for the linear system $(\mathbf{I}- \mathbf{A})\mathbf{x} =…
Systems of the form $x = (A x^s)^{1/s} + b$ arise in a range of economic, financial and control problems, where $A$ is a linear operator acting on a space of real-valued functions (or vectors) and $s$ is a nonzero real value. In these…
In this paper, we prove several generalizations and applications of a fixed point theorem. This theorem is used to prove the existence and uniqueness of solutions of the linear sparse matrix problem considered.
The paper deals with the problem of existence of a convergent "strong" normal form in the neighbourhood of an equilibrium, for a finite dimensional system of differential equations with analytic and time-dependent non-linear term. The…
Farkas' lemma is an ubiquitous tool in optimisation, as it provides necessary and sufficient conditions to have $b \in A(P)$, where $P$ is a closed convex cone, $A$ is a (continuous) linear mapping and $b$ is a fixed vector. The standard…
A fundamental problem in program verification concerns the termination of simple linear loops of the form x := u ; while Bx >= b do {x := Ax + a} where x is a vector of variables, u, a, and c are integer vectors, and A and B are integer…
The problem of solving linear systems is one of the most fundamental problems in computer science, where given a satisfiable linear system $(A,b)$, for $A \in \mathbb{R}^{n \times n}$ and $b \in \mathbb{R}^n$, we wish to find a vector $x…
We present a randomized linear-space solver for general linear systems $\mathbf{A} \mathbf{x} = \mathbf{b}$ with $\mathbf{A} \in \mathbb{Z}^{n \times n}$ and $\mathbf{b} \in \mathbb{Z}^n$, without any assumption on the condition number of…