Search results for " characters"

showing 10 items of 69 documents

Iconicity in grammar chinese

2014

The notion of iconicity has become an interesting topic in the Western cognitive linguistics today. We chose to study the problem of iconicity in the context of Chinese grammar. Like any "ideographic" language, the Mandarin Chinese reveal a high degree of iconicity by his writing. In the history of Chinese linguistics, many studies have been done on the similarity between the form of the Chinese character and the sense which it represents. However, we only began to develop the notion of iconicity in the phonetic and syntactic domains with the introduction of cognitive linguistics in China thirty years ago. In this thesis, we will develop the notion of iconicity in the grammar of Chinese in …

ChinoisGrammarChineseGrammaireÉcriture chinoisePhoneticIconicityIconicitéSyntaxPhonétiqueChinese characters[SHS.LANGUE] Humanities and Social Sciences/LinguisticsSyntaxe
researchProduct

Correspondences Between 2-Brauer Characters of Solvable Groups

2010

Let G be a finite solvable group and let p be a prime. Let P ∈ Syl p (G) and N = N G (P). We prove that there exists a natural bijection between the 2-Brauer irreducible characters of p′-degree of G and those of N G (P).

CombinatoricsDiscrete mathematicsAlgebra and Number TheoryBrauer's theorem on induced charactersSolvable groupExistential quantificationBijectionPrime (order theory)MathematicsCommunications in Algebra
researchProduct

A partition of characters associated to nilpotent subgroups

1999

IfG is a finite solvable group andH is a maximal nilpotent subgroup ofG containingF(G), we show that there is a canonical basisP(G|H) of the space of class functions onG vanishing off anyG-conjugate ofH which consists of characters. ViaP(G|H) it is possible to partition the irreducible characters ofG into “blocks”. These behave like Brauerp-blocks and a Fong theory for them can be developed.

CombinatoricsDiscrete mathematicsNilpotentBrauer's theorem on induced charactersSolvable groupGeneral MathematicsPartition (number theory)Nilpotent groupMathematicsIsrael Journal of Mathematics
researchProduct

The minimal number of characters over a normal p-subgroup

2007

Abstract If N is a normal p-subgroup of a finite group G and θ ∈ Irr ( N ) is a G-invariant irreducible character of N, then the number | Irr ( G | θ ) | of irreducible characters of G over θ is always greater than or equal to the number k p ′ ( G / N ) of conjugacy classes of G / N consisting of p ′ -elements. In this paper, we investigate when there is equality.

CombinatoricsFinite groupAlgebra and Number TheoryCharacter (mathematics)Brauer's theorem on induced charactersConjugacy classCharacter tableCharactersCounting charactersFinite groupsNormal p-subgroupsMathematicsJournal of Algebra
researchProduct

p-Parts of Brauer character degrees

2014

Abstract Let G be a finite group and let p be an odd prime. Under certain conditions on the p-parts of the degrees of its irreducible p-Brauer characters, we prove the solvability of G. As a consequence, we answer a question proposed by B. Huppert in 1991: If G has exactly two distinct irreducible p-Brauer character degrees, then is G solvable? We also determine the structure of non-solvable groups with exactly two irreducible 2-Brauer character degrees.

CombinatoricsFinite groupAlgebra and Number TheoryCharacter (mathematics)Brauer's theorem on induced charactersSolvable groupStructure (category theory)Mathematics::Representation TheoryPrime (order theory)MathematicsJournal of Algebra
researchProduct

p-Brauer characters ofq-defect 0

1994

For ap-solvable groupG the number of irreducible Brauer characters ofG with a given vertexP is equal to the number of irreducible Brauer characters of the normalizer ofP with vertexP. In this paper we prove in addition that for solvable groups one can control the number of those characters whose degrees are divisible by the largest possibleq-power dividing the order of |G|.

CombinatoricsNumber theoryBrauer's theorem on induced charactersSolvable groupGeneral MathematicsOrder (group theory)Algebraic geometryMathematics::Representation TheoryCentralizer and normalizerMathematicsManuscripta Mathematica
researchProduct

Brauer's fixed-point-formula as a consequence of Thompson's order-formula

1991

CombinatoricsPure mathematicsBrauer's theorem on induced charactersGeneral MathematicsOrder (group theory)Fixed pointMathematicsArchiv der Mathematik
researchProduct

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|.

CombinatoricsVertex (graph theory)LiftsAlgebra and Number TheoryBrauer's theorem on induced charactersCorollarySolvable groupAbelian groupFinite groupsSolvable groupsBrauer charactersMathematicsJournal of Algebra
researchProduct

Complex group algebras of finite groups: Brauer’s Problem 1

2005

Brauer’s Problem 1 asks the following: what are the possible complex group algebras of finite groups? It seems that with the present knowledge of representation theory it is not possible to settle this question. The goal of this paper is to announce a partial solution to this problem. We conjecture that if the complex group algebra of a finite group does not have more than a fixed number m m of isomorphic summands, then its dimension is bounded in terms of m m . We prove that this is true for every finite group if it is true for the symmetric groups.

Computer Science::Machine LearningModular representation theoryPure mathematicsFinite groupBrauer's theorem on induced charactersGroup (mathematics)General MathematicsMathematicsofComputing_GENERALComputer Science::Digital LibrariesRepresentation theoryCombinatoricsStatistics::Machine LearningGroup of Lie typeSymmetric groupComputer Science::Mathematical SoftwareComputer Science::Programming LanguagesBrauer groupMathematicsElectronic Research Announcements of the American Mathematical Society
researchProduct

On the orders of zeros of irreducible characters

2009

Let G be a finite group and p a prime number. We say that an element g in G is a vanishing element of G if there exists an irreducible character χ of G such that χ (g) = 0. The main result of this paper shows that, if G does not have any vanishing element of p-power order, then G has a normal Sylow p-subgroup. Also, we prove that this result is a generalization of some classical theorems in Character Theory of finite groups. © 2008 Elsevier Inc. All rights reserved.

Discrete mathematicsFinite groupPure mathematicsBrauer's theorem on induced charactersAlgebra and Number Theoryirreducible character zeroCharacter theorySylow theoremsPrime numberIrreducible elementFinite groupsCharacter (mathematics)Order (group theory)Zeros of charactersCharactersMathematics
researchProduct