English
Related papers

Related papers: A discrete Farkas lemma

200 papers

The article is devoted to the existence of solutions of a certain system of quadratic integral equations in H^1(R, R^N). We show the existence of a perturbed solution by using a fixed point technique in the Sobolev space on the real line.

Analysis of PDEs · Mathematics 2024-03-13 Yuming Chen , Vitali Vougalter

We prove the existence of fractal solutions to a class of linear ordinary differential equations.This reveals the possibility of chaos in the very short time limit of the evolution even of a linear one dimensional dynamical system.

chao-dyn · Physics 2008-02-03 Dhurjati Prasad Datta

Fourier-Motzkin elimination is a projection algorithm for solving finite linear programs. We extend Fourier-Motzkin elimination to semi-infinite linear programs which are linear programs with finitely many variables and infinitely many…

Optimization and Control · Mathematics 2014-04-30 Amitabh Basu , Kipp Martin , Chris Ryan

We introduce a technology to formally verify that a software system satisfies a temporal specification of functional correctness, without revealing the system itself. Our method combines a deductive approach to model checking to obtain a…

Cryptography and Security · Computer Science 2026-05-04 Pascal Berrang , Mirco Giacobbe , Jacob Swales , Xiao Yang

Integer linear programs $\min\{c^T x : A x = b, x \in \mathbb{Z}^n_{\ge 0}\}$, where $A \in \mathbb{Z}^{m \times n}$, $b \in \mathbb{Z}^m$, and $c \in \mathbb{Z}^n$, can be solved in pseudopolynomial time for any fixed number of constraints…

Data Structures and Algorithms · Computer Science 2024-09-06 Lars Rohwedder , Karol Węgrzycki

We give a specific method to solve with quadratic complexity the linear systems arising in known algorithms to deal with the sign determination problem. In particular, this enable us to improve the complexity bound for sign determination in…

Algebraic Geometry · Mathematics 2009-12-01 Daniel Perrucci

In this work we prove the existence of solution for a class of perturbed fractional Hamiltonian systems given by \begin{eqnarray}\label{eq00} -{_{t}}D_{\infty}^{\alpha}(_{-\infty}D_{t}^{\alpha}u(t)) - L(t)u(t) + \nabla W(t,u(t)) = f(t),…

Analysis of PDEs · Mathematics 2014-02-28 César Torres

The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs), given by $d$ variables with $n$ inequality constraints. A constraint is called \emph{redundant}, if…

Data Structures and Algorithms · Computer Science 2016-10-11 Komei Fukuda , May Szedlak

Let $\Omega$ be a bounded open interval, let $p>1$ and $\gamma>0$, and let $m:\Omega\rightarrow\mathbb{R}$ be a function that may change sign in $\Omega $. In this article we study the existence and nonexistence of positive solutions for…

Classical Analysis and ODEs · Mathematics 2015-10-06 Uriel Kaufmann , Iván Medri

The problem of linking the structure of a finite linear dynamical system with its dynamics is well understood when the phase space is a vector space over a finite field. The cycle structure of such a system can be described by the…

Dynamical Systems · Mathematics 2008-10-20 Guangwu Xu , Yi Ming Zou

Fair termination is the property of programs that may diverge "in principle" but that terminate "in practice", i.e. under suitable fairness assumptions concerning the resolution of non-deterministic choices. We study a conservative…

Logic in Computer Science · Computer Science 2022-07-11 Luca Ciccone , Luca Padovani

For axially symmetric solutions of Einstein equations there exists a gauge which has the remarkable property that the total mass can be written as a conserved, positive definite, integral on the spacelike slices. The mass integral provides…

General Relativity and Quantum Cosmology · Physics 2010-04-06 Sergio Dain , Omar E. Ortiz

The main objective of this paper is to study the existence of solutions to some basic fractional difference equations. The tools employed are Krasnosel'skii fixed point theorem which guarantee at least two positive solutions.

Classical Analysis and ODEs · Mathematics 2016-01-08 Deepak B. Pachpatte , Arif S. Bagwan , Amol D. Khandagale

Given a full column rank matrix $A \in \mathbb{R}^{m\times n}$ ($m\geq n$), we consider a special class of linear systems of the form $A^\top Ax=A^\top b+c$ with $x, c \in \mathbb{R}^{n}$ and $b \in \mathbb{R}^{m}$. The occurrence of $c$ in…

Numerical Analysis · Mathematics 2019-11-04 Henri Calandra , Serge Gratton , Elisa Riccietti , Xavier Vasseur

In this paper we study about the existence of solutions of certain kind of non-linear differential and differential-difference equations. We give partial answer to a problem which was asked by chen et al. in [13].

Complex Variables · Mathematics 2022-02-09 Garima Pant , Manisha Saini

We show that the effects of finite-precision arithmetic in forming and solving the linear system that arises at each iteration of primal-dual interior-point algorithms for nonlinear programming are benign, provided that the iterates satisfy…

Optimization and Control · Mathematics 2025-10-20 Stephen J. Wright

On one hand, termination analysis of logic programs is now a fairly established research topic within the logic programming community. On the other hand, non-termination analysis seems to remain a much less attractive subject. If we divide…

Programming Languages · Computer Science 2007-05-23 Etienne Payet , Fred Mesnard

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

Functional Analysis · Mathematics 2020-06-22 Hiranmoy Garai , Lakshmi Kanta Dey , Wutiphol Sintunavarat , Sumit Som , Sayandeepa Raha

We study the existence and uniqueness of solutions of a nonlinear integro-differential problem which we reformulate introducing the notion of the decreasing rearrangement of the solution. A dimensional reduction of the problem is obtained…

Computer Vision and Pattern Recognition · Computer Science 2024-01-29 Gonzalo Galiano , Emanuele Schiavi , Julián Velasco

We study the problem of deciding universal termination of linear and affine loops over the reals in the bit-model of real computation. We show that both problems are as close to decidable as one can expect them to be: there exist sound…

Computational Complexity · Computer Science 2026-05-05 Eike Neumann , Margret Tembo
‹ Prev 1 8 9 10 Next ›