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

An application of lattice basis reduction to polynomial identities for algebraic structures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0

Year Published

2012
2012
2023
2023

Publication Types

Select...
9

Relationship

5
4

Authors

Journals

citations
Cited by 20 publications
(36 citation statements)
references
References 5 publications
0
36
0
Order By: Relevance
“…We must verify that every identity in degree 5 satisfied by the special commutator follows from (1) and (13). We use computer algebra [9]. Let T be the free weight-graded operad generated by one ternary operation [−, −, −] with no symmetry.…”
Section: Identities Of Degreementioning
confidence: 99%
“…We must verify that every identity in degree 5 satisfied by the special commutator follows from (1) and (13). We use computer algebra [9]. Let T be the free weight-graded operad generated by one ternary operation [−, −, −] with no symmetry.…”
Section: Identities Of Degreementioning
confidence: 99%
“…Let Con(7) ⊂ SkewTS(7) be the S 7 -submodule generated by the consequences (8) with respect to operadic partial composition of the relation T T (a, b, c, d, e) displayed in Theorem 5, and let ConNew(7) ⊂ SkewTS(7) be the S 7 -submodule generated by those consequences together with the 60-term relation in Figure 2. The quotient module ConNew(7)/Con (7) has dimension 106 and the following multiplicity-free decomposition into the direct sum of irreducible representations: The dimensions of the irreducible summands are respectively 35, 21, 35, 15. Let All(7) ⊂ SkewTS(7) be the S 7 -module consisting of all relations satisfied by the tortkara triple product in arity 7.…”
Section: Relations Of Aritymentioning
confidence: 99%
“…If the number of integer vectors is not too large, roughly < 500, then at this point we can apply the LLL algorithm for lattice basis reduction [6] to reduce the size of the coefficients. In any case, we then sort the integer vectors first by increasing number of nonzero components, then by increasing Euclidean norm, and finally by increasing maximum nonzero component (in absolute value).…”
Section: Two Jordan Productsmentioning
confidence: 99%