Preprint
Article

This version is not peer-reviewed.

A Solution to a Permanent Conjecture of Pate

Submitted:

27 September 2026

Posted:

29 September 2026

You are already at the latest version

Abstract
Let \( A=(a_{ij}) \) be an \( n\times n \) positive semidefinite Hermitian matrix and let \( A(i| j) \) be the submatrix obtained from \( A \) by deleting row \( i \) and column \( j \) of \( A \), where \( 1\leq i, j\le n \). We prove that, for all \( i \) and \( j \), \( \begin{split} &a_{ii}\ per A(i| i)-a_{ij}\ perA(i|j)-a_{ji}\ per A(j| i) +a_{jj}\ per A(j| j)\leq 2\ per A. \end{split} \) This inequality was first posed by Pate [10] and later stated as Conjecture 11 in Wanless’s survey article [11] on permanents.
Keywords: 
;  ;  ;  

1. Introduction

Let A = ( a i j ) be an n × n complex matrix. The permanent of A is defined by replacing the alternating signs in the determinant expansion with positive signs. Explicitly, per A = ∑ σ ∈ S n ∏ k = 1 n a k σ ( k ) , where S n denotes the symmetric group on { 1 , 2 , … , n } .
Permanent theory is an active area of research in matrix theory and combinatorics. Despite extensive study, many intriguing questions and long-standing conjectures remain open; see, e.g., [2,3,7,8,9,12].
We denote by M n ( C ) the set of all n × n complex matrices. For A ∈ M n ( C ) with n ≥ 2 , let A ( i | j ) be the submatrix obtained by deleting row i and column j of A, where 1 ≤ i , j ≤ n . Our main result is the following statement.
Theorem 1. 
Let A = ( a i j ) be an n × n positive semidefinite matrix. Then,
a i i per A ( i | i ) − a i j per A ( i | j ) − a j i per A ( j | i ) + a j j per A ( j | j ) ≤ 2 per A .
Inequality (1) appears as Conjecture 11 in Wanless’s article [11]. It originates from Pate’s article [10] as Inequality (3) (with i = 1 , j = 2 ), where Pate asks whether the inequality holds and remarks that it is “not likely to be easy.” We answer in the affirmative the question of Pate and Wanless.

2. A Lemma

We begin with the following lemma.
Lemma. 
Let J x , J y , and J z be self-adjoint operators on a finite-dimensional complex Hilbert space. Suppose that J x , J y , and J z satisfy, for some j ≥ 0 ,
[ J x , J y ] = − i J z , J x 2 + J y 2 + J z 2 = j ( j + 1 ) I .
(Here, [ ] denotes commutator.) Let M = j + 3 2 . Then, for any θ ∈ [ 0 , 1 ] ,
( J z + θ M I ) 2 + ( 1 − θ 2 ) J y 2 ⪰ θ 2 4 I .
(Here, ⪰ denotes the Loewner partial order.)
Proof. 
For an arbitrarily fixed unit vector ψ , we write
z = ∥ J z ψ ∥ 2 , η = ∥ J y ψ ∥ 2 , ξ = ∥ J x ψ ∥ 2 , μ = 〈 J z ψ , ψ 〉 .
The Cauchy–Schwarz inequality immediately yields two inequalities:
μ 2 = | μ | 2 = | 〈 J z ψ , ψ 〉 | 2 ≤ ∥ J z ψ ∥ 2 = z
and
| μ | = 〈 [ J x , J y ] ψ , ψ 〉 = 2 Im 〈 J x ψ , J y ψ 〉 ≤ 2 ξ η .
By (2), we obtain
ξ + z + η = j ( j + 1 ) .
Set C = ( j + 1 ) ( j + 2 ) = M 2 − 1 4 . Then, C − η ≥ 2 ( j + 1 ) > 0 as η ≤ j ( j + 1 ) .
To show (3), we evaluate the quadratic form of the left-hand side of (3) minus θ 2 4 I at ψ and express it as a quadratic function in θ :
q ( θ ) = z + η + 2 θ M μ + θ 2 ( C − η ) .
Thus, to show (3), or equivalently, q ( θ ) ≥ 0 , it suffices to show that
M 2 μ 2 ≤ ( z + η ) ( C − η ) .
Let R = ( z + η ) ( C − η ) . By (4), we see that (8) holds if R ≥ M 2 z .
We now show that (8) also holds for the case where R < M 2 z .
Note that R < M 2 z is ( z + η ) ( C − η ) < ( C + 1 4 ) z , which is equivalent to
z > η ( C − η ) η + 1 4 : = z 0 .
Define a linear function
Φ ( t ) = ( t + η ) ( C − η ) − 4 M 2 η j ( j + 1 ) − t − η .
Using (6), we have
Φ ( z ) = R − 4 M 2 η ξ .
Observe that Φ ′ ( t ) = C ( 1 + 4 η ) > 0 and that Φ ( t ) has the root
r = 4 M 2 η ( j ( j + 1 ) − η ) − η ( C − η ) C ( 1 + 4 η ) .
One checks by computation that z 0 − r = 2 η ( 2 j + 3 ) 2 ( 4 η + 1 ) ( j + 2 ) ≥ 0 . Thus, Φ ( z 0 ) ≥ Φ ( r ) = 0 . (One may also show directly that Φ ( z 0 ) = 2 η ( j + 1 ) ( 2 j + 3 ) 2 ≥ 0 .)
By (9), z > z 0 . So, Φ ( z ) > Φ ( z 0 ) ≥ 0 . By (5) and (10), we have
R − M 2 μ 2 ≥ R − 4 M 2 η ξ = Φ ( z ) > 0 ,
which proves (8) in the second case. This completes the proof. □

