Page 1 Next

Displaying 1 – 20 of 136

Showing per page

A note on majorization transforms and Ryser’s algorithm

Geir Dahl (2013)

Special Matrices

The notion of a transfer (or T -transform) is central in the theory of majorization. For instance, it lies behind the characterization of majorization in terms of doubly stochastic matrices. We introduce a new type of majorization transfer called L-transforms and prove some of its properties. Moreover, we discuss how L-transforms give a new perspective on Ryser’s algorithm for constructing (0; 1)-matrices with given row and column sums.

A note on tree realizations of matrices

Alain Hertz, Sacha Varone (2007)

RAIRO - Operations Research

It is well known that each tree metric M has a unique realization as a tree, and that this realization minimizes the total length of the edges among all other realizations of M. We extend this result to the class of symmetric matrices M with zero diagonal, positive entries, and such that mij + mkl ≤ max{mik + mjl, mil + mjk} for all distinct i,j,k,l.

A transvection decomposition in GL(n,2)

Clorinda De Vivo, Claudia Metelli (2002)

Colloquium Mathematicae

An algorithm is given to decompose an automorphism of a finite vector space over ℤ₂ into a product of transvections. The procedure uses partitions of the indexing set of a redundant base. With respect to tents, i.e. finite ℤ₂-representations generated by a redundant base, this is a decomposition into base changes.

Currently displaying 1 – 20 of 136

Page 1 Next