1971
DOI: 10.1007/bf00411808
|View full text |Cite
|
Sign up to set email alerts
|

The origins of the theory of group characters

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
18
0

Year Published

1982
1982
2013
2013

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 55 publications
(18 citation statements)
references
References 7 publications
0
18
0
Order By: Relevance
“…The following lemma provides a natural generalization of the well-known computation of the cyclic determinant and was originally due to Dedekind (see [4]). The computation of the rank is an analogue of a theorem by A. Schinzel concerning the rank of a cyclic matrix ( [3]).…”
Section: Abelian Casementioning
confidence: 99%
“…The following lemma provides a natural generalization of the well-known computation of the cyclic determinant and was originally due to Dedekind (see [4]). The computation of the rank is an analogue of a theorem by A. Schinzel concerning the rank of a cyclic matrix ( [3]).…”
Section: Abelian Casementioning
confidence: 99%
“…Similarly, abstracting proofs of properties of characters on (Z/mZ) * that rely on features specific to the integers modulo m paves the way to extending these properties to group characters more generally. Characters and their properties form the basis for representation theory, which has been an essential part of group theory since the turn of the twentieth century [48,60]. Authors like Hadamard, de la Vallée-Poussin, and Landau were also interested in extending Dirichlet's methods to other kinds of Dirichlet series, which now play a core role in analytic number theory.…”
Section: Changes In Mathematical Methodsmentioning
confidence: 99%
“…These facts are now quite familiar in constructive and computable analysis. 48 Kronecker's treatment of characters provides an interesting combination of Dirichlet's approach and modern ones. Fixing a modulus m, Kronecker, like Dirichlet, provided a fully explicit description of the characters modulo m in terms of primitive elements of the powers of primes giving m and primitive roots of unity.…”
Section: Kroneckermentioning
confidence: 99%
“…(9) Frobenius's most famous mathematical achievement is to be found in the theory of group characters (for the history of representation theory see [32], [33], and [37]). In 1896 he initiated representation theory of finite groups (over the field C of complex numbers) and established what we now conceive as its most basic vocabulary and results [17], [18]' [19].…”
mentioning
confidence: 99%