### Article

## Минимальный пример матрицы, различающей GM- и d-ранги в макс-алгебрах

We present an example of a 6x6 matrix A with tropical rank equal to 4 and Kapranov rank equal to 5. This disproves the conjecture formulated by M. Chan, A. Jensen, and E. Rubei.

This volume contains the proceedings of the International Workshop on Tropical and Idempotent Mathematics, held at the Independent University of Moscow, Russia, from August 26-31, 2012. The main purpose of the conference was to bring together and unite researchers and specialists in various areas of tropical and idempotent mathematics and applications. This volume contains articles on algebraic foundations of tropical mathematics as well as articles on applications of tropical mathematics in various fields as diverse as economics, electroenergetic networks, chemical reactions, representation theory, and foundations of classical thermodynamics. This volume is intended for graduate students and researchers interested in tropical and idempotent mathematics or in their applications in other areas of mathematics and in technical sciences

We investigate the Kapranov rank functions of tropical matrices for different ground fields. For any infinite ground field we show that the rank-product inequality holds for Kapranov rank, and we prove that the Kapranov rank respects Green’s preorders on the semigroup of tropical *n*-by-*n *matrices. The rank-product inequality is shown to fail for Kapranov rank over any finite ground field. We provide an example of a 7-by-7 01-matrixwhose Kapranov rank is independent of a ground field, equals 6, and exceeds tropical rank.

The notion of the factor rank of tropical matrices is considered. We construct a linear-time algorithm that either finds a full-rank 3 × 3 submatrix of a given matrix *A *or concludes that the factor rank of *A *is less than 3. We show that there exist matrices of factor rank 4 whose 4 × 4 submatrices are all rank deficient.

A model for organizing cargo transportation between two node stations connected by a railway line which contains a certain number of intermediate stations is considered. The movement of cargo is in one direction. Such a situation may occur, for example, if one of the node stations is located in a region which produce raw material for manufacturing industry located in another region, and there is another node station. The organization of freight traﬃc is performed by means of a number of technologies. These technologies determine the rules for taking on cargo at the initial node station, the rules of interaction between neighboring stations, as well as the rule of distribution of cargo to the ﬁnal node stations. The process of cargo transportation is followed by the set rule of control. For such a model, one must determine possible modes of cargo transportation and describe their properties. This model is described by a ﬁnite-dimensional system of diﬀerential equations with nonlocal linear restrictions. The class of the solution satisfying nonlocal linear restrictions is extremely narrow. It results in the need for the “correct” extension of solutions of a system of diﬀerential equations to a class of quasi-solutions having the distinctive feature of gaps in a countable number of points. It was possible numerically using the Runge–Kutta method of the fourth order to build these quasi-solutions and determine their rate of growth. Let us note that in the technical plan the main complexity consisted in obtaining quasi-solutions satisfying the nonlocal linear restrictions. Furthermore, we investigated the dependence of quasi-solutions and, in particular, sizes of gaps (jumps) of solutions on a number of parameters of the model characterizing a rule of control, technologies for transportation of cargo and intensity of giving of cargo on a node station.