The three-permutations problem
From MaRDI portal
Given a set \(N=\{1,2,3,...,n\}\) and any three permutations on it, it is desired to choose f: \(N\to \{-1,1\}\) in such a way so as to minimize the maximum of absolute partial sum of f values. The three-permutation problem is to obtain the supremum of this minimum. Nothing is known about this supremum except that it is greater than or equal to 2. In this paper the authors consider a special case of this problem in which the maximum absolute partial sum for one of the three permutations is 1. It is shown that for this special case the supremum is unbounded.
Recommendations
Cites work
Cited in
(6)- A note on ternary sequences of strings of 0 and 1
- On a property of a three-dimensional matrix
- On reverse-free codes and permutations
- scientific article; zbMATH DE number 4031768 (Why is no real title available?)
- scientific article; zbMATH DE number 7106992 (Why is no real title available?)
- On one extremal problem for numerical series
This page was built for publication: The three-permutations problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908913)