AGAlexander Guterman
Alexander Guterman
*This is an algorithmically generated author record based on publicly available information.
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Alexander Guterman has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
- Svetlana Zhilina
Department of mathematics and mechanics, Lomonosov Moscow State University, Moscow, Russia
6 shared publications - Bojan Kuzma
University of Primorska, Koper, Slovenia
3 shared publications - Igor A. Spiridonov
Natl Res Univ Higher Sch Econ, Fac Math, Moscow, Russia
3 shared publications - Alexander Vlasov
Lomonosov Moscow State University, Moscow, Russia
2 shared publications - Artem M. Maksaev
Faculty of Computer Science, HSE University, Moscow, Russia
2 shared publications - E. R. Shafeev
Lomonosov Moscow State University, Moscow, Russia
2 shared publications
Latest Publications
- 25 May 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 299 (6) , 926-937
ALGEBRAICALLY CHAINABLE MATRICES AND THEIR PROPERTIES
- 25 May 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 299 (6) , 926-937
ALGEBRAICALLY CHAINABLE MATRICES AND THEIR PROPERTIES
- 19 May 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 299 (6) , 889-898
DIVISIBILITY OF THE PERMANENTS OF MULTIDIMENSIONAL $(-1, 1)$-MATRICES BY POWERS OF 2- 19 May 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 299 (6) , 889-898
DIVISIBILITY OF THE PERMANENTS OF MULTIDIMENSIONAL $(-1, 1)$-MATRICES BY POWERS OF 2- Open Access
- 5 March 2026
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- p. 1-17
Hamiltonian Sets of Polygonal Paths in Assembly Graphs
We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative to its size. These conditions serve to prove the conjecture that such a maximum, which is equal to $F_{2n+1}-1$ , where $F_k$ denotes the $k$ th Fibonacci number, is achieved only for special assembly graphs, called tangled cords.- 5 March 2026
- Published by Cambridge University Press (CUP) in Proceedings of the Edinburgh Mathematical Society
- p. 1-17
Open AccessHamiltonian Sets of Polygonal Paths in Assembly Graphs
We provide four equivalent combinatorial conditions for a simple assembly graph (rigid vertex graph where all vertices are of degree 1 or 4) to have the largest number of Hamiltonian sets of polygonal paths relative to its size. These conditions serve to prove the conjecture that such a maximum, which is equal to $F_{2n+1}-1$ , where $F_k$ denotes the $k$ th Fibonacci number, is achieved only for special assembly graphs, called tangled cords. - 1 January 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 296 (2) , 192-202
ON LINEAR TRANSFORMATIONS PRESERVING CYCLICITY INDEX OF NONNEGATIVE MATRICES
- 1 January 2026
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 296 (2) , 192-202
ON LINEAR TRANSFORMATIONS PRESERVING CYCLICITY INDEX OF NONNEGATIVE MATRICES
- Open Access
Linear maps preserving the Cullis' determinant. I
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.Open AccessLinear maps preserving the Cullis' determinant. I
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. - 1 March 2025
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 288 (4) , 442-456
Frobenius and Sylvester Inequalities for the Chainable Rank
- 1 March 2025
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 288 (4) , 442-456
Frobenius and Sylvester Inequalities for the Chainable Rank
- 1 March 2025
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 288 (4) , 423-441
Geometry of Varieties of Mutually Orthogonal Matrices
- 1 March 2025
- Published by Springer Nature in Journal of Mathematical Sciences
- Vol. 288 (4) , 423-441
Geometry of Varieties of Mutually Orthogonal Matrices
- 19 July 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 700, 1-25
On the group of linear preservers of the Gau-Wu number
- 19 July 2024
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 700, 1-25
On the group of linear preservers of the Gau-Wu number
- Open Access
- 26 April 2024
- Published by Springer Nature in Advances in Operator Theory
- Vol. 9 (3) , 1-33
Birkhoff–James classification of norm’s properties
For an arbitrary normed space $$\mathcal {X}$$ over a field $$\mathbb {F}\in \{ \mathbb {R}, \mathbb {C}\},$$ we define the directed graph $$\Gamma (\mathcal {X})$$ induced by Birkhoff–James orthogonality on the projective space $$\mathbb P(\mathcal {X}),$$ and also its nonprojective counterpart $$\Gamma _0(\mathcal {X}).$$ We show that, in finite-dimensional normed spaces, $$\Gamma (\mathcal {X})$$ carries all the information about the dimension, smooth points, and norm’s maximal faces. It also allows to determine whether the norm is a supremum norm or not, and thus classifies finite-dimensional abelian $$C^*$$ -algebras among other normed spaces. We further establish the necessary and sufficient conditions under which the graph $$\Gamma _0({\mathcal {R}})$$ of a (real or complex) Radon plane $${\mathcal {R}}$$ is isomorphic to the graph $$\Gamma _0(\mathbb {F}^2, {\Vert \cdot \Vert }_2)$$ of the two-dimensional Hilbert space and construct examples of such nonsmooth Radon planes.- 26 April 2024
- Published by Springer Nature in Advances in Operator Theory
- Vol. 9 (3) , 1-33
Open AccessBirkhoff–James classification of norm’s properties
For an arbitrary normed space $$\mathcal {X}$$ over a field $$\mathbb {F}\in \{ \mathbb {R}, \mathbb {C}\},$$ we define the directed graph $$\Gamma (\mathcal {X})$$ induced by Birkhoff–James orthogonality on the projective space $$\mathbb P(\mathcal {X}),$$ and also its nonprojective counterpart $$\Gamma _0(\mathcal {X}).$$ We show that, in finite-dimensional normed spaces, $$\Gamma (\mathcal {X})$$ carries all the information about the dimension, smooth points, and norm’s maximal faces. It also allows to determine whether the norm is a supremum norm or not, and thus classifies finite-dimensional abelian $$C^*$$ -algebras among other normed spaces. We further establish the necessary and sufficient conditions under which the graph $$\Gamma _0({\mathcal {R}})$$ of a (real or complex) Radon plane $${\mathcal {R}}$$ is isomorphic to the graph $$\Gamma _0(\mathbb {F}^2, {\Vert \cdot \Vert }_2)$$ of the two-dimensional Hilbert space and construct examples of such nonsmooth Radon planes.