Combinatorial inequalities and smoothness of functions
نویسندگان
چکیده
منابع مشابه
Combinatorial Inequalities and Smoothness of Functions
In most of our work we have been concerned with the one-dimensional case, but here we shall be able to say something about the general case. Roughly speaking, our aim has been to use the finiteness of Iv,P(f) to derive a priori bounds for other important functionals of ƒ, such as its modulus of continuity or other high order norms. The bounds we have obtained involve, of course, M* and p but th...
متن کاملPosted Prices, Smoothness, and Combinatorial Prophet Inequalities
We present a general framework for proving combinatorial prophet inequalities and con-structing posted-price mechanisms. Our framework applies to stochastic welfare optimizationproblems, in which buyers arrive sequentially and make utility-maximizing purchases. Our anal-ysis takes the form of an extension theorem: we derive sufficient conditions for achieving welfarebounds i...
متن کامل9 D ec 2 01 6 Posted Prices , Smoothness , and Combinatorial Prophet Inequalities
We present a general framework for proving combinatorial prophet inequalities and con-structing posted-price mechanisms. Our framework applies to stochastic welfare optimizationproblems, in which buyers arrive sequentially and make utility-maximizing purchases. Our anal-ysis takes the form of an extension theorem: we derive sufficient conditions for achieving welfarebounds i...
متن کاملa contrastive study of rhetorical functions of citation in iranian and international elt scopus journals
writing an academic article requires the researchers to provide support for their works by learning how to cite the works of others. various studies regarding the analysis of citation in m.a theses have been done, while little work has been done on comparison of citations among elt scopus journal articles, and so the dearth of research in this area demands for further investigation into citatio...
Smoothness of Multiple Refinable Functions
We consider the smoothness of solutions of a system of refinement equations written in the form φ = ∑ α∈Z a(α)φ(2 · − α), where the vector of functions φ = (φ1, . . . , φr) is in (Lp(R)) and a is a finitely supported sequence of r× r matrices called the refinement mask. We use the generalized Lipschitz space Lip∗(ν, Lp(R)), ν > 0, to measure smoothness of a given function. Our method is to rela...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1976
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1976-13975-4