Search results for "theorem"

showing 10 items of 1250 documents

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.

CombinatoricsBayes' theoremApplied MathematicsEstimatorApplied mathematicsMonotonic functionMathematicsApplicationes Mathematicae
researchProduct

Bayesian hypothesis testing: A reference approach

2002

Summary For any probability model M={p(x|θ, ω), θeΘ, ωeΩ} assumed to describe the probabilistic behaviour of data xeX, it is argued that testing whether or not the available data are compatible with the hypothesis H0={θ=θ0} is best considered as a formal decision problem on whether to use (a0), or not to use (a0), the simpler probability model (or null model) M0={p(x|θ0, ω), ωeΩ}, where the loss difference L(a0, θ, ω) –L(a0, θ, ω) is proportional to the amount of information δ(θ0, ω), which would be lost if the simplified model M0 were used as a proxy for the assumed model M. For any prior distribution π(θ, ω), the appropriate normative solution is obtained by rejecting the null model M0 wh…

CombinatoricsBinomial distributionStatistics and ProbabilityBayes' theoremDistribution (mathematics)Prior probabilityStatisticsMultivariate normal distributionContext (language use)Statistics Probability and UncertaintyLindley's paradoxMathematicsStatistical hypothesis testing
researchProduct

A space on which diameter-type packing measure is not Borel regular

1999

We construct a separable metric space on which 1-dimensional diameter-type packing measure is not Borel regular.

CombinatoricsBorel equivalence relationRiesz–Markov–Kakutani representation theoremApplied MathematicsGeneral MathematicsRadon measureStandard probability spaceBaire measureBorel setBorel measureMeasure (mathematics)MathematicsProceedings of the American Mathematical Society
researchProduct

The Cauchy problem for linear growth functionals

2003

In this paper we are interested in the Cauchy problem $$ \left\{ \begin{gathered} \frac{{\partial u}}{{\partial t}} = div a (x, Du) in Q = (0,\infty ) x {\mathbb{R}^{{N }}} \hfill \\ u (0,x) = {u_{0}}(x) in x \in {\mathbb{R}^{N}}, \hfill \\ \end{gathered} \right. $$ (1.1) where \( {u_{0}} \in L_{{loc}}^{1}({\mathbb{R}^{N}}) \) and \( a(x,\xi ) = {\nabla _{\xi }}f(x,\xi ),f:{\mathbb{R}^{N}}x {\mathbb{R}^{N}} \to \mathbb{R} \)being a function with linear growth as ‖ξ‖ satisfying some additional assumptions we shall precise below. An example of function f(x, ξ) covered by our results is the nonparametric area integrand \( f(x,\xi ) = \sqrt {{1 + {{\left\| \xi \right\|}^{2}}}} \); in this case …

CombinatoricsCauchy problemCauchy's convergence testDomain (ring theory)UniquenessNabla symbolCauchy's integral theoremCauchy's integral formulaMathematicsCauchy product
researchProduct

VARIATIONS ON THOMPSON'S CHARACTER DEGREE THEOREM

2001

If P is a Sylow- p -subgroup of a finite p -solvable group G , we prove that G^\prime \cap \bf{N}_G(P) \subseteq {P} if and only if p divides the degree of every irreducible non-linear p -Brauer character of G. More generally if π is a set of primes containing p and G is π-separable, we give necessary and sufficient group theoretic conditions for the degree of every irreducible non-linear p -Brauer character to be divisible by some prime in π. This can also be applied to degrees of ordinary characters.

CombinatoricsCharacter (mathematics)Degree (graph theory)Group (mathematics)Solvable groupGeneral MathematicsSylow theoremsPrime (order theory)MathematicsGlasgow Mathematical Journal
researchProduct

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.

CombinatoricsCharacter (mathematics)General MathematicsBounded functionSylow theoremsMonomial groupMathematicsArchiv der Mathematik
researchProduct

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.

CombinatoricsCombinatorics on wordsMathematics::Commutative AlgebraBounded setBounded functionBase (topology)Bounded inverse theoremBounded operatorMathematics2013 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
researchProduct

Comparing the relative volume with a revolution manifold as a model

1993

Given a pair (P, M), whereM is ann-dimensional connected compact Riemannian manifold andP is a connected compact hypersurface ofM, the relative volume of (P, M) is the quotient volume(P)/volume(M). In this paper we give a comparison theorem for the relative volume of such a pair, with some bounds on the Ricci curvature ofM and the mean curvature ofP, with respect to that of a model pair\(\left( {\mathcal{P},\mathcal{M}} \right)\) where ℳ is a revolution manifold and\(\mathcal{P}\) a “parallel” of ℳ.

CombinatoricsComparison theoremMean curvatureHypersurfaceGeneral MathematicsMathematical analysisMathematics::Differential GeometryRiemannian manifoldRicci curvatureQuotientManifoldMathematicsScalar curvatureIsrael Journal of Mathematics
researchProduct

The Jordan-Hölder theorem and prefrattini subgroups of finite groups

1995

by A. BALLESTER-BOLINCHES and L. M. EZQUERRO(Received 26 January, 1994)Introduction. All groups considered are finite. In recent years a number ofgeneralizations of the classic Jordan-Holder Theorem have been obtained (see [7],Theorem A.9.13): in a finite group G a one-to-one correspondence as in the Jordan-Holder Theorem can be defined preserving not only G-isomorphic chief factors but eventheir property of being Frattini or non-Frattini chief factors. In [2] and [13] a newdirection of generalization is presented: the above correspondence can be defined in sucha way that the corresponding non-Frattini chief factors have the same complement(supplement).In this paper we present a necessary a…

CombinatoricsComplement (group theory)Finite groupConjugacy classGroup (mathematics)Locally finite groupComposition seriesGeneral MathematicsSylow theoremsOrder (group theory)MathematicsGlasgow Mathematical Journal
researchProduct

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…

CombinatoricsComplexity indexDiscrete mathematicsZero of a functionKarp–Lipton theoremHomogeneous polynomialBoolean expressionDegree of a polynomialBoolean functionMathematicsMatrix polynomial37th International Symposium on Multiple-Valued Logic (ISMVL'07)
researchProduct