scispace - formally typeset
Open AccessJournal ArticleDOI

Monotonicity of permanents of certain doubly stochastic circulant matrices

Reads0
Chats0
TLDR
In this paper, it was proved that the van der Waerden permanent conjecture holds true for the circulant matrices A=αIn+ βPn, α, β⩾0, α+;β=1, and A= (nJ n −I n −P n ) (n−2), where In and Pn are respectively the n×n identify matrix and the permutation matrix with 1's in positions (1,2), (2,3),…, (n −1, n), (n, 1
About
This article is published in Linear Algebra and its Applications.The article was published on 1981-04-01 and is currently open access. It has received 6 citations till now. The article focuses on the topics: Doubly stochastic matrix & Permutation matrix.

read more

Citations
More filters
Journal ArticleDOI

The Holens-Doković conjecture on permanents fails!

TL;DR: For (0, 1)-matrices with constant line sum k, this article showed that the Holens-Đokovic conjecture fails for bipartite graphs when k ≥ 2, k ≥ n − 2, i ≥ n/k + 1 or i ≥ 8.
Journal ArticleDOI

The monotonicity of and the Đoković conjectures on permanents of doubly stochastic matrices

TL;DR: In this paper, it was shown that if A is a positive Dk-minimizing matrix on Ωn, then Dk(A)=0 and A=Jn (k=2,…,n), and the monotonicity of the permanent for A = X Y U V ∈ω n for any AϵΩ n with n−1 identical rows.
Journal ArticleDOI

Monotonicity of permanents of direct sums of doubly stochastic matrices

TL;DR: In this paper, it was shown that if A = A 1 ⊕⊕At (t ≥ 2) is an n × n matrix where Ai for i = 1,2, …,t, and if for each i gAi,ki (θ) is non-decreasing on [0.1] for kt = 2,3,…,ni, then gA,k (ε,ε) is strictly increasing on [ 0,1], for k = 2.3,
Journal ArticleDOI

Combinatorial analysis (nonnegative matrices, algorithmic problems)

TL;DR: A survey of nonegative matrices and algorithmic problems of combinatorics can be found in this paper, which is also a continuation of a paper by the same authors.
Journal ArticleDOI

Notes on permanental and subpermanental inequalities

TL;DR: In this article, it was shown that the maximum of σk(tA + (1 − t)J n) on Sn for fixed t in [−1/(n − 1), 0) ∪ (0, 1] is achieved if and only if A is a permutation matrix (k = 2,3,…, n).