1954
DOI: 10.1215/s0012-7094-54-02143-2
|View full text |Cite
|
Sign up to set email alerts
|

An algebra determined by a binary cubic form

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

1969
1969
2019
2019

Publication Types

Select...
6
1

Relationship

0
7

Authors

Journals

citations
Cited by 20 publications
(9 citation statements)
references
References 0 publications
0
9
0
Order By: Relevance
“…As explained in the introduction, we characterize this problem in terms of finite dimensional representations of an algebra with involution. We became aware that a similar approach has been used for the problem of linearizing forms, by Heerema [6], Roby [17] and Childs [4], among others. A solution to their problem implies a determinantal representation for the polynomial, but not necessarily a hermitian one, and also without the matrix M 0 being positive semidefinite.…”
Section: The Generalized Clifford Algebra Associated With a Real Zeromentioning
confidence: 99%
See 1 more Smart Citation
“…As explained in the introduction, we characterize this problem in terms of finite dimensional representations of an algebra with involution. We became aware that a similar approach has been used for the problem of linearizing forms, by Heerema [6], Roby [17] and Childs [4], among others. A solution to their problem implies a determinantal representation for the polynomial, but not necessarily a hermitian one, and also without the matrix M 0 being positive semidefinite.…”
Section: The Generalized Clifford Algebra Associated With a Real Zeromentioning
confidence: 99%
“…Similar algebras have been used before by different authors (see e.g. [4,6,14,17]), in attempts to linearize forms and realize polynomials as minimal polynomials of matrix pencils. Their results relate to our problem, but do not take into account the desire for hermitian representations.…”
Section: Introductionmentioning
confidence: 98%
“…The case of n = 2 and d = 3 was first considered by Heerema in [12]. Haile studied these algebras in the series of papers [6,7,8,9].…”
Section: Introductionmentioning
confidence: 99%
“…Therefore we can deal with the functions satisfying equation (23) independently of whether or not we know that they arose from a projective representation, forming a group of them, and introducing the equivalence described by equation (27). In dealing with multipliers, arising from a projective representation with n x n matrices,, we could divide each matrix by the nth root of its determinant.…”
Section: Conversely Any Complex Valued Functionmentioning
confidence: 99%
“…A much more exhaustive treatment of this realm was given by HarishChandra [23] and Rao [24], the former also applying similar techniques [25] to the closely related Kemmer matrices [26]. Although Dirac's use of anticommuting operators in 1928 to factor a quadratic form into linear factors suggests a similar technique to be used for other forms, it was not until 1954 that Heerema [27] published a comprehensive analysis of the use of hypercomplex numbers to factor a binary cubic. Beyond this, most attention seems to have centered on quadratic forms, Witt's paper having appeared in 1937, at the same time as another by Mordell [28].…”
Section: Introductionmentioning
confidence: 99%