RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
 General information Latest issue Archive Search papers Search references RSS Latest issue Current issues Archive issues What is RSS

 The Bulletin of Irkutsk State University. Series Mathematics: Year: Volume: Issue: Page: Find

 The Bulletin of Irkutsk State University. Series Mathematics, 2018, Volume 26, Pages 121–127 (Mi iigum361)

Short Papers

Determinants as combinatorial summation formulas over an algebra with a unique $n$-ary operation

G. P. Egorychev

Siberian Federal University, Krasnoyarsk, Russian Federation

Abstract: Since the late 1980s the author has published a number of results on matrix functions, which were obtained using the generating functions, mixed discriminants (mixed volumes in $\mathbb R^n$), and the well-known polarization theorem (the most general version of this theorem is published in "The Bulletin of Irkutsk State University. Series Mathematics" in 2017). The polarization theorem allows us to obtain a set of computational formulas (polynomial identities) containing a family of free variables for polyadditive and symmetric functions. In 1979-1980, the author has found the first polynomial identity for permanents over a commutative ring, and, in 2013, the polynomial identity of a new type for determinants over a noncommutative ring with associative powers.
In this paper we give a general definition for determinant (the $e$-determinant) over an algebra with a unique $n$-ary $f$-operation. This definition is different from the well-known definition of the noncommutative Gelfand determinant. It is shown that under natural restrictions on the $f$-operation the $e$-determinant keeps the basic properties of classical determinants over the field $\mathbb{R}$. A family of polynomial identities for the $e$-determinants is obtained. We are convinced that the task of obtaining similar polynomial identities for Schur functions, the mixed determinants, resultants and other matrix functions over various algebraic systems is quite interesting. And an answer to the following question is especially interesting: for which $n$-ary $f$-operations a fast quantum computers based calculation of $e$-determinants is possible?

Keywords: determinants and permanents, noncommutative and multioperator algebras, polarization and inclusion-conclusion theorems, quantum computers.

DOI: https://doi.org/10.26516/1997-7670.2018.26.121

Full text: PDF file (335 kB)
References: PDF file   HTML file

Bibliographic databases:

UDC: 512.64+512.55+519.1
MSC: 15A15, 15A16

Citation: G. P. Egorychev, “Determinants as combinatorial summation formulas over an algebra with a unique $n$-ary operation”, The Bulletin of Irkutsk State University. Series Mathematics, 26 (2018), 121–127

Citation in format AMSBIB
\Bibitem{Ego18} \by G.~P.~Egorychev \paper Determinants as combinatorial summation formulas over an algebra with a unique $n$-ary operation \jour The Bulletin of Irkutsk State University. Series Mathematics \yr 2018 \vol 26 \pages 121--127 \mathnet{http://mi.mathnet.ru/iigum361} \crossref{https://doi.org/10.26516/1997-7670.2018.26.121}