Search results for " function"

A complete characterization of all weakly additive measures and of all valuations on the canonical extension of any finite MV-chain

2010

We consider extensions of the unique additive measure on a finite MV-chain to uncertainty measures on its canonical Girard algebra extension. If the underlying MV-chain has more than two non-trivial elements, in a previous paper we have proved the non-existence of strongly additive measure extensions, where strong additivity is defined as additivity not for all disjoint unions but only restricted to the so-called divisible disjoint unions. This negative result motivates to look for weakly additive measure extensions which are defined to be additive only on all MV-subalgebras of the canonical Girard algebra extension. We obtain a characterization of all such MV-subalgebras which are in fact …

Monotonicity of Bayes estimators

2013

Let X = (X1; : : : ;Xn) be a sample from a distribution with density (x;θ), θ∈Θ⊂R. In this article the Bayesian estimation of the parameter is considered.We examine whether the Bayes estimators of are pointwise ordered when the prior distributions are partially ordered. Various cases of loss function are studied. A lower bound for the survival function of the normal distribution is obtained.

Character degrees, derived length and Sylow normalizers

1997

Let P be a Sylow p-subgroup of a monomial group G. We prove that dl $ ({\Bbb N}_G (P)/P') $ is bounded by the number of irreducible character degrees of G which are not divisible by p.

Extremal Frobenius numbers in a class of sets

1998

For given $ A_k=\{ a_1,\ldots ,a_k \}, a_1 \le \ldots \le a_k $ coprime the Frobenius number $ {g}(A_k) $ is defined as the greatest integer ${g}$ with no representation¶¶ ${g}=\sum \limits ^k_{i=1}\,x_i\,a_i,\;x_i\in {\Bbb N}_0 $ . ¶¶A class $ {\bf A}^*_k $ is given, such that ¶¶ $ {\overline {g}}^*(k,y):= \max \{ {g}(A_k)|A_k\in {\bf A}^*_k,\, a_k\le y \} $ ¶¶has the same asymptotic behaviour as the general function¶¶ $ {\overline {g}}(k,y):= \max \{ {g}(A_k)| a_k\le y \}\, {\rm for} \, y\to \infty $ .¶¶ Furthermore, ¶¶ $ {\underline {g}}^*(k,x):= \min \{ {g}(A_k)|A_k\in {\bf A}^*_k,\, a_1\ge x \} $ ¶¶is shown to have the same order of magnitude as the general function¶¶ $ {\underline {g}…

Analytic extension of non quasi-analytic Whitney jets of Roumieu type

1997

Let (Mr)r∈ℕ0 be a logarithmically convex sequence of positive numbers which verifies M0 = 1 as well as Mr≥ 1 for every r ∈ ℕ and defines a non quasi-analytic class. Let moreover F be a closed proper subset of ℝn. Then for every function ƒ on ℝn belonging to the non quasi-analytic (Mr)-class of Roumieu type, there is an element g of the same class which is analytic on ℝnF and such that Dα ƒ(x) = Dαg(x) for every σ ∈ ƒ0n SBAP and x ∈ F.

Generators of Random Processes in Ultrametric Spaces and Their Spectra

2009

The L 2(\( \mathbb{S} \)) space of square integrable functions on an ultrametric space \( \mathbb{S} \) has rather specific structure. As a consequence in a natural way there appear in L 2(\( \mathbb{S} \)) the operators of which unitary counterparts in L 2(ℝn) would be difficult to construct. Such class of self-adjoint operators emerge from theory of random processes on ultrametric spaces. In this paper we collect known material on spectral properties of the generators of random processes on \( \mathbb{S}_B \) an ultrametric space of sequences. (The set of p-adic numbers is a subset of \( \mathbb{S}_B \).) Then we discuss structure of the eigenspaces of the generators.

Bounded Bi-ideals and Linear Recurrence

2013

Bounded bi-ideals are a subclass of uniformly recurrent words. We introduce the notion of completely bounded bi-ideals by imposing a restriction on their generating base sequences. We prove that a bounded bi-ideal is linearly recurrent if and only if it is completely bounded.

Tighter Relations between Sensitivity and Other Complexity Measures

2014

The sensitivity conjecture of Nisan and Szegedy [12] asks whether the maximum sensitivity of a Boolean function is polynomially related to the other major complexity measures of Boolean functions. Despite major advances in analysis of Boolean functions in the past decade, the problem remains wide open with no positive result toward the conjecture since the work of Kenyon and Kutin from 2004 [11].

Boolean Functions of Low Polynomial Degree for Quantum Query Complexity Theory

2007

The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. This is why Boolean functions are needed with a high number of essential variables and a low polynomial degree. Unfortunately, it is a well-known problem to construct such functions. The best separation between these two complexity measures of a Boolean function was exhibited by Ambai- nis [5]. He constructed functions with polynomial degree M and number of variables Omega(M2). We improve such a separation to become exponenti…

Convex bodies and convexity on Grassmann cones

1962