3. Symmetric Tensors and Creation Operators.

In this section, we establish a norm inequality for tensors with creation operators that will be used to prove our main result (Theorem 1). The inequality is also of interest in its own right.
We begin with some basic concepts in tensor theory. Let K be a finite-dimensional complex Hilbert space and let d be a nonnegative integer. The dth tensor power K ⊗ d , see, e.g., ([6] p. 141), is equipped with the inner product
〈 u 1 ⊗ … ⊗ u d , w 1 ⊗ … ⊗ w d 〉 = ∏ ℓ = 1 d 〈 u ℓ , w ℓ 〉
and the symmetrization operator
P d ( u 1 ⊗ … ⊗ u d ) = 1 d ! ∑ σ ∈ S d u σ ( 1 ) ⊗ … ⊗ u σ ( d )
is the orthogonal projection onto K ⊙ d ; see ([6] p. 153). We write u 1 ⊙ … ⊙ u d for the displayed symmetrized tensor and use the inner product inherited from K ⊗ d . We set K ⊗ 0 = K ⊙ 0 = C and P 0 = I C ; the empty symmetric product is 1. For w ∈ K and g ∈ K ⊙ d , define
w ⊙ g = P d + 1 ( w ⊗ g ) , c w * g = d + 1 w ⊙ g .
For d ≥ 1 , define c w : K ⊙ d → K ⊙ ( d − 1 ) as the adjoint of c w * : K ⊙ ( d − 1 ) → K ⊙ d , and set c w 1 = 0 . Thus, c w * raises the degree by one, whereas c w lowers it by one. We compose these operators on the algebraic direct sum
F alg ( K ) = ⨁ d ≥ 0 alg K ⊙ d ,
whose elements are finite sums of homogeneous symmetric tensors. Different degrees are orthogonal. Adjoints are taken between the corresponding homogeneous spaces.
To compute these operators, choose an orthonormal basis e 1 , … , e q of K . For a multi-index n = ( n 1 , … , n q ) with nonnegative integer entries, write | n | = n 1 + … + n q and n ! = n 1 ! … n q ! . When | n | = d , the symmetrization of e 1 ⊗ n 1 ⊗ … ⊗ e q ⊗ n q has d ! / n ! distinct, mutually orthogonal elementary tensors, each with coefficient n ! / d ! . Consequently,
e 1 ⊙ n 1 ⊙ … ⊙ e q ⊙ n q 2 = n ! d ! .
Different multi-indices give orthogonal tensors, and their span is K ⊙ d . An orthonormal basis is therefore given by
E n = d ! n ! e 1 ⊙ n 1 ⊙ … ⊙ e q ⊙ n q , | n | = d .
Here E 0 = 1 . If ε ℓ is the multi-index with a single 1 in position ℓ, the definition of c e ℓ * gives
c e ℓ * E n = d + 1 d ! n ! ( n + ε ℓ ) ! ( d + 1 ) ! E n + ε ℓ = n ℓ + 1 E n + ε ℓ .
Taking adjoints on successive degrees gives
c e ℓ E n = n ℓ E n − ε ℓ , n ℓ ≥ 1 , 0 , n ℓ = 0 .
For an arbitrary symmetric product of degree d ≥ 1 , they give
c w ( w 1 ⊙ … ⊙ w d ) = 1 d ∑ ℓ = 1 d 〈 w ℓ , w 〉 w 1 ⊙ … ⊙ w ℓ ^ ⊙ … ⊙ w d ,
where the hat denotes omission. Both sides are multilinear in w 1 , … , w d and conjugate-linear in w. It is therefore enough to check the formula when these vectors are basis vectors, in which case it follows from the preceding formulas.
Theorem 2. 
Let K be a finite-dimensional complex Hilbert space, let m be a nonnegative integer, let x , y ∈ K , and let f ∈ K ⊙ m . Then,
x ⊗ c y * f − y ⊗ c x * f 2 ≤ 2 c x * c y * f 2 .
The norm on the left is taken in K ⊗ K ⊙ ( m + 1 ) and the norm on the right in K ⊙ ( m + 2 ) .
Proof. 
Step 1. Reduction to an orthonormal pair. If x = 0 , y = 0 , or f = 0 , both sides of (12) vanish. Since w ↦ c w * is linear, replacing x , y by λ x , ν y multiplies both vectors in (12) by λ ν . We may therefore assume ∥ x ∥ = ∥ y ∥ = 1 . Multiplying y by a scalar of modulus one leaves both norms unchanged, so we may also assume
c = 〈 x , y 〉 ∈ [ 0 , 1 ] .
If c = 1 , then ∥ x − y ∥ 2 = 2 − 2 c = 0 , and the left side of (12) is zero. Suppose henceforth that c < 1 , and set
u = x + y 2 ( 1 + c ) , v = x − y 2 ( 1 − c ) , α = 1 + c 2 , β = 1 − c 2 .
The identities ∥ x + y ∥ 2 = 2 ( 1 + c ) , ∥ x − y ∥ 2 = 2 ( 1 − c ) , and
〈 x + y , x − y 〉 = ∥ x ∥ 2 − 〈 x , y 〉 + 〈 y , x 〉 − ∥ y ∥ 2 = 0
show that u , v are orthonormal. Solving for x , y gives
x = α u + β v , y = α u − β v .
Write
a * = c u * , b * = c v * , a = c u , b = c v , N 1 = a * a , N 2 = b * b , N = N 1 + N 2 .
Extend u , v to an orthonormal basis e 1 = u , e 2 = v , e 3 , … , e q of K . The preceding basis formulas give
a * a E n = n 1 E n , a a * E n = ( n 1 + 1 ) E n , b * b E n = n 2 E n , b b * E n = ( n 2 + 1 ) E n .
Operators acting on different coordinates commute. For example, a b * and b * a both send E n to n 1 ( n 2 + 1 ) E n − ε 1 + ε 2 when n 1 ≥ 1 , and both vanish when n 1 = 0 . The other mixed commutators are checked in the same way. Thus, with [ A , B ] = A B − B A ,
[ a , a * ] = [ b , b * ] = I , [ a , b ] = [ a , b * ] = [ a * , b ] = [ a * , b * ] = 0
on F alg ( K ) .
Step 2. Decomposition into eigenspaces of N. For each degree d, the operator N is diagonal in the basis above:
N E n = ( n 1 + n 2 ) E n .
For d ≥ 0 and 0 ≤ k ≤ d , let
H d , k = span { E n : | n | = d , n 1 + n 2 = k } .
This is the k-eigenspace of N on K ⊙ d . In particular,
K ⊙ m = ⨁ k = 0 m H m , k
is an orthogonal sum. We put H d , k = { 0 } when d < 0 , k < 0 , or k > d . The basis formulas show that
a * , b * : H d , k ⟶ H d + 1 , k + 1 , a , b : H d , k ⟶ H d − 1 , k − 1 ,
with annihilation equal to zero on degree 0. Since x , y belong to span { u , v } , (13) implies
c x * c y * H m , k ⊆ H m + 2 , k + 2 ,
and, for f k ∈ H m , k ,
x ⊗ c y * f k − y ⊗ c x * f k ∈ K ⊗ H m + 1 , k + 1 .
For distinct k, these target spaces are orthogonal on each side. Writing f = ∑ k = 0 m f k therefore gives
∥ c x * c y * f ∥ 2 = ∑ k = 0 m ∥ c x * c y * f k ∥ 2 , ∥ x ⊗ c y * f − y ⊗ c x * f ∥ 2 = ∑ k = 0 m ∥ x ⊗ c y * f k − y ⊗ c x * f k ∥ 2 .
It therefore suffices to prove (12) for f ∈ H m , k . We fix a nonzero space H m , k and work with a vector f satisfying
N f = k f , 0 ≤ k ≤ m .
Step 3. The two expressions in (12). By linearity and (13),
c x * = α a * + β b * , c y * = α a * − β b * .
The mixed terms cancel because a * b * = b * a * , and so
c x * c y * = α a * 2 − β b * 2 .
Expanding the tensor expression gives
x ⊗ c y * f − y ⊗ c x * f = 2 α β v ⊗ a * f − u ⊗ b * f .
The two tensors on the right are orthogonal because u ⊥ v . Moreover, (14) and (15) give
∥ a * f ∥ 2 + ∥ b * f ∥ 2 = 〈 ( a a * + b b * ) f , f 〉 = 〈 ( N 1 + N 2 + 2 I ) f , f 〉 = ( k + 2 ) ∥ f ∥ 2 .
It follows that
x ⊗ c y * f − y ⊗ c x * f 2 = 4 α β ( k + 2 ) ∥ f ∥ 2 .
Since α > 0 , we may put r = β / α ∈ [ 0 , 1 ] . Equation (16) reads c x * c y * = α ( a * 2 − r b * 2 ) . Thus, (12) for this f is equivalent to
( a * 2 − r b * 2 ) f 2 ≥ 2 r ( k + 2 ) ∥ f ∥ 2 .
Step 4. Calculation of Q * Q and Q Q * . Set
Q = a 2 − r b 2 , Q * = a * 2 − r b * 2 , L = N 1 − r N 2 , δ = 1 − r , Y = i ( a * b − b * a ) .
The operator Q lowers the degree by two, and Q * raises it by two. Both Q Q * and Q * Q preserve each homogeneous space and its N-eigenspaces. In particular, the maps
Q * : H m , k ⟶ H m + 2 , k + 2 , Q : H m + 2 , k + 2 ⟶ H m , k
are adjoints of one another. Hence,
∥ Q * f ∥ 2 = 〈 Q Q * f , f 〉 .
The basis formulas, including the cases n 1 = 0 , 1 , give
a * 2 a 2 = N 1 ( N 1 − I ) , a 2 a * 2 = ( N 1 + I ) ( N 1 + 2 I ) .
The corresponding identities with b , N 2 in place of a , N 1 also hold. Thus,
[ a 2 , a * 2 ] = 4 N 1 + 2 I , [ b 2 , b * 2 ] = 4 N 2 + 2 I .
To calculate Y 2 , write U = a * b and V = b * a . The mixed commutation relations give
U 2 = a * 2 b 2 , V 2 = b * 2 a 2 , U V = a * b b * a = N 1 ( N 2 + I ) , V U = b * a a * b = N 2 ( N 1 + I ) .
Therefore
Y 2 = − ( U − V ) 2 = − U 2 − V 2 + U V + V U = − a * 2 b 2 − b * 2 a 2 + 2 N 1 N 2 + N 1 + N 2 .
Expanding Q * Q and substituting the preceding formula yields
Q * Q = N 1 ( N 1 − I ) + r 2 N 2 ( N 2 − I ) − r ( a * 2 b 2 + b * 2 a 2 ) = N 1 2 + r 2 N 2 2 − 2 r N 1 N 2 + r Y 2 − ( 1 + r ) N 1 − r ( 1 + r ) N 2 .
Since N 1 N 2 = N 2 N 1 , this is
Q * Q = L 2 + r Y 2 − ( 1 + r ) ( N 1 + r N 2 ) .
Also, [ a 2 , b * 2 ] = [ b 2 , a * 2 ] = 0 , so
[ Q , Q * ] = [ a 2 , a * 2 ] + r 2 [ b 2 , b * 2 ] .
Consequently,
Q Q * = Q * Q + 4 N 1 + 4 r 2 N 2 + 2 ( 1 + r 2 ) I .
On H m , k , the equality N 1 + N 2 = k I and (19)–(20) give
Q Q * − 2 r ( k + 2 ) I = L 2 + r Y 2 + 3 ( 1 − r ) N 1 − 3 r ( 1 − r ) N 2 + 2 ( 1 − r ) 2 I = L 2 + 3 δ L + 2 δ 2 I + r Y 2 .
Factoring the polynomial in L gives
Q Q * − 2 r ( k + 2 ) I = ( L + δ I ) ( L + 2 δ I ) + r Y 2
on H m , k .
Step 5. The operators J x , J y , J z . On the finite-dimensional space H m , k , define
j = k 2 , J z = N 1 − N 2 2 , J x = U + V 2 , J y = i ( U − V ) 2 = Y 2 .
The operators N 1 , N 2 preserve H m , k . So do U = a * b and V = b * a : they transfer one factor from the v-direction to the u-direction, or conversely, without changing either the total degree or n 1 + n 2 . Their restrictions satisfy U * = V . Since N 1 , N 2 are also self-adjoint on H m , k , so are J x , J y , J z .
The formulas for U V and V U above give
[ U , V ] = N 1 − N 2 .
It follows that
[ J x , J y ] = i 4 [ U + V , U − V ] = − i 2 [ U , V ] = − i J z .
Furthermore,
J x 2 + J y 2 = 1 4 ( U + V ) 2 − ( U − V ) 2 = 1 2 ( U V + V U ) = N 1 N 2 + N 1 + N 2 2 .
Adding J z 2 yields
J x 2 + J y 2 + J z 2 = N 1 N 2 + N 1 + N 2 2 + ( N 1 − N 2 ) 2 4 = ( N 1 + N 2 ) 2 4 + N 1 + N 2 2 = k ( k + 2 ) 4 I .
Since j = k / 2 , we have proved
J x 2 + J y 2 + J z 2 = j ( j + 1 ) I .
Thus, J x , J y , J z satisfy the hypotheses of the lemma in Section 2.
Step 6. Application of the lemma. Put
s = 1 + r > 0 , θ = 1 − r 1 + r = δ s .
Since 0 ≤ r ≤ 1 , we have 0 ≤ θ ≤ 1 , and
s 2 ( 1 − θ 2 ) = ( 1 + r ) 2 − ( 1 − r ) 2 = 4 r .
On H m , k , the relations N 1 + N 2 = 2 j I and N 1 − N 2 = 2 J z give
N 1 = j I + J z , N 2 = j I − J z , L = s J z + δ j I .
Consequently,
( L + δ I ) ( L + 2 δ I ) = s 2 J z + θ ( j + 1 ) I J z + θ ( j + 2 ) I = s 2 J z + θ j + 3 2 I 2 − θ 2 4 I .
Also r Y 2 = 4 r J y 2 = s 2 ( 1 − θ 2 ) J y 2 . Substituting both identities into (21) gives
Q Q * − 2 r ( k + 2 ) I = s 2 ( J z + θ j + 3 2 I 2 + ( 1 − θ 2 ) J y 2 − θ 2 4 I ) .
By our lemma, the operator in parentheses is positive semidefinite. Therefore
∥ ( a * 2 − r b * 2 ) f ∥ 2 = ∥ Q * f ∥ 2 = 〈 Q Q * f , f 〉 ≥ 2 r ( k + 2 ) ∥ f ∥ 2 ,
which proves (18). Returning to (16) and (17), we obtain
2 ∥ c x * c y * f ∥ 2 = 2 α 2 ∥ Q * f ∥ 2 ≥ 4 α 2 r ( k + 2 ) ∥ f ∥ 2 = 4 α β ( k + 2 ) ∥ f ∥ 2 = ∥ x ⊗ c y * f − y ⊗ c x * f ∥ 2 .
This proves (12) on each H m , k . Summing over the orthogonal components from Step 2 proves it for arbitrary f ∈ K ⊙ m . The argument includes m = 0 , for which K ⊙ 0 = H 0 , 0 = C . □

