Searcharxiv⌕ Search

arXiv subjects

Vladimir V. Sergeichuk

Publications and source records attributed to Vladimir V. Sergeichuk.

66 records · Page 4Linked to original sources
arXiv2007

Existence of a multiplicative basis for a finitely spaced module over an aggregate

By [R. Bautista, P. Gabriel, A.V Roiter., L. Salmeron, Representation-finite algebras and multiplicative basis. Invent. Math. 81 (1985) 217-285.], a finite-dimensional algebra having finitely many isoclasses of indecomposable representations admits a multiplicative basis. In Sections 4.10-4.12 of [P. Gabriel, A. V. Roiter, Representations of finite-dimensional algebras. Encyclopaedia of Math. Sci., vol. 73, Algebra 8, Springer-Verlag, 1992] an analogous hypothesis was formulated for finitely spaced modules over an aggregate. We prove this conjecture.

math.RT↗
arXiv2007

The problems of classifying pairs of forms and local algebras with zero cube radical are wild

We prove that over an algebraically closed field of characteristic not two the problems of classifying pairs of sesquilinear forms in which the second is Hermitian, pairs of bilinear forms in which the second is symmetric (skew-symmetric), and local algebras with zero cube radical and square radical of dimension 2 are hopeless since each of them reduces to the problem of classifying pairs of n-by-n matrices up to simultaneous similarity.

math.RT↗
arXiv2007

Problems of classifying associative or Lie algebras and triples of symmetric or skew-symmetric matrices are wild

We prove that the problems of classifying triples of symmetric or skew-symmetric matrices up to congruence, local commutative associative algebras with zero cube radical and square radical of dimension 3, and Lie algebras with central commutator subalgebra of dimension 3 are hopeless since each of them reduces to the problem of classifying pairs of n-by-n matrices up to simultaneous similarity.

math.RT↗
arXiv2007

Canonical forms for complex matrix congruence and *congruence

Canonical forms for congruence and *congruence of square complex matrices were given by Horn and Sergeichuk in [Linear Algebra Appl. 389 (2004) 347-353], based on Sergeichuk's paper [Math. USSR, Izvestiya 31 (3) (1988) 481-501], which employed the theory of representations of quivers with involution. We use standard methods of matrix analysis to prove directly that these forms are canonical. Our proof provides explicit algorithms to compute all the blocks and parameters in the canonical forms. We use these forms to derive canonical pairs for simultaneous congruence of pairs of complex symmetric and skew-symmetric matrices as well as canonical forms for simultaneous *congruence of pairs of complex Hermitian matrices.

math.RT↗
arXiv2007

Canonical matrices for linear matrix problems

We consider a large class of matrix problems, which includes the problem of classifying arbitrary systems of linear mappings. For every matrix problem from this class, we construct Belitskii's algorithm for reducing a matrix to a canonical form, which is the generalization of the Jordan normal form, and study the set C(m,n) of indecomposable canonical m-by-n matrices. Considering C(m,n) as a subset in the affine space of m-by-n matrices, we prove that either C(m,n) consists of a finite number of points and straight lines for every (m,n), or C(m,n) contains a 2-dimensional plane for a certain (m,n).

math.RT↗
arXiv2007

Complexity of matrix problems

In representation theory, the problem of classifying pairs of matrices up to simultaneous similarity is used as a measure of complexity; classification problems containing it are called wild problems. We show in an explicit form that this problem contains all classification matrix problems given by quivers or posets. Then we prove that it does not contain (but is contained in) the problem of classifying three-valent tensors. Hence, all wild classification problems given by quivers or posets have the same complexity; moreover, a solution of any one of these problems implies a solution of each of the others. The problem of classifying three-valent tensors is more complicated.

math.RT↗
arXiv2007

Estimate of the number of one-parameter families of modules over a tame algebra

The problem of classifying modules over a tame algebra A reduces to a block matrix problem of tame type whose indecomposable canonical matrices are zero- or one-parameter. Respectively, the set of nonisomorphic indecomposable modules of dimension at most d divides into a finite number f(d,A) of modules and one-parameter series of modules. We prove that the number of m-by-n canonical parametric block matrices with a given partition into blocks is bounded by 4^s, where s is the number of free entries (which is at most mn), and estimate the number f(d,A).

math.RT↗
arXiv2007

Littlewood's algorithm and quaternion matrices

A strengthened form of Schur's triangularization theorem is given for quaternion matrices with real spectrum (for complex matrices it was given by Littlewood). Littlewood's algorithm for reducing a complex matrix to a canonical form under unitary similarity is extended to quaternion matrices whose eigenvalues have geometric multiplicity 1.

math.RT↗
arXiv2007

Unitary and Euclidean representations of a quiver

A unitary (Euclidean) representation of a quiver is given by assigning to each vertex a unitary (Euclidean) vector space and to each arrow a linear mapping of the corresponding vector spaces. We recall an algorithm for reducing the matrices of a unitary representation to canonical form, give a certain description of the representations in canonical form, and reduce the problem of classifying Euclidean representations to the problem of classifying unitary representations. We also describe the set of dimensions of all indecomposable unitary (Euclidean) representations of a quiver and establish the number of parameters in an indecomposable unitary representation of a given dimension.

math.RT↗