Search results for " function"
showing 10 items of 9395 documents
VECTOR-VALUED FUNCTIONS INTEGRABLE WITH RESPECT TO BILINEAR MAPS
2008
Let $(\Omega, \Sigma, \mu)$ be a $\sigma-$finite measure space, $1\le p \lt \infty$, $X$ be a Banach space $X$ and ${\cal B} :X\times Y \to Z$ be a bounded bilinear map. We say that an $X$-valued function $f$ is $p-$integrable with respect to ${\cal B}$ whenever $\sup\{\int_\Omega\|{\cal B}(f(w),y)\|^pd\mu: \|y\|=1\}$ is finite. We identify the spaces of functions integrable with respect to the bilinear maps arising from H\"older's and Young's inequalities. We apply the theory to give conditions on $X$-valued kernels for the boundedness of integral operators $T_{{\cal B}}(f) (w)=\int_{\Omega'}{{\cal B}}(k(w,w'),$ $f(w'))d\mu'(w')$ from ${\mathrm L}^p(Y)$ into ${\mathrm L}^p(Z)$, extending t…
An integral representation for decomposable measures of measurable functions
1994
We start with a measurem on a measurable space (Ω,A), decomposable with respect to an Archimedeant-conorm ⊥ on a real interval [0,M], which generalizes an additive measure. Using the integral introduced by the second author, a Radon-Nikodym type theorem, needed in what follows, is given.
Perturbations of surjective convolution operators
2002
Let μ 1 and μ 2 be (ultra)distributions with compact support which have disjoint singular supports. We assume that the convolution operator f → μ 1 *f is surjective when it acts on a space of functions or (ultra)distributions, and we investigate whether the perturbed convolution operator f→ (μ 1 + μ 2 ) * f is surjective. In particular we solve in the negative a question asked by Abramczuk in 1984.
Periodicity and repetitions in parameterized strings
2008
AbstractOne of the most beautiful and useful notions in the Mathematical Theory of Strings is that of a Period, i.e., an initial piece of a given string that can generate that string by repeating itself at regular intervals. Periods have an elegant mathematical structure and a wealth of applications [F. Mignosi and A. Restivo, Periodicity, Algebraic Combinatorics on Words, in: M. Lothaire (Ed.), Cambridge University Press, Cambridge, pp. 237–274, 2002]. At the hearth of their theory, there are two Periodicity Lemmas: one due to Lyndon and Schutzenberger [The equation aM=bNcP in a free group, Michigan Math. J. 9 (1962) 289–298], referred to as the Weak Version, and the other due to Fine and …
PI-algebras with slow codimension growth
2005
Let $c_n(A),\ n=1,2,\ldots,$ be the sequence of codimensions of an algebra $A$ over a field $F$ of characteristic zero. We classify the algebras $A$ (up to PI-equivalence) in case this sequence is bounded by a linear function. We also show that this property is closely related to the following: if $l_n(A), \ n=1,2,\ldots, $ denotes the sequence of colengths of $A$, counting the number of $S_n$-irreducibles appearing in the $n$-th cocharacter of $A$, then $\lim_{n\to \infty} l_n(A)$ exists and is bounded by $2$.
Parsimony hierarchies for inductive inference
2004
AbstractFreivalds defined an acceptable programming system independent criterion for learning programs for functions in which the final programs were required to be both correct and “nearly” minimal size. i.e.. within a computable function of being purely minimal size. Kinber showed that this parsimony requirement on final programs limits learning power. However, in scientific inference, parsimony is considered highly desirable. Alim-computable functionis (by definition) one calculable by a total procedure allowed to change its mind finitely many times about its output. Investigated is the possibility of assuaging somewhat the limitation on learning power resulting from requiring parsimonio…
The Infinite-Valued Łukasiewicz Logic and Probability
2017
The paper concerns the algebraic structure of the set of cumulative distribution functions as well as the relationship between the resulting algebra and the infinite-valued Łukasiewicz algebra. The paper also discusses interrelations holding between the logical systems determined by the above algebras. Zadanie „ Wdrożenie platformy Open Journal System dla czasopisma „ Bulletin of the Section of Logic” finansowane w ramach umowy 948/P-DUN/2016 ze środków Ministra Nauki i Szkolnictwa Wyższego przeznaczonych na działalność upowszechniającą naukę.
Minimal Morse flows on compact manifolds
2006
Abstract In this paper we prove, using the Poincare–Hopf inequalities, that a minimal number of non-degenerate singularities can be computed in terms only of abstract homological boundary information. Furthermore, this minimal number can be realized on some manifold with non-empty boundary satisfying the abstract homological boundary information. In fact, we present all possible indices and types (connecting or disconnecting) of singularities realizing this minimal number. The Euler characteristics of all manifolds realizing this minimal number are obtained and the associated Lyapunov graphs of Morse type are described and shown to have the lowest topological complexity.
Quantum Algorithms for Learning Symmetric Juntas via Adversary Bound
2014
In this paper, we study the following variant of the junta learning problem. We are given oracle access to a Boolean function f on n variables that only depends on k variables, and, when restricted to them, equals some predefined function h. The task is to identify the variables the function depends on. This is a generalisation of the Bernstein-Vazirani problem (when h is the XOR function) and the combinatorial group testing problem (when h is the OR function). We analyse the general case using the adversary bound, and give an alternative formulation for the quantum query complexity of this problem. We construct optimal quantum query algorithms for the cases when h is the OR function (compl…
Balls into non-uniform bins
2014
Balls-into-bins games for uniform bins are widely used to model randomized load balancing strategies. Recently, balls-into-bins games have been analysed under the assumption that the selection probabilities for bins are not uniformly distributed. These new models are motivated by properties of many peer-to-peer (P2P) networks, which are not able to perfectly balance the load over the bins. While previous evaluations try to find strategies for uniform bins under non-uniform bin selection probabilities, this paper investigates heterogeneous bins, where the "capacities" of the bins might differ significantly. We show that heterogeneous environments can even help to distribute the load more eve…