4. Proof of Theorem 1

For A = ( a i j ) ∈ M n ( C ) , set
C 1 ( A ) = a i j per A ( i ∣ j ) i , j = 1 n .
We are now ready to prove our main result.
Proof of Theorem 1. 
If i = j , the left-hand side of (1) is zero, and per A ≥ 0 , as also follows from (27) below. We may therefore assume i ≠ j . A simultaneous permutation of rows and columns reduces the proof to the case with i = 1 and j = 2 . Choose vectors v 1 , … , v n in a finite-dimensional complex Hilbert space K such that a p q = 〈 v p , v q 〉 . The relation between symmetric tensors and permanents [5], with the normalization used here, is
u 1 ⊙ … ⊙ u d , w 1 ⊙ … ⊙ w d = 1 d ! per 〈 u p , w q 〉 p , q = 1 d .
For 1 ≤ p ≤ n , put q p = ⨀ ℓ ≠ p v ℓ and z p = v p ⊗ q p . It follows that
〈 z p , z q 〉 = a p q per A ( p | q ) ( n − 1 ) ! .
Thus, C 1 ( A ) is ( n − 1 ) ! times the Gram matrix of z 1 , … , z n .
Set m = n − 2 , x = v 1 , y = v 2 , and f = v 3 ⊙ … ⊙ v n ∈ K ⊙ m , with f = 1 when n = 2 . Since
q 1 = c y * f m + 1 , q 2 = c x * f m + 1 ,
equation (25) gives
( e 1 − e 2 ) * C 1 ( A ) ( e 1 − e 2 ) = m ! x ⊗ c y * f − y ⊗ c x * f 2 ,
where e 1 − e 2 = ( 1 , − 1 , 0 , … , 0 ) T ∈ R n .
Also, (24) and the definition of the creation operators give
per A = n ! ∥ v 1 ⊙ … ⊙ v n ∥ 2 = m ! ∥ c x * c y * f ∥ 2 .
Combining (26) and (27) with Theorem 2 proves (1) in Theorem 1. □

