On a property of a three-dimensional matrix (Q2249936): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58920137, #quickstatements; #temporary_batch_1712261475387
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the Plane Term Rank of a Three Dimensional Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the plane term rank of three dimensional matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of suffix arrays to multi-dimensional matrices. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cubic Matrices, Generalized Spin Algebra and Uncertainty Relation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three-dimensional axial assignment problems with decomposable cost coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—The Multidimensional Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Monge property for the \(d\)-dimensional transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment problem for three-index Jacobi matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for three-dimensional assignment problems with triangle inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric three-dimensional assignment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for the Three-Index Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of max-regret, greedy and other heuristics for multidimensional assignment and traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the axial three-index assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing traveling salesman problem for special matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm with performance guarantees for the maximum traveling salesman problem on special matrices / rank
 
Normal rank

Latest revision as of 18:00, 8 July 2024

scientific article
Language Label Description Also known as
English
On a property of a three-dimensional matrix
scientific article

    Statements

    On a property of a three-dimensional matrix (English)
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    Summary: Let \(S_n\) be the symmetrical group acting on the set \(\{1,2,\dots,n\}\) and \(x, y\in S_n\). Consider the set \(W=\{(i,x(i), y(i))\;|\;1\leq i\leq n,\;|i-x(i)|>1\vee |i-y(i)|>1\vee|x(i)-y(i)|>1\}\). The main result of this paper is the following theorem. If the number of \(W\) set entries is more than \([n/3]\), then there exist entries \((i_1,x(i_1),y(i_1)), (i_2,x(i_2),y(i_2)), (i_3,x(i_3),y(i_3))\in W\) such that \(|i_1-x(i_2)|\leq 1\), \(|i_1-y(i_3)|\leq 1\), and \(|x(i_2)-y(i_3)|\leq 1\). The application of this theorem to the three-dimensional assignment problem is considered.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    three-dimensional assignment problem
    0 references
    0 references
    0 references