Printer Friendly

On Sudakov's Type Decomposition of Transference Plans with Norm Costs.


On Sudakov's Type Decomposition of Transference Plans with Norm Costs

Stefano Bianchini and Sara Daneri

American Mathematical Society


112 pages


Memoirs of the American Mathematical Society; Volume 251, Number 1197


Beginning with the strategy Sudakov originally proposed for solving the Monge transportation problem, Bianchini and Daneri show how to overcome the difficulties with it and implement it successfully. The results yield a complete characterization of the Kantorovich optimal transportation problem with a straightforward corollary that solves the Monge problem, they say, and the strategy is sufficiently powerful to be applies to other optimal transportation problems. The core of their argument is directed locally affine partitions on cone-Lipschitz foliations, and from Ck-fibrations to linearly ordered Ck-Lipschitz foliations. ([umlaut] Ringgold, Inc., Portland, OR)

COPYRIGHT 2018 Ringgold, Inc.
No portion of this article can be reproduced without the express written permission from the copyright holder.
Copyright 2018 Gale, Cengage Learning. All rights reserved.

Article Details
Printer friendly Cite/link Email Feedback
Title Annotation:Stefano Bianchini and Sara Daneri
Article Type:Book review
Date:Apr 1, 2018
Previous Article:Strategies of Adaptation in Tourist Communication: Linguistic Insights.
Next Article:Applications of Lock-in Amplifiers in Optics.

Terms of use | Privacy policy | Copyright © 2019 Farlex, Inc. | Feedback | For webmasters