5. Further Discussions

A closely related statement, stronger than inequality (1), is Bapat and Sunder’s Conjecture 3 in [1] (1986). In his study of Bapat and Sunder’s conjecture by means of permanent functions and compound matrices, Pate [10] (2008) showed that
〈 C k ( A ) x , x 〉 ≤ ∥ x ∥ 2 per A
for every positive semidefinite Hermitian matrix A and every ( 0 , 1 ) -vector x, where
C k ( A ) = per A [ α ∣ β ] per A ( α ∣ β ) α , β .
Here α and β range over the k-element subsets of { 1 , … , n } , listed in lexicographic order. The matrix A [ α ∣ β ] has rows indexed by α and columns indexed by β , and A ( α ∣ β ) = A [ α c ∣ β c ] . Pate also indicated that Bapat and Sunder’s conjecture would imply inequality (1).
Drury [4] (2018) gave a negative answer to Bapat and Sunder’s conjecture by providing a counterexample. However, Pate’s question, namely whether inequality (1) holds, was left open in [10]. It is answered here by Theorem 1.
Question. 
Pate showed that
〈 C k ( A ) x , x 〉 ≤ ∥ x ∥ 2 per A
if x is a ( 0 , 1 ) -vector. Is it true that
〈 C k ( A ) x , x 〉 ≤ ∥ x ∥ 2 per A
for x = e 1 − e 2 and every k with 2 ≤ k ≤ n − 1 ? Here e 1 , e 2 are the first two standard basis vectors of C n k .
The answer is negative. We provide a family of counterexamples for k = 5 .
For t > 0 , let
A t = X t * X t , w h e r e X t = 0 0 i i 1 1 1 1 t t 1 1 t t 1 − 1 0 0 i i .
The columns come from the three orthogonal pairs
0 1 , 1 0 , i t , t i , 1 1 , 1 − 1 .
Each vector in the first two pairs occurs twice, and each vector in the third pair occurs once. Thus, A t is positive semidefinite of rank two; indeed, X t X t * = ( 6 + 2 t 2 ) I 2 .
The first two 5-subsets in lexicographic order are
α = { 1 , 2 , 3 , 4 , 5 } , β = { 1 , 2 , 3 , 4 , 6 } .
Put q = t 2 and
a = 6 q 2 + 6 q + 1 , b = 4 q ( q + 1 ) ( 2 q + 1 ) 2 , c = 20 ( 3 q 4 + 3 q 3 + 5 q 2 + 3 q + 3 ) .
A direct calculation gives
per A t = ( 4 ! ) 2 c , C 5 ( A t ) [ { α , β } ∣ { α , β } ] = ( 4 ! ) 2 a 2 − b − b a 2 .
Therefore, for x = e 1 − e 2 ∈ C 10 5 ,
x * C 5 ( A t ) x − 2 per A t = 2 ( 4 ! ) 2 ( a 2 + b − c ) .
The sign follows from the identity
a 2 + b − c = − 8 q 4 + 44 q 3 − 32 q 2 − 44 q − 59 = 21 + 40 ( 4 − q ) + 4 ( q − 3 ) ( 4 − q ) ( 2 q 2 + 3 q + 5 ) .
All terms in the last line are nonnegative when 3 ≤ q ≤ 4 , and the first is 21. Hence, every t ∈ [ 3 , 2 ] gives a counterexample. For instance, t = 2 gives
x * C 5 ( A 2 ) x ∥ x ∥ 2 per A 2 = 21121 21100 > 1 .

