• No results found

irreducible character degree

A new characterization of Mathieu groups by the order and one irreducible character degree

A new characterization of Mathieu groups by the order and one irreducible character degree

... largest irreducible character degree of G and S(G) denotes the second largest irreducible character degree of ...largest irreducible character ...

6

On nonsolvable groups whose prime degree graphs have four vertices and one triangle

On nonsolvable groups whose prime degree graphs have four vertices and one triangle

... prime degree graph of G, denoted by ∆(G), is an undirected graph whose vertex set is ρ(G) and there is an edge between two distinct primes p and q if and only if pq divides some irreducible character ...

6

Characterization of some simple $K_4$-groups by some irreducible complex character degrees

Characterization of some simple $K_4$-groups by some irreducible complex character degrees

... largest irreducible character degree of G, s(G) be the second largest irreducible character degree of G and t(G) be the third largest irreducible character ...

14

Bipartite divisor graph for the set of irreducible character degrees

Bipartite divisor graph for the set of irreducible character degrees

... F (H)], [H : F (H)] } . As ∆(H) has two connected components, we can see that H is either a group of type one or four in the sense of [8]. Also by [17, Lemma 5.1] we deduce that m = [G : F (G)] and cd(F (G)) = {1, h q ′ ...

11

Computing in Algebraic Closures of Finite Fields

Computing in Algebraic Closures of Finite Fields

... Another way of introducing minimal polynomials is as follows. As mentioned before, every ideal in F [ X ] can be written as 〈 f 〉 for some f ∈ F [ X ] . This is, in fact, the result of F [ X ] being an Euclidean domain; ...

86

ALEXANDER I N V A R I A N T S O F H Y P E R S U R FA C E COM P L E M E N T S

ALEXANDER I N V A R I A N T S O F H Y P E R S U R FA C E COM P L E M E N T S

... Theorem 9.1).. If V is an irreducible curve of degree d in CP 2 , in general position at infinity, then the associated ’polynomial at infinity’, i.e.. Libgober has found a simpler proof [r] ...

89

Primitive irreducible linear groups

Primitive irreducible linear groups

... We next show that Hj^ is primitive and irreducible. For notational convenience, we only show this for i=l, proper Irreducibility: suppose that R^ is a ifion-?trivial H^- -invariant subspace of Q^^. Let l=g2^, ... ...

53

Classifying families of character degree graphs of solvable groups

Classifying families of character degree graphs of solvable groups

... of vertices, of size k and t, respectively), and we place an edge between the two graphs injectively. That is, we attach edges uniquely from one complete graph to the other in a one-to-one fashion. The construction ...

10

Actions of groups of birationally extendible automorphisms

Actions of groups of birationally extendible automorphisms

... We now explain sufficient conditions (due to Webster [29]) such that all algebraic automorphisms of D are birationally extendible. Let D be as in Corollary 1. The existence of finite stratifications for semialgebraic ...

30

CT and Angiography of Primary Extradural Juxtasellar Tumors

CT and Angiography of Primary Extradural Juxtasellar Tumors

... The tumors in our series could be differentiated by the presence or absence of tumor calcification , degree and character of contrast enhancement, degree and location of bone erosion, an[r] ...

6

On certain finite linear groups of prime degree

On certain finite linear groups of prime degree

... CHAPTER I INTRODUCTION In studying finite linear groups of fixed degree over the complex field, it is convenient to restrict attention to irreducible, unimodular, and quasiprimitive grou[r] ...

48

Orthant spanning simplexes with minimal volume

Orthant spanning simplexes with minimal volume

... Specifically, in this paper, it has been proved that the solution of the opti- mal simplex problem depends on the positive root of a (2 n − 1)-degree poly- nomial. This polynomial cannot be solved using radicals ...

12

The Irreducible Representations of D2n

The Irreducible Representations of D2n

... In the last section we discussed a very important correspondence between KG- modules and pairs (V, φ), where V is a vector space over K and φ is a representation of G. That is, there is a bijection between KG-modules and ...

64

Anchors of irreducible characters

Anchors of irreducible characters

... Permanent repository link: http://openaccess.city.ac.uk/13197/ Link to published version: http://dx.doi.org/10.1016/j.jalgebra.2015.11.034 Copyright and reuse: City Research Online aims [r] ...

6

Musukwa

Musukwa

... In counting the non-extended irreducible Goppa codes we consider the action of H on S . This gives orbits in S denoted by A(α) called affine sets. We then consider the action of G on the set A where A = {A(α) : α ...

12

Weakly irreducible ideals

Weakly irreducible ideals

... Proof. (1) Suppose I is a proper ideal of R. (i) ⇔ (iii) follows from [3, Definition 2 p. 176]. (i) ⇒ (ii). Let I be a quasi-primary ideal of R. Then √ I is a prime and hence a weakly irreducible ideal of R. (ii) ...

9

Anchors of irreducible characters

Anchors of irreducible characters

... character of N . By construction, neither ˜ α nor ˜ β is G-stable. Hence, also by general results on p-factorable characters, ˜ α β ˜ is not G-stable. Since |G/N | = p, it follows that χ is an irreducible ...

19

Recent  progress  on  the  elliptic  curve  discrete  logarithm  problem

Recent progress on the elliptic curve discrete logarithm problem

... first-fall degree (FFD) of the polynomial ...increasing degree while computing the basis, maybe backtracking to handle smaller degree polynomials if they happen to be created along the ...the ...

26

Simple Groups and Related Topics

Simple Groups and Related Topics

... distinct irreducible characters χ (1) , χ (2) , ...different irreducible characters; one of degree 2 and the other of degree 5, but the irreducible representation of degree 2 ...

306

Detecting the prime divisors of the character degrees and the class sizes by a subgroup generated with few elements

Detecting the prime divisors of the character degrees and the class sizes by a subgroup generated with few elements

... π(G) = π(H). Not only its vertex set π(G), but also the prime graph Γ(G) itself can be recognized by a subgroup H generated by few elements: indeed every finite group G contains a three-generated subgroup H such that ...

5

Show all 10000 documents...

Related subjects