Search results for "Theorem"

Groups whose real irreducible characters have degrees coprime to p

2012

Abstract In this paper we study groups for which every real irreducible character has degree not divisible by some given odd prime p .

The number of lifts of a Brauer character with a normal vertex

2011

AbstractIn this paper we examine the behavior of lifts of Brauer characters in p-solvable groups. In the main result, we show that if φ∈IBr(G) has a normal vertex Q and either p is odd or Q is abelian, then the number of lifts of φ is at most |Q:Q′|. As a corollary, we prove that if φ∈IBr(G) has an abelian vertex subgroup Q, then the number of lifts of φ in Irr(G) is at most |Q|.

Sufficient conditions for supersolubility of finite groups

1998

Abstract In this paper sufficient conditions for the supersolubility of finite groups are given under the assumption that the maximal subgroups of Sylow subgroups of the group and the maximal subgroups of Sylow subgroups of the Fitting subgroup are well-situated in the group. That will improve earlier results of Srinivasan [7], Asaad et al. [1] and Ballester-Bolinches [2].

ON A PERMUTABILITY PROPERTY OF SUBGROUPS OF FINITE SOLUBLE GROUPS

2010

The structure and embedding of subgroups permuting with the system normalizers of a finite soluble group are studied in the paper. It is also proved that the class of all finite soluble groups in which every subnormal subgroup permutes with the Sylow subgroups is properly contained in the class of all soluble groups whose subnormal subgroups permute with the system normalizers while this latter is properly contained in the class of all supersoluble groups.

Some Hadamard designs with parameters (71,35,17)

2002

Up to isomorphisms there are precisely eight symmetric designs with parameters (71, 35, 17) admitting a faithful action of a Frobenius group of order 21 in such a way that an element of order 3 fixes precisely 11 points. Five of these designs have 84 and three have 420 as the order of the full automorphism group G. If |G| = 420, then the structure of G is unique and we have G = (Frob21 × Z5):Z4. In this case Z(G) = 〈1〉, G′ has order 35, and G induces an automorphism group of order 6 of Z7. If |G| = 84, then Z(G) is of order 2, and in precisely one case a Sylow 2-subgroup is elementary abelian. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 144–149, 2002; DOI 10.1002/jcd.996

Commutator Laws in Finitely Generated Quasivarieties

2015

A comparison theorem for the mean exit time from a domain in a K�hler manifold

1992

Let M be a Kahler manifold with Ricci and antiholomorphic Ricci curvature bounded from below. Let ω be a domain in M with some bounds on the mean and JN-mean curvatures of its boundary ∂ω. The main result of this paper is a comparison theorem between the Mean Exit Time function defined on ω and the Mean Exit Time from a geodesic ball of the complex projective space ℂℙ n (λ) which involves a characterization of the geodesic balls among the domain ω. In order to achieve this, we prove a comparison theorem for the mean curvatures of hypersurfaces parallel to the boundary of ω, using the Index Lemma for Submanifolds.

Existence, uniqueness and comparison results for BSDEs with Lévy jumps in an extended monotonic generator setting

2018

We show existence of a unique solution and a comparison theorem for a one-dimensional backward stochastic differential equation with jumps that emerge from a L\'evy process. The considered generators obey a time-dependent extended monotonicity condition in the y-variable and have linear time-dependent growth. Within this setting, the results generalize those of Royer (2006), Yin and Mao (2008) and, in the $L^2$-case with linear growth, those of Kruse and Popier (2016). Moreover, we introduce an approximation technique: Given a BSDE driven by Brownian motion and Poisson random measure, we consider BSDEs where the Poisson random measure admits only jumps of size larger than $1/n$. We show con…

Sylow permutable subnormal subgroups of finite groups

2002

[EN] An extension of the well-known Frobenius criterion of p-nilpotence in groups with modular Sylow p-subgroups is proved in the paper. This result is useful to get information about the classes of groups in which every subnormal subgroup is permutable and Sylow permutable.

Boolean Functions with a Low Polynomial Degree and Quantum Query Algorithms

2005

The complexity of quantum query algorithms computing Boolean functions is strongly related to the degree of the algebraic polynomial representing this Boolean function. There are two related difficult open problems. First, Boolean functions are sought for which the complexity of exact quantum query algorithms is essentially less than the complexity of deterministic query algorithms for the same function. Second, Boolean functions are sought for which the degree of the representing polynomial is essentially less than the complexity of deterministic query algorithms. We present in this paper new techniques to solve the second problem.