2009
DOI: 10.1016/j.laa.2008.07.018
|View full text |Cite
|
Sign up to set email alerts
|

An algorithm for associative bilinear forms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
6
0

Year Published

2010
2010
2023
2023

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(7 citation statements)
references
References 2 publications
1
6
0
Order By: Relevance
“…is obtained by only one elementary transformation from (2). The same result we can get if we consider the automorphism (x − ys, y + zs − xt, z − yt, s + t 2 , t) obtained from (1) by one elementary transformation.…”
Section: Comments and Problemssupporting
confidence: 68%
See 4 more Smart Citations
“…is obtained by only one elementary transformation from (2). The same result we can get if we consider the automorphism (x − ys, y + zs − xt, z − yt, s + t 2 , t) obtained from (1) by one elementary transformation.…”
Section: Comments and Problemssupporting
confidence: 68%
“…A counterexample of dimension 9 for m = 3 is given in [28]. [4] started his construction from the automorphism (2). It might be interesting try to get a binary counter-example starting from the binary automorphism (1).…”
Section: Albert's Problem and The Homogeneous Dependence Problemmentioning
confidence: 99%
See 3 more Smart Citations