相关论文: A discrete Farkas lemma

The projection lemma (often also referred to as the elimination lemma) is one of the most powerful and useful tools in the context of linear matrix inequalities for system analysis and control. In its traditional formulation, the projection…

This paper proposes a verification method for sparse linear systems $Ax=b$ with general and nonsingular coefficients. A verification method produces the error bound for a given approximate solution. Conventional methods use one of two…

We discuss different cases of dissipative Hamiltonian differential-algebraic equations and the linear algebraic systems that arise in their linearization or discretization. For each case we give examples from practical applications. An…

In this article we study a class of generalised linear systems of difference equations with given non-consistent initial conditions and infinite many solutions. We take into consideration the case that the coefficients are square constant…

In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the $k$--determinantal of an integer $(k\times m)$ matrix $A$ is coprime with the order $n$ of a group $G$ and the…

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$…

Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a linear system Ax = b and a conjunction of (non-)convex…

Our paper focuses on investigating the existence and possible forms of solutions to the nonlinear differential equation \beas f^m+\big(Rf^{(k)}\big)^n=Qe^{\alpha},\eeas where where $k$, $m$ and $n$ are three positive integers, $Q$ and $R$…

The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…

We introduce a class of ${\mathbb{Z}}_N$ graded discrete Lax pairs, with $N\times N$ matrices, linear in the spectral parameter. We give a classification scheme for such Lax pairs and the associated discrete integrable systems. We present…

The intention of this note is two-fold. First, we study integer optimization problems in standard form defined by $A \in\mathbb{Z}^{m\times{}n}$ and present an algorithm to solve such problems in polynomial-time provided that both the…

Consider a linear programming problem with n primal and m dual variables paired with n dual and m primal slack variables respectively, and aggregately denote these variables and slack variables as a vector z of length 2(n+m). Unlike…

In this article, we consider a system of integro-differential equations in L^2(R, R^N), which contains the logarithmic Laplacian in the presence of transport terms. The linear operators associated with the system satisfy the Fredholm…

We address the existence in the sense of sequences of solutions for a certain integro-differential type problem involving the logarithmic Laplacian. The argument is based on the fixed point technique when such equation contains the operator…

We study the solvability of a quadratic integral equation of fractional order with linear modification of the argument. This equation is considered in the Banach space of real functions defined, bounded and continuous on an unbounded…

The solution to systems of moment differential equations of the form $z\partial_my=(zA+B)y$ are provided, for a matrix $B$ with general good spectrum. Existence and convergence of Floquet-type solutions is studied. A generalized definition…

We extend the definition of $n$-dimensional difference equations to complex order $\alpha\in \mathbb{C} $. We investigate the stability of linear systems defined by an $n$-dimensional matrix $A$ and derive conditions for the stability of…

In this note we consider the continuous Galerkin time stepping method of arbitrary order as a possible discretization scheme of nonlinear initial value problems. In addition, we develop and generalize a well known existing result for the…

We argue that reducing nonlinear programming problems to a simple canonical form is an effective way to analyze them, specially when the problem is degenerate and the usual linear independence hypothesis does not hold. To illustrate this…

Let $(U_n)_{n=0}^\infty$ and $(V_m)_{m=0}^\infty$ be two linear recurrence sequences. For fixed positive integers $k$ and $\ell$, fixed $k$-tuple $(a_1,\dots,a_k)\in \mathbb{Z}^k$ and fixed $\ell$-tuple $(b_1,\dots,b_\ell)\in…