Related papers: L.V.Kantorovich and Linear Programming
In this paper we discuss about properties of lattices and its application in theoretical and algorithmic number theory. This result of Minkowski regarding the lattices initiated the subject of Geometry of Numbers, which uses geometry to…
We extend the notion of Cantor-Kantorovich distance between Markov chains introduced by (Banse et al., 2023) in the context of Markov Decision Processes (MDPs). The proposed metric is well-defined and can be efficiently approximated given a…
We discuss the method recently proposed by S. Chubanov for the linear feasibility problem. We present new, concise proofs and interpretations of some of his results. We then show how our proofs can be used to find strongly polynomial time…
We examine data-processing of Markov chains through the lens of information geometry. We first establish a theory of congruent Markov morphisms within the framework of stochastic matrices. Specifically, we introduce and justify the concept…
Algorithms for continuous optimization problems have a rich history of design and innovation over the past several decades, in which mathematical analysis of their convergence and complexity properties plays a central role. Besides their…
Several different ways exist for approaching hard optimization problems. Mathematical programming techniques, including (integer) linear programming-based methods and metaheuristic approaches, are two highly successful streams for…
We consider positive, integral-preserving linear operators acting on $L^1$ space, known as stochastic operators or Markov operators. We show that, on finite-dimensional spaces, any stochastic operator can be approximated by a sequence of…
There has been no lack of coverage in the past few years in scientific journals of the topic of quantum computation. Rightly so, as this is a novel idea with--so far--at least one very important practical application (prime factorisation)…
The present paper gives an account for the general mathematical reader of the life and work of Martin Davis. Since two rather comprehensive autobiographical accounts and two long biographical interviews already exist, the present work…
A fascinating conjectural connection between statistical mechanics and combinatorics has in the past five years led to the publication of a number of papers in various areas, including stochastic processes, solvable lattice models and…
The wark is a contribution to the functional calculus constructed by of the author and A. A. Atvinovskii of closed operators on Banach spaces. The calculus is based on Markov and related functions as symbols. Estimates of bounded…
Linear algebra's main concerns are sets of vectors, linear functions, subspaces, linear systems, matrices and concepts about those, such as whether the solution of linear system exists or is unique; a set of vectors is linearly independent…
This is a survey of recent developments in combinatorics. The goal is to give a big picture of its many interactions with other areas of mathematics, such as: group theory, representation theory, commutative algebra, geometry (including…
In the present article, we analyse the behaviour of a new family of Kantorovich type sampling operators $(K_w^{\varphi}f)_{w>0}.$ First, we give a Voronovskaya type theorem for these Kantorovich generalized sampling series and a…
In this paper, we introduce a Kantorovich type generalization of Jakimovski-Leviatan operators constructed by A. Jakimovski and D. Leviatan (1969) and the theorems on convergence and the degrree of convergence are established. Furthermore,…
This paper is an investigation into Cantor works about representing a function with trigonometric series, and his proofs about its uniqueness. These works are important, because they cause invention of point-set topology, and foundation of…
In this explanatory work, we make an attempt to briefly discuss the work and technical achievements of twenty female mathematicians. The work may be useful as a historical resource, but there is very little biography or history, and the…
Kantorovich distance (or 1-Wasserstein distance) on the probability simplex of a finite metric space is the value of a Linear Programming problem for which a closed-form expression is known in some cases. When the ground distance is defined…
In this paper, we study a strong inverse approximation theorem and saturation order for the family of Kantorovich exponential sampling operators. The class of log-uniformly continuous and bounded functions, and class of log-H\"{o}lderian…
We suggest a new way of defining optimal transport of positive-semidefinite matrix-valued measures. It is inspired by a recent rendering of the incompressible Euler equations and related conservative systems as concave maximization…