Article
Licensed
Unlicensed
Requires Authentication
Characteristic polynomials of multi-index transportation problems
-
V. N. Shevchenko
Published/Copyright:
July 1, 2003
For the matrix AT A, where A is the matrix of restrictions of a multi-index transportation problem, we give the characteristic polynomial and the base of eigenvectors. We discuss eventual applications of the results obtained.
Published Online: 2003-07-01
Published in Print: 2003-07-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
Articles in the same Issue
- Independent systems of automata in labyrinths
- Estimation of the time needed to set up a covert channel
- Schemes of public distribution of keys based on a non-commutative group
- Characteristic polynomials of multi-index transportation problems
- Construction of maximally non-Hamiltonian graphs
- Generating triples of involutions of large sporadic groups
- On the number of reversible homogeneous structures
- Random partitions of a set with given number of blocks
- On two statistics of chi-square type based on frequencies of tuples of states of a high-order Markov chain
