The Parseval relation and monotone functions
نویسندگان
چکیده
منابع مشابه
2 Monotone Functions and Monotone Circuits
In the last lecture we looked at lower bounds for constant-depth circuits, proving that PARITY cannot be computed by constant-depth circuits, i.e. PARITY / ∈ AC0. General circuit lower bounds for explicit functions are quite weak: the best we can prove after years of effort is that there is a function, which requires circuits of size 5n − o(n). In this lecture we will examine what happens if we...
متن کاملMonotone Functions and Maps
In [1] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals (e.g., real semialgebraic or subanalytic sets), and having connected intersections with all translated coordinate cones in Rn. In this paper we develop this theory further by defining monotone functions and maps, and studying their fundamental geometric properties. We prove several equ...
متن کاملGENERALIZED POSITIVE DEFINITE FUNCTIONS AND COMPLETELY MONOTONE FUNCTIONS ON FOUNDATION SEMIGROUPS
A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...
متن کاملMonotone circuits for monotone weighted threshold functions
Weighted threshold functions with positive weights are a natural generalization of unweighted threshold functions. These functions are clearly monotone. However, the naive way of computing them is adding the weights of the satisfied variables and checking if the sum is greater than the threshold; this algorithm is inherently non-monotone since addition is a non-monotone function. In this work w...
متن کاملUltrafilters, monotone functions and pseudocompactness
In this article we, given a free ultrafilter p on ω, consider the following classes of ultrafilters: (1) T (p) the set of ultrafilters Rudin-Keisler equivalent to p, (2) S(p) = {q ∈ ω∗ : ∃ f ∈ ω, strictly increasing, such that q = f β(p)}, (3) I (p) the set of strong Rudin-Blass predecessors of p, (4) R(p) the set of ultrafilters equivalent to p in the strong Rudin-Blass order, (5) PRB(p) the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1974
ISSN: 0022-247X
DOI: 10.1016/0022-247x(74)90136-x