Search results for "Finite group"

showing 10 items of 205 documents

Primitive characters of subgroups ofM-groups

1995

One of the hardest areas in the Character Theory of Solvable Groups continues to be the monomial groups. A finite group is said to be an M-group (or monomial) if all of its irreducible characters are monomial, that is to say, induced from linear characters. Two are still the main problems on M-groups: are Hall subgroups of M groups monomial? Under certain oddness hypothesis, are normal subgroups of M-groups monomial? In both cases there is evidence that this could be the case: the primitive characters of the subgroups in question are the linear characters. This is the best result up to date ([4], [6]). Recently, some idea appears to be taking form. In [14], T. Okuyama proved that if G is an…

Normal subgroupMonomialFinite groupGeneral Mathematicsmedia_common.quotation_subjectCharacter theorySylow theoremsCombinatoricsHall subgroupMathematics::Group TheorySolvable groupNormalityMathematicsmedia_commonMathematische Zeitschrift
researchProduct

NONVANISHING ELEMENTS FOR BRAUER CHARACTERS

2015

Let $G$ be a finite group and $p$ a prime. We say that a $p$-regular element $g$ of $G$ is $p$-nonvanishing if no irreducible $p$-Brauer character of $G$ takes the value $0$ on $g$. The main result of this paper shows that if $G$ is solvable and $g\in G$ is a $p$-regular element which is $p$-nonvanishing, then $g$ lies in a normal subgroup of $G$ whose $p$-length and $p^{\prime }$-length are both at most 2 (with possible exceptions for $p\leq 7$), the bound being best possible. This result is obtained through the analysis of one particular orbit condition in linear actions of solvable groups on finite vector spaces, and it generalizes (for $p>7$) some results in Dolfi and Pacifici [‘Zero…

Normal subgroupPure mathematicsFinite groupModular representation theoryBrauer's theorem on induced charactersCharacter (mathematics)Solvable groupGeneral MathematicsPrime (order theory)MathematicsVector spaceJournal of the Australian Mathematical Society
researchProduct

Infinite factorized groups

1989

Normal subgroupPure mathematicsInfinite groupMathematics
researchProduct

On the p-length of some finite p-soluble groups

2014

The main aim of this paper is to give structural information of a finite group of minimal order belonging to a subgroup-closed class of finite groups and whose $p$-length is greater than $1$, $p$ a prime number. Alternative proofs and improvements of recent results about the influence of minimal $p$-subgroups on the $p$-nilpotence and $p$-length of a finite group arise as consequences of our study

Normal subgroupSemidirect productFinite groupPure mathematicsClass (set theory)Direct summandGeneral MathematicsPrime numberGrups Teoria deMaximal subgroupMaximal subgroupNormal subgroupApplications of MathematicsTheoretical Mathematical and Computational PhysicsSemidirect productOrder (group theory)ÀlgebraAlgebra over a fieldFinite groupMATEMATICA APLICADAMathematics
researchProduct

Order of products of elements in finite groups

2018

If G is a finite group, p is a prime, and x∈G, it is an interesting problem to place x in a convenient small (normal) subgroup of G, assuming some knowledge of the order of the products xy, for certain p‐elements y of G.

Order (business)General Mathematics010102 general mathematics0103 physical sciencesApplied mathematics010307 mathematical physics0101 mathematics01 natural sciencesfinite groupsMathematics
researchProduct

Z-permutable subgroups of finite groups

2016

Let Z be a complete set of Sylow subgroups of a finite group G, that is, a set composed of a Sylow p-subgroup of G for each p dividing the order of G. A subgroup H of G is called Z-permutable if H permutes with all members of Z. The main goal of this paper is to study the embedding of the Z-permutable subgroups and the influence of Z-permutability on the group structure.

P-soluble groupP-supersolubleGrups Teoria deFinite groupMATEMATICA APLICADAMatemàticaSubnormal subgroupZ-permutable subgroup
researchProduct

Hamilton–Jacobi semi-groups in infinite dimensional spaces

2006

AbstractLet (X,ρ) be a Polish space endowed with a probability measure μ. Assume that we can do Malliavin Calculus on (X,μ). Let d:X×X→[0,+∞] be a pseudo-distance. Consider QtF(x)=infy∈X{F(y)+d2(x,y)/2t}. We shall prove that QtF satisfies the Hamilton–Jacobi inequality under suitable conditions. This result will be applied to establish transportation cost inequalities on path groups and loop groups in the spirit of Bobkov, Gentil and Ledoux.

Path (topology)Mathematics(all)Pure mathematicsGeneral MathematicsMathematical analysisTransportation cost inequalitiesMalliavin calculusHamilton–Jacobi equationHeat measuresLoop groupsLoop (topology)Hamilton–Jacobi semi-groupInfinite groupLoop groupPseudo-distanceMalliavin CalculusPolish spaceMathematicsProbability measureBulletin des Sciences Mathématiques
researchProduct

Sylow permutable subnormal subgroups of finite groups II

2001

[EN] In this paper a local version of Agrawal's theorem about the structure of finite groups in which Sylow permutability is transitive is given. The result is used to obtain new characterisations of this class of finite groups.

Permutability conditionsTransitive relationClass (set theory)Soluble groupGeneral MathematicsSubnormal p'-perfect subgroupSylow theoremsStructure (category theory)Grups Teoria dePst_p-groupHall subgroupsCombinatoricsLocally finite groupComponent (group theory)ÀlgebraPermutable primeAlgebra over a fieldMathematicsBulletin of the Australian Mathematical Society
researchProduct

Teaching Fourier optics through ray matrices

2005

In this work we examine the use of ray-transfer matrices for teaching and for deriving some topics in a Fourier optics course, exploiting the mathematical simplicity of ray matrices compared to diffraction integrals. A simple analysis of the physical meaning of the elements of the ray matrix provides a fast derivation of the conditions to obtain the optical Fourier transform. We extend this derivation to fractional Fourier transform optical systems, and derive the order of the transform from the ray matrix. Some examples are provided to stress this point of view, both with classical and with graded index lenses. This formulation cannot replace the complete explanation of Fourier optics prov…

Physicsbusiness.industryDiscrete-time Fourier transformMathematical analysisFourier opticsPhysics::OpticsGeneral Physics and AstronomyFractional Fourier transformsymbols.namesakeDiscrete Fourier transform (general)OpticsFourier transformFourier analysissymbolsbusinessFourier seriesFourier transform on finite groupsEuropean Journal of Physics
researchProduct

On the number of different prime divisors of element orders

2005

We prove that the number of different prime divisors of the order of a finite group is bounded by a polynomial function of the maximum of the number of different prime divisors of the element orders. This improves a result of J. Zhang.

Practical numberFinite groupDivisorMathematics::Number TheoryApplied MathematicsGeneral MathematicsPrime numberDivisor functionPrime (order theory)CombinatoricsMathematics::Algebraic GeometryOrder (group theory)Prime powerMathematicsProceedings of the American Mathematical Society
researchProduct