A problem in rearrangements of (0, 1) matrices

  title={A problem in rearrangements of (0, 1) matrices},
  author={Ron Aharoni},
  journal={Discrete Mathematics},
Given a real matrix A of order n xn , we can permute its ei~ments in ( . : t ! ditteren! ways. Any matrix obtained from such a permutation i~ called a rearrangement of A. We denote by R ( A ) the set of rearrangemeni:s of A. Let us denote by /~{A). the set of matrices B in R(A) , whose e[ements do not mcrea~e in each row and column, that i:: (b,i)~'= I is a non-increasing sequence for every 1 ~ i ~ n, and (b,):' , is a non-increasing :equence for every I ~ / ~ n. For any matrix A. we dcm)te by… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-2 of 2 references

Optimization of functionals containing functions and their inverses, Math

  • M. Katz
  • Analy~. Appl
  • 1977
Highly Influential
3 Excerpts

Rearrangements of square matri,:es with nonnegativc elements

  • B. Schwarz
  • Duke Math. J
  • 1964
2 Excerpts

Similar Papers

Loading similar papers…