Minimum permanents of doubly stochastic matrices with One fixed entry

For n  3 and sufficiently small a  0, the minimum value of the permanent function restricted on n × n doubly stochastic matrices with at least one entry equal to a is obtained. For n = 3, the explicit form of the function p is derived where p(a) = min{per(C):C = (c_ij )?Ω₃ c ₁₁ = a}a? [0, 1].     

Minimum permanents of doubly stochastic matrices with zero main diagonal

The permanent function on the set of n×n doubly stochastic matrices with zero main diagonal attains a strict local minimum at the matrix whose off diagonal entries are all equal to 1/(n-1).     

Minimum permanents of doubly stochastic matrices with prescribed zero entries

A study of properties of matrices with minimum permanent in a face of the polyhedron of doubly stochastic n × n matrices. The minima are determined for certain faces.     

Subpermanents of doubly stochastic matrices

It is shown that if all subpermaneats of order k of an n × n doubly stochastic matrix are equal for some k ≤ n - 2, then all the entries of the matrix must be equal to 1/n.     

Minimum permanents of doubly stochastic matrices with at least one zero entry

It is shown that the minimum value of the permanent on the n× ndoubly stochastic matrices which contain at least one zero entry is achieved at those matrices nearest to J_nin Euclidean norm, where J_nis the n× nmatrix each of whose entries is n^-1. In case n ≠ 3 the minimum permanent is achieved only at those matrices nearest J_n; for n= 3 it is achieved at other matrices containing one or more zero entries as well.     

Permanents of doubly stochastic matrices with fixed zero pattern

The doubly stochastic matrices with a given zero pattern which are closest in Euclidean norm to J_nn, the matrix with each entry equal to 1/n, are identified. If the permanent is restricted to matrices having a given zero pattern confined to one row or to one column, the permanent achieves a local minimum at those matrices with that zero pattern which are closest to J_nn. This need no longer be true if the zeros lie in more than one row or column.     

Matrices which commute with doubly stochastic matrices

The set doubly stochastic matrices which commute with the doubly stochastic matrices of any particular given rank is determined.     

Matrices which commute with doubly stochastic matrices

The set doubly stochastic matrices which commute with the doubly stochastic matrices of any particular given rank is determined.     

Faces of faces of the tridiagonal Birkhoff polytope

The tridiagonal Birkhoff polytope, , is the set of real square matrices with nonnegative entries and all rows and columns sums equal to 1 that are tridiagonal. This polytope arises in many problems of enumerative combinatorics, statistics, combinatorial optimization, etc. In this paper, for a given a p-face of , we determine the number of faces of lower dimension that are contained in it and we discuss its nature. In fact, a 2-face of is a triangle or a quadrilateral and the cells can only be tetrahedrons, pentahedrons or hexahedrons.     

An extension of the polytope of doubly stochastic matrices

We consider a class of matrices whose row and column sum vectors are majorized by given vectors b and c, and whose entries lie in the interval [0,?1]. This class generalizes the class of doubly stochastic matrices. We investigate the corresponding polytope Ω(b|c) of such matrices. Main results include a generalization of the Birkhoff–von Neumann theorem and a characterization of the faces, including edges, of Ω(b|c).     

Monotonicity of permanents of certain doubly stochastic circulant matrices

Let p_k(A), k=2,…,n, denote the sum of the permanents of all k×k submatrices of the n×n matrix A. A conjecture of Ðokovi?, which is stronger than the famed van der Waerden permanent conjecture, asserts that the functions p_k((1?θ)J_n+;θA), k=2,…, n, are strictly increasing in the interval 0?θ?1 for every doubly stochastic matrix A. Here J_n is the n×n matrix all whose entries are equal $\text{1}\text{n}$. In the present paper it is proved that the conjecture holds true for the circulant matrices A=αI_n+ βP_n, α, β?0, α+;β=1, and $\text{A=}\text{(nJ}{}_{\mathrm{n}}\text{?I}{}_{\mathrm{n}}\text{?P}{}_{\mathrm{n}}\text{)}\text{(n?2)}$, where I_n and P_n are respectively the n×n identify matrix and the n×n permutation matrix with 1's in positions (1,2), (2,3),…, (n?1, n), (n, 1).     

Even and odd diagonals in doubly stochastic matrices

The existence of even or odd diagonals in doubly stochastic matrices depends on the number of positive elements in the matrix. The optimal general lower bound in order to guarantee the existence of such diagonals is determined, as well as their minimal number for given number of positive elements. The results are related to the characterization of even doubly stochastic matrices in connection with Birkhoff's algorithm.     

Monotonicity of permanents of direct sums of doubly stochastic matrices

Let Ωn be the set of all n × n doubly stochastic matrices, let J_n be the n × n matrix all of whose entries are 1/n and let σ _k (A) denote the sum of the permanent of all k × k submatrices of A. It has been conjectured that if A ε Ω _n and A ≠ J_J then g_A,k (θ) ? σ _k ((1 θ)J_n 1 θA) is strictly increasing on [0,1] for k = 2,3,…,n. We show that if A = A ₁ ⊕ ⊕A_t (t ≥ 2) is an n × n matrix where A_i for i = 1,2, …,t, and if for each i g_Ai,ki (θ) is non-decreasing on [0.1] for k_t = 2,3,…,n_i , then g_A,k (θ) is strictly increasing on [0,1] for k = 2,3,…,n.     

On a Lie-theoretic approach to generalized doubly stochastic matrices and applications

In this article, we study generalized doubly stochastic matrices using the theory of Lie groups and Lie algebras. Applications to the inverse eigenvalue problem for symmetric doubly stochastic matrices are presented.     

On a Lie-theoretic approach to generalized doubly stochastic matrices and applications

In this article, we study generalized doubly stochastic matrices using the theory of Lie groups and Lie algebras. Applications to the inverse eigenvalue problem for symmetric doubly stochastic matrices are presented.     

Computing permanents via determinants for some classes of sparse matrices

Starting from recent formulas for calculating the permanents of some sparse circulant matrices, we obtain more general formulas expressing the permanents of a wider class of matrices as a linear combination of appropriate determinants.