Related papers: A note on the Steinitz Lemma

In this paper, we generalize the classical extragradient algorithm for solving variational inequality problems by utilizing nonzero normal vectors of the feasible set. In particular, conceptual algorithms are proposed with two different…

This paper provides a theorem to compare the minimum total cost of two different Euclidean Random Assignment Problems with the same number of points, using the stochastic order of the costs of one of the pairs in these two problems. The…

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

In this paper, we introduce and study a new extragradient iterative process for finding a common element of the set of fixed points of an infinite family of nonexpansive mappings and the set of solutions of a variational inequality for an…

Asymmetric vector norms are generalizations of asymmetric norms, where the subadditivity inequality is understood in ordered vector space sense. This relation imposes strong conditions on the ordering itself. This note studies on these…

We give an algorithm for the class of second order unification problems in which second order variables have at most one occurrence.

We show that the virial theorem provides a useful simple tool for approximating nonlinear problems. In particular we consider conservative nonlinear oscillators and a bifurcation problem. In the former case we obtain the same main result…

We show how to reduce the problem of solving members of a certain family of nonlinear differential equations to that of solving some corresponding linear differential equations.

In this paper, we introduce an iterative process which converges strongly to a common element of sets of solutions of finite family of generalized equilibrium problems, sets of fixed points of finite family of continuous relatively…

Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis earlier considered such a notion of relative likelihood in the…

A new proof for adjoint systems of linear equations is presented. The argument is built on the principles of Algorithmic Differentiation. Application to scalar multiplication sets the base line. Generalization yields adjoint inner vector,…

The von Weizs\"{a}cker theorem states that every sequence of nonnegative random variables has a subsequence which is Ces\`{a}ro convergent to a nonnegative random variable which might be infinite. The goal of this note is to provide a…

The task of reconstructing a matrix given a sample of observedentries is known as the matrix completion problem. It arises ina wide range of problems, including recommender systems, collaborativefiltering, dimensionality reduction, image…

In this paper, we consider a generalized strong vector quasi-equilibrium problem and we prove the existence of its solutions by using some suxiliary results. One of the established theorems is proved by using an approximation method.

Sorting algorithms have attracted a great deal of attention and study, as they have numerous applications to Mathematics, Computer Science and related fields. In this thesis, we first deal with the mathematical analysis of the Quicksort…

We study the following problem: Determine which almost structurally complete quasivarieties are structurally complete. We propose a general solution to this problem and then a solution in the semisimple case. As a consequence, we obtain a…

We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…

A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\psi\log(n\psi))$…

We present a general conjecture on the divisibility of a certain expression in terms of Kostka numbers and their close variants. This conjecture is closely related to a variant of the period-index problem of noncommutative algebra, with…

We explore the possibility to derive basic calculus rules for some subdifferential constructions associated to set-valued maps between normed vector spaces. Then, we use these results in order to write optimality conditions for a special…