References

  1. Bapat, R. B.; Sunder, V. S. An extremal property of the permanent and the determinant. Linear Algebra Appl. 1986, 76, 153–163. [Google Scholar] [CrossRef]
  2. Brualdi, R. A.; Ryser, H. J. The Permanent, in Combinatorial Matrix Theory; Cambridge University Press, 1991; p. 198-–249. [Google Scholar]
  3. Cheon, G.-S.; Wanless, I.-M. An update on Minc’s survey of open problems involving permanents. Linear Algebra Appl. 2005, 403, 314–342. [Google Scholar] [CrossRef]
  4. Drury, S. W. A counterexample to a question of Bapat and Sunder. Math. Inequal. Appl. 2018, 21(no. 2), 517–520. [Google Scholar] [CrossRef]
  5. Marcus, M.; Newman, M. The permanent function as an inner product . Bull. Amer. Math. Soc. 1961, 67(no. 2), 223–224. [Google Scholar] [CrossRef]
  6. Merris, R. Multilinear Algebra, Gordon & Breach; Amsterdam, 1997. [Google Scholar]
  7. Minc, H. Theory of permanents 1982-1985. In Linear Multilinear Algebra; 1987; Volume 21, pp. 109–148. [Google Scholar]
  8. Minc, H. Theory of permanents 1978-1981. Linear Multilinear Algebra 1983, 12, 227–263. [Google Scholar] [CrossRef]
  9. Minc, H. Permanents; Addison-Wesley: New York, 1978. [Google Scholar]
  10. Pate, T. H. On permanental compounds . Linear Algebra Appl. 2008, 429(no. 5–6), 1093–1101. [Google Scholar] [CrossRef]
  11. Wanless, I. M. Lieb’s Permanental Dominance Conjecture. In The Physics and Mathematics of Elliott Lieb; Frank, R. L., Laptev, A., Lewin, M., Seiringer, R., Eds.; EMS Press: Berlin, 2022; Vol. 2, p. 501-–516. [Google Scholar]
  12. Zhang, F. An update on a few permanent conjectures . Spec. Matrices 2016, 4(no. 1), 305–-316. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.