Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.13437 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912765351821312 |
|---|---|
| author | Guterman, Alexander Yurkov, Andrey |
| author_facet | Guterman, Alexander Yurkov, Andrey |
| contents | This paper is the first in the series of papers devoted to the explicit description of linear maps preserving the Cullis' determinant of rectangular matrices with entries belonging to an arbitrary ground field which is large enough.
The Cullis' determinant is defined for every matrix of size $n\times k$, where $n \ge k \ge 1$ and is equal to the ordinary determinant if $n = k$. In this paper we solve the linear preserver problem for the Cullis' determinant for $k \ge 4, n \ge k + 2$ and $n + k$ is even. It appears that in this case all linear maps preserving the Cullis' determinant are non-singular and could be represented by two-sided matrix multiplication.
Note that the cases where $n = k$ or $n = k + 1$ admit slightly different description allowing (sub)matrix transposition and were completely studied before: the case where $n = k$ is a classical linear preserver problem for the ordinary determinant and was solved by Frobenius; the complete characterisation for the case where $n = k + 1$ was obtained in the previous paper by the authors. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2512_13437 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Linear maps preserving the Cullis' determinant. I Guterman, Alexander Yurkov, Andrey Combinatorics 15A15, 15A86, 47B49 This paper is the first in the series of papers devoted to the explicit description of linear maps preserving the Cullis' determinant of rectangular matrices with entries belonging to an arbitrary ground field which is large enough. The Cullis' determinant is defined for every matrix of size $n\times k$, where $n \ge k \ge 1$ and is equal to the ordinary determinant if $n = k$. In this paper we solve the linear preserver problem for the Cullis' determinant for $k \ge 4, n \ge k + 2$ and $n + k$ is even. It appears that in this case all linear maps preserving the Cullis' determinant are non-singular and could be represented by two-sided matrix multiplication. Note that the cases where $n = k$ or $n = k + 1$ admit slightly different description allowing (sub)matrix transposition and were completely studied before: the case where $n = k$ is a classical linear preserver problem for the ordinary determinant and was solved by Frobenius; the complete characterisation for the case where $n = k + 1$ was obtained in the previous paper by the authors. |
| title | Linear maps preserving the Cullis' determinant. I |
| topic | Combinatorics 15A15, 15A86, 47B49 |
| url | https://arxiv.org/abs/2512.13437 |