All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 7 Next

Displaying 121 – 140 of 145

Showing per page

An optimal matching problem

Ivar Ekeland (2005)

ESAIM: Control, Optimisation and Calculus of Variations

Given two measured spaces ( X , μ ) and ( Y , ν ) , and a third space Z , given two functions u ( x , z ) and v ( x , z ) , we study the problem of finding two maps s : X → Z and t : Y → Z such that the images s ( μ ) and t ( ν ) coincide, and the integral ∫ X u ( x , s ( x ) ) d μ - ∫ Y v ( y , t ( y ) ) d ν is maximal. We give condition on u and v for which there is a unique solution.

An optimal matching problem

Ivar Ekeland (2010)

ESAIM: Control, Optimisation and Calculus of Variations

Given two measured spaces ( X , μ ) and ( Y , ν ) , and a third space Z, given two functions u(x,z) and v(x,z), we study the problem of finding two maps s : X → Z and t : Y → Z such that the images s ( μ ) and t ( ν ) coincide, and the integral ∫ X u ( x , s ( x ) ) d μ - ∫ Y v ( y , t ( y ) ) d ν is maximal. We give condition on u and v for which there is a unique solution.

Ascents of size less than d in compositions

Maisoon Falah, Toufik Mansour (2011)

Open Mathematics

A composition of a positive integer n is a finite sequence π1π2...πm of positive integers such that π1+...+πm = n. Let d be a fixed number. We say that we have an ascent of size d or more (respectively, less than d) if πi+1 ≥ πi+d (respectively, πi < πi+1 < πi + d). Recently, Brennan and Knopfmacher determined the mean, variance and limiting distribution of the number of ascents of size d or more in the set of compositions of n. In this paper, we find an explicit formula for the multi-variable...

Currently displaying 121 – 140 of 145