2013
DOI: 10.1134/s1064562413050037
|View full text |Cite
|
Sign up to set email alerts
|

A new family of polynomial identities for computing determinants

Abstract: We give new definitions for the determinant over commutative ring K, noncommutative ring K, noncommutative ring K with associative powers, over noncommutative nonassociative ring K, and study their properties.Let K be a commutative ring, K a noncommutative associative ring, K a noncommutative ring with associative powers (one-monomial associativity), and K be a noncommutative nonassociative ring; let each ring be with division by integers.Here we obtain a new family of polynomial identities for determinant ove… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2016
2016
2018
2018

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 1 publication
(1 reference statement)
0
5
0
Order By: Relevance
“…where A 0 is any n × n matrix over the field R. It is of interest to obtain similar results for Schur fuctions, the mixed discriminants, the resultants, and many other planar and space matrix functions over different algebraic systems of various type and its applications (see [4], [7] - [10] and many others). In our view, an answer to the following question is particularly interesting: for which operations f (x 1 , x 2 , .…”
Section: Resultsmentioning
confidence: 97%
See 1 more Smart Citation
“…where A 0 is any n × n matrix over the field R. It is of interest to obtain similar results for Schur fuctions, the mixed discriminants, the resultants, and many other planar and space matrix functions over different algebraic systems of various type and its applications (see [4], [7] - [10] and many others). In our view, an answer to the following question is particularly interesting: for which operations f (x 1 , x 2 , .…”
Section: Resultsmentioning
confidence: 97%
“…Ryser, 1963), which gives the fastest algorithm for computing P er(A). All computation formulas for е-permanents obtained here by means of the known polarization theorem for recovering a polyadditive function from its values on a diagonal [3,4]. (e) If the algebra Ψ 0 contains the unit e, and I n is the identity matrix then the equality eP er f (A) = e for the e-permanent over Ψ 0 is valid.…”
Section: Resultsmentioning
confidence: 99%
“…Let S (e) n and S (o) n be the subsets of even and odd permutations in S n , respectively. We call the sequence of elements of a 1σ (1) , . .…”
Section: Notations and Definitionsmentioning
confidence: 99%
“…If the ring Q is commutative then the validity of the formula (7) has been established by the author in [2]. If Q = K then the formula (7) for edet(A) has been mentioned (without proof) in [3]. Its validity directly follows from several simple statements of Lemmas 3-5.…”
Section: Theorem 2 ( [3])mentioning
confidence: 99%
See 1 more Smart Citation