A divided difference inequality for n-convex functions

For a₍₁₎ ? a₍₂₎ ? ··· ? a_(n) ? 0, b₍₁₎ ? b₍₂₎ ? ··· ? b_(n) ? 0, the ordered values of a_i, b_i, i = 1, 2,…, n, m fixed, m ? n, and p ? 1 it is shown that

$\text{∑}\text{1}\text{n}\text{a}{}_{\mathrm{i}}\text{b}{}_{\mathrm{i}}\text{?}\text{∑}\text{1}\text{m}\text{a}{}^{\mathrm{p}}{}_{\mathrm{(i)}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}\text{∑}\text{1}\text{m?k?1}\text{b}{}^{\mathrm{q}}{}_{\mathrm{(i)}}\text{+}\text{b}{}^{\mathrm{q}}{}_{\mathrm{[m?k]}}\text{(k+1)}{}^{\mathrm{<mtext>q</mtext><mtext>p</mtext>}}{}^{\mathrm{<mtext>1</mtext><mtext>q</mtext>}}$

where $\text{1}\text{p}\text{+}\text{1}\text{q}\text{= 1, b}{}_{\mathrm{[j]}}\text{= b}{}_{\mathrm{(j)}}\text{+ b}{}_{\mathrm{(j\; +\; 1)}}\text{+ ··· + b}{}_{\mathrm{(n)}}\text{,}\text{and}\text{k}$ is the integer such that $\text{b}{}_{\mathrm{(m\; ?\; k\; ?\; 1)}}\text{?}\text{b[m ? k]}\text{(k + 1)}$ and $\text{b}{}_{\mathrm{(m\; ?\; k)}}\text{<}\text{b}{}_{\mathrm{[m\; ?\; k\; +\; 1]}}\text{k}$. The inequality is shown to be sharp. When p < 1 and a_(i)'s are in increasing order then the inequality is reversed.     

Construction of a recurrence relation for modified moments

In this paper we are constructing a recurrence relation of the form

$\text{∑}\text{i=0}\text{r}\text{ω}{}_{\mathrm{i}}\text{(k)m}{}_{\mathrm{k+i}}{}^{\mathrm{\{\lambda \}}}\text{[f] = ω(k)}$

for integrals (called modified moments)

$\text{m}{}_{\mathrm{k}}{}^{\mathrm{\{\lambda \}}}\text{[f]df=}\text{∫}\text{?1}\text{1}\text{f(x)C}{}_{\mathrm{k}}{}^{\mathrm{(\lambda )}}\text{(x)dx (k = 0,1,…)}$

in which C_k^(λ) is the k-th Gegenbauer polynomial of order $\text{λ(λ > ?}\text{1}\text{2}\text{)}$, and f is a function satisfying the differential equation

$\text{∑}\text{i=0}\text{n}\text{P}{}_{\mathrm{i}}\text{(x)f}{}^{\mathrm{(i)}}\text{(x) = p(x) (?1?x?1)}$

of order n, where p₀, p₁, …, p_n ? 0 are polynomials, and m_k^〈λ〉[p] is known for every k. We give three methods of construction of such a recurrence relation. The first of them (called Method I) is optimum in a certain sense.     

On the length of optimal TSP circuits in sets of bounded diameter

Let V be a set of n points in R^k. Let d(V) denote the diameter of V, and l(V) denote the length of the shortest circuit which passes through all the points of V. (Such a circuit is an “optimal TSP circuit”.) l^k(n) are the extremal values of l(V) defined by l^k(n)=max{l(V)|V∈V_n^k}, where V_n^k={V|V?R^k,|V|=n, d(V)=1}. A set V∈V_n^k is “longest” if l(V)=l^k(n). In this paper, first some geometrical properties of longest sets in R² are studied which are used to obtain l²(n) for small n′s, and then asymptotic bounds on l^k(n) are derived. Let δ(V) denote the minimal distance between a pair of points in V, and let: δ^k(n)=max{δ(V)|V∈V_n^k}. It is easily observed that $\text{δ}{}^{\mathrm{k}}\text{(n)=O(n}{}^{\mathrm{<mtext>?1</mtext><mtext>k</mtext>}}\text{)}$. Hence, $\text{c}{}_{\mathrm{k}}\text{=}\text{lim sup}{}_{\mathrm{n\to \infty }}\text{δ}{}^{\mathrm{k}}\text{(n)n}{}^{\mathrm{<mtext>1</mtext><mtext>k</mtext>}}$ exists. It is shown that for all $\text{n, c}{}_{\mathrm{k}}\text{n}{}^{\mathrm{<mtext>?1</mtext><mtext>k</mtext>}}\text{≤δ}{}^{\mathrm{k}}\text{(n)}$, and hence, for all $\text{n, l}{}^{\mathrm{k}}\text{(n)≥ c}{}_{\mathrm{k}}\text{n}{}^{\mathrm{<mtext>1?1</mtext><mtext>k</mtext>}}$. For k=2, this implies that $\text{l}{}^2\text{(n)≥(}\text{π}{}^2\text{12}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>4</mtext>}}\text{n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$, which generalizes an observation of Fejes-Toth that $\text{lim}{}_{\mathrm{n\to \infty }}\text{l}{}^2\text{(n)n}{}^{\mathrm{<mtext>?1</mtext><mtext>2</mtext>}}\text{≥(}\text{π}{}^2\text{12}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>4</mtext>}}$. It is also shown that $\text{l}{}^{\mathrm{k}}\text{(n) ≤ [}\text{(3?√3)k}\text{(k?1)}\text{]nδ}{}^{\mathrm{k}}\text{(n) + o(n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{) ≤ [}\text{(3?√3)k}\text{(k?1)}\text{]n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{+ o(n}{}^{\mathrm{<mtext>1?</mtext><mtext>1</mtext><mtext>k</mtext>}}\text{)}$. The above upper bound is used to improve related results on longest sets in k-dimensional unit cubes obtained by Few (Mathematika2 (1955), 141–144) for almost all k′s. For k=2, Few's technique is used to show that $\text{l}{}^2\text{(n)≤(}\text{πn}\text{2}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{+ O(1)}$.     

Patterns of power residues

This paper examines the question of whether a given pattern

$\text{x,x+a}{}_1\text{,…,x+a}{}_{\mathrm{m?1}}$

of kth power residues of length m can be postponed indefinitely. This is the case when there exists a prime q, called a delay prime, which does not contain this pattern even if q itself is considered as a kth power residue. It is conjectured that if there exists no delay prime then there exists a finite limit

$\text{Λ=Λ (k,m;a}{}_1\text{,…,a}{}_{\mathrm{m?1}}$

for which the corresponding pattern will occur before Λ in every sufficiently large prime of the form kn + 1.     

Abstract multiparameter theory,I

In this paper we continue our investigation of multiparameter spectral theory. Let H₁,…, H_k be separable Hilbert spaces and H = ?_{r = 1}^kH_r, be their tensor product. In each space H_r we have densely defined self-adjoint operators T_r and continuous Hermitian operators V_rs. The multiparameter eigenvalue problem concerns eigenvalues λ = (λ₁,…, λ_n) ?R^k and eigenvectors $\text{? = ?}{}_1\text{? ··· ? ?}{}_{\mathrm{k}}\text{? H}$ such that $\text{T}{}_{\mathrm{r}}\text{?}{}_{\mathrm{r}}\text{+ ∑}{}_{\mathrm{s\; =\; 1}}{}^{\mathrm{k}}\text{λ}{}_{\mathrm{s}}\text{V}{}_{\mathrm{rs}}\text{?}{}_{\mathrm{r}}\text{= 0}$. We develop a spectral theory for such systems leading to a Parseval equality and generalized eigenvector expansion. The results are applied to a k × k system of linked secondorder differential equations.     

Convex polyhedra of doubly stochastic matrices. I. Applications of the permanent function

The permanent function is used to determine geometrical properties of the set $\text{Ω}{}_{\mathrm{n}}$ of all n × n nonnegative doubly stochastic matrices. If $\text{F}$ is a face of $\text{Ω}{}_{\mathrm{n}}$, then $\text{F}$ corresponds to an n × n (0, 1)-matrix A, where the permanent of A is the number of vertices of $\text{F}$. If A is fully indecomposable, then the dimension of $\text{F}$ equals σ(A) ? 2n + 1, where σ(A) is the number of 1's in A. The only two-dimensional faces of $\text{Ω}{}_{\mathrm{n}}$ are triangles and rectangles. For n ? 6, $\text{Ω}{}_{\mathrm{n}}$ has four types of three-dimensional faces. The facets of the faces of $\text{Ω}{}_{\mathrm{n}}$ are characterized. Faces of $\text{Ω}{}_{\mathrm{n}}$ which are simplices are determined. If $\text{F}$ is a face of $\text{Ω}{}_{\mathrm{n}}$ which is two-neighborly but not a simplex, then $\text{F}$ has dimension 4 and six vertices. All k-dimensional faces with k + 2 vertices are determined. The maximum number of vertices of a k-dimensional face is 2^k. All k-dimensional faces with at least 2^k?1 + 1 vertices are determined.     

Votes and a half-binomial

In two party elections with popular vote ratio $\text{p}\text{q}\text{,}\text{1}\text{2}\text{≤p=1 ?q}$, a theoretical model suggests replacing the so-called MacMahon cube law approximation $\text{(}\text{p}\text{q}\text{)}{}^3$, for the ratio $\text{P}\text{Q}$ of candidates elected, by the ratio $\text{?}{}_{\mathrm{k}}\text{(p)}\text{?}{}_{\mathrm{k}}\text{(q)}$ of the two half sums in the binomial expansion of (p+q)^2k+1 for some k. This ratio is nearly $\text{(}\text{p}\text{q}\text{)}{}^3$ when k = 6. The success probability $\text{g}{}_{\mathrm{k}}\text{(p)=(}\text{p}{}^{\mathrm{a}}\text{(p}{}^{\mathrm{a}}\text{+q}{}^{\mathrm{a}}\text{)}$ for the power law $\text{(}\text{p}\text{q}\text{)}{}^{\mathrm{a}}\text{?}\text{P}\text{Q}$ is shown to so closely approximate $\text{?}{}_{\mathrm{k}}\text{(p)=Σ}{}_0{}^{\mathrm{k}}\text{(}{}_{\mathrm{r}}{}^{\mathrm{2k+1}}\text{)p}{}^{\mathrm{2k+1?r}}\text{q}{}^{\mathrm{r}}$, if we choose $\text{a = a}{}_{\mathrm{k}}\text{=}\text{(2k+1)!}\text{4}{}^{\mathrm{k}}\text{k!k!}$, that $\text{1≤}\text{?}{}_{\mathrm{k}}\text{(p)}\text{g}{}_{\mathrm{k}}\text{(p)}\text{≤1.01884086}$ for $\text{k≥1}\text{if}\text{1}\text{2}\text{≤p≤1}$. Computationally, we avoid large binomial coefficients in computing $\text{?}{}_{\mathrm{k}}\text{(p)}$ for k>22 by expressing $\text{2?}{}_{\mathrm{k}}\text{(p)?1}$ as the sum $\text{(p?q) Σ}{}_0{}^{\mathrm{k}}\text{(4pq)}{}^{\mathrm{s}}\text{a}{}_{\mathrm{s}}\text{(2s+1)}$, whose terms decrease by the factors $\text{(4pq)(1?}\text{1}\text{2s}\text{)}$. Setting K = 4k+3, we compute a_k for the large k using a continued fraction $\text{πa}{}_{\mathrm{k}}{}^2\text{=}\text{K+1}{}^2\text{(}\text{2K+3}{}^2\text{(}\text{2K+5}{}^2\text{(2K+…)}\text{)}\text{)}$ derived from the ratio of π to the finite Wallis product approximation.     

Estimées Ck pour les couronnes de convexes de type fini de Cn

C^k estimates for convex domains of finite type in $\text{C}{}^{\mathrm{n}}$ are known from Alexandre (C. R. Acad. Paris, Ser. I 335 (2002) 23–26). We now want to show the same result for annuli. Precisely, we show that for all convex domains D and D′ relatively compact of $\text{C}{}^{\mathrm{n}}$, of finite type m and m′ such that $\text{D}\text{?D′}$, for all q=1,…,n?2, there exists a linear operator $\text{T}{}^1{}_{\mathrm{q}}$ from $\text{C}{}_{\mathrm{0,q}}\text{(}\text{D′?D}\text{)}$ to $\text{C}{}_{\mathrm{0,q?1}}\text{(}\text{D′?D}\text{)}$ such that for all $\text{k∈}\text{N}$ and all (0,q)-form f, $\text{?}\text{?}$-closed of regularity C^k up to the boundary, $\text{T}{}^1{}_{\mathrm{q}}\text{f}$ is of regularity C^{k+1/max(m,m′)} up to the boundary and $\text{?}\text{?}\text{T}{}_{\mathrm{q}}{}^1\text{f=f}$. We fit the method of Diederich, Fisher and Fornaess to the annuli by switching z and ζ. However, the integration kernel will not have the same behavior on the frontier as in the Diederich–Fischer–Fornaess case and we have to alter the Diederich–Fornaess support function which will not be holomorphic anymore. Also, we take care of the so generated residual term in the homotopy formula and show that it is extremely regular so that solve the $\text{?}\text{?}$ problem for it will not be difficult. To cite this article: W. Alexandre, C. R. Acad. Sci. Paris, Ser. I 336 (2003).     

On the probability that k positive integers are relatively prime II

Given a set S of positive integers let $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t)}$ denote the number of k-tuples 〈m₁, …, m_k〉 for which $\text{m}{}_{\mathrm{i}}\text{∈ S ? [1, t]}$ and (m₁, …, m_k) = 1. Also let $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n)}$ denote the probability that k integers, chosen at random from $\text{S ? [1, n]}$, are relatively prime. It is shown that if P = {p₁, …, p_r} is a finite set of primes and S = {m : (m, p₁ … p_r) = 1}, then $\text{Z}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(t) = (td(S))}{}^{\mathrm{k}}\text{Π}{}_{\mathrm{\nu ?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) + O(t}{}^{\mathrm{k?1}}\text{)}$ if k ≥ 3 and $\text{Z}{}_2{}^{\mathrm{S}}\text{(t) = (td(S))}{}^2\text{Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^2\text{) + O(t}\text{log}\text{t)}$ where d(S) denotes the natural density of S. From this result it follows immediately that $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → Π}{}_{\mathrm{p?P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{) = (ζ(k))}{}^{\mathrm{?1}}\text{Π}{}_{\mathrm{p\in P}}\text{(1 ?}\text{1}\text{p}{}^{\mathrm{k}}\text{)}{}^{\mathrm{?1}}$ as n → ∞. This result generalizes an earlier result of the author's where $\text{P = ?}$ and S is then the whole set of positive integers. It is also shown that if S = {p₁^x₁ … p_r^x_r : x_i = 0, 1, 2,…}, then $\text{P}{}_{\mathrm{k}}{}^{\mathrm{S}}\text{(n) → 0}$ as n → ∞.     

On the qth convergence exponent of entire functions

In this paper we obtain a growth relation for entire functions of qth order with respect to the distribution of its zeros. We also derive certain relations between the qth convergence exponents of two or more entire functions. The most striking result of the paper is: If f(z) has at least one zero, then

$\text{lim sup}\text{r→∞}\text{log n}\text{(r)}\text{log}{}^{\mathrm{[q+1]}}{}_{\mathrm{r}}\text{=?(q)}$

, where n(r) is the number of zeros of f(z) in $\text{¦}\text{z}\text{¦ ? r}$ and

$\text{?(q)=g.l.b.}\text{α:α>0 and}\text{∑}\text{∞}\text{n=1}\text{(log}{}^{\mathrm{[q]}}\text{r}{}_{\mathrm{n}}\text{)}{}^{\mathrm{-\alpha }}\text{<∞}$

.     

A partition identity

Let n₁+n₂+?+n_m=n where the n_i's are integers (possibly negative or greater than n). Let p=(k₁,…,k_m), where k₁+k₂+?+k_m=k, be a partition of the nonnegative integer k into m nonnegative integers and let P denote the set of all such partitions. For m?2, we prove the combinatorial identity

$\text{∑}\text{p∈P}\text{∏}\text{i=1}\text{m}\text{n}{}_{\mathrm{i}}\text{+1?k}{}_{\mathrm{i}}\text{k}{}_{\mathrm{i}}\text{=}\text{∑}\text{i?0}\text{j+m?2}\text{m?2}\text{n+1?k?2}{}_{\mathrm{j}}\text{k?2}{}_{\mathrm{j}}$

which implies the surprising result that the left side of the above equation depends on n but not on the n_i's.     

Size Ramsey numbers involving stars

We calculate some size Ramsey numbers involving stars. For example we prove that for t ? k ? 2 and n sufficiently large the size Ramsey number.

$\text{r}{}_{\mathrm{n}}\text{(K}{}_{\mathrm{1,k}}\text{K}{}_{\mathrm{t}}\text{+}\text{K}{}_{\mathrm{n}}\text{=}\text{k(t?1)+1}\text{2}\text{+(k(t?1)+1)(n+k?1).}$

     

Square roots of elliptic operators

Consider an elliptic sesquilinear form defined on $\text{V}$ × $\text{V}$ by $\text{J[u, v] = ∫}{}_{\mathrm{\Omega }}\text{a}{}_{\mathrm{jk}}\text{?u}\text{?x}{}_{\mathrm{k}}\text{}\text{?}\text{t6v}\text{?x}{}_{\mathrm{j}}\text{+ a}{}_{\mathrm{k}}\text{?u}\text{?x}{}_{\mathrm{k}}\text{v}\text{?}\text{+ α}{}_{\mathrm{j}}\text{u}\text{}\text{?}\text{t6v}\text{?x}{}_{\mathrm{j}}\text{+ au}\text{v}\text{?}\text{dx}$, where $\text{V}$ is a closed subspace of $\text{H}{}^1\text{(Ω)}$ which contains $\text{C}{}_0{}^{\mathrm{\infty }}\text{(Ω)}$, Ω is a bounded Lipschitz domain in $\text{R}$ⁿ, $\text{a}{}_{\mathrm{jk}}\text{, a}{}_{\mathrm{k}}\text{, α}{}_{\mathrm{j}}\text{, a ? L}{}_{\mathrm{\infty }}\text{(Ω),}\text{and Re}\text{a}{}_{\mathrm{jk}}\text{ζ}{}_{\mathrm{k}}\text{ζ}{}_{\mathrm{j}}\text{? κ > 0}$ for all ζ?$\text{C}$ⁿ with ¦ζ¦ = 1. Let L be the operator with largest domain satisfying J[u, v] = (Lu, v) for all υ∈$\text{V}$. Then L + λI is a maximal accretive operator in $\text{L}{}_2\text{(Ω)}$ for λ a sufficiently large real number. It is proved that $\text{(L + λI)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$ is a bounded operator from $\text{V}$ to $\text{L}{}_2\text{(Ω)}$ provided mild regularity of the coefficients is assumed. In addition it is shown that if the coefficients depend differentiably on a parameter t in an appropriate sense, then the corresponding square root operators also depend differentiably on t. The latter result is new even when the forms J are hermitian.     

Connected matroids with the smallest whitney numbers

In “The Slimmest Geometric Lattices” (Trans. Amer. Math. Soc.). Dowling and Wilson showed that if G is a combinatorial geometry of rank r(G) = n, and if _X(G) = Σμ(0, x)λ^{r ? r(x)} = Σ (?1)^{r ? k}W_kλ^k is the characteristic polynomial of G, then

$\text{w}{}_{\mathrm{k}}\text{?}\text{r}\text{k}\text{+n}\text{r?1}\text{k}$

Thus γ(G) ? 2^{r ? 1} (n+2), where γ(G) = Σw_k. In this paper we sharpen these lower bounds for connected geometries: If G is connected, r(G) ? 3, and n(G) ? 2 ((r, n) ≠ (4,3)), then

$\text{w}{}_{\mathrm{i}}\text{?}\text{r}\text{i}\text{+ n}\text{r}\text{i+1}\text{for i>1; w}{}_1\text{?r+n}\text{r}\text{2}\text{? 1;}$

|μ| ? (r? 1)n; and γ ? (2^{r ? 1} ? 1)(2n + 2). These bounds are all achieved for the parallel connection of an r-point circuit and an (n + 1)point line. If G is any series-parallel network, $\text{r(G) = r(}\text{G}\text{?}\text{) = 4}$, and $\text{n(G) = n(}\text{G}\text{?}\text{) = 3}$ then $\text{(w}{}_1\text{(G))}{}^4{}_{\mathrm{t-G}}\text{? (w}{}_1\text{(}\text{G}\text{?}\text{)) = (8, 20, 18, 7, 1)}$. Further, if β is the Crapo invariant,

$\text{β(G)=}\text{d}{}_{\mathrm{X}}\text{(G)}\text{dλ}\text{(1)}\text{,}$

then β(G) ? max(1, n ? r + 2). This lower bound is achieved by the parallel connection of a line and a maximal size series-parallel network.     

Multiplicativity of lp norms for matrices. II

For 1 ? p ? ∞, let

$\text{|A|}{}_{\mathrm{p}}\text{=}\text{Σ}\text{i=1}\text{m}\text{Σ}\text{j=1}\text{n}\text{, |α}{}_{\mathrm{ij}}\text{|}{}^{\mathrm{p}}{}^{\mathrm{<mtext>1</mtext><mtext>p</mtext>}}$

, be the l_p norm of an m × n complex A = (α_ij) ?C_{m × n}. The main purpose of this paper is to find, for any p, q ? 1, the best (smallest) possible constants τ(m, k, n, p, q) and σ(m, k, n, p, q) for which inequalities of the form

$\text{|AB|}{}_{\mathrm{p}}\text{? τ(m, k, n, p, q) |A|}{}_{\mathrm{p}}\text{|B|}{}_{\mathrm{q}}\text{, |AB|}{}_{\mathrm{p}}\text{? σ (m, k, n, p, q)|A|}{}_{\mathrm{q}}\text{|B|}{}_{\mathrm{p}}$

hold for all A?C_{m × k}, B?C_{k × n}. This leads to upper bounds for inner products on C^k and for ordinary l_p operator norms on C_{m × n}.     

On a conjecture by D. Ž. D̄okovic

It is shown that if $\text{A?Ω}{}_{\mathrm{n}}\text{?{J}{}_{\mathrm{n}}\text{}}$ satisfies

$\text{nkσ}{}_{\mathrm{k}}\text{(A)?(n?k+1)}{}^2\text{σ}{}_{\mathrm{k?1}}\text{(A)}$

$\text{(k=1,2,…,n)}$

, where σ_k(A) denotes the sum of all kth order subpermanent of A, then Per[λJ_n+(1?λ)A] is strictly decreasing in the interval 0<λ<1.     

Lower bounds for the norm of the symmetric product

Suppose each of m, n, and k is a positive integer, k ? n, A is a (real-valued) symmetric n-linear function on E_m, and B is a k-linear symmetric function on E_m. The tensor and symmetric products of A and B are denoted, respectively, by A ?B and A?B. The identity

$\text{6A · B6}{}^2\text{=}\text{∑}\text{q=0}\text{n}\text{(}\text{n}\text{k}\text{)}\text{(}\text{n+k}\text{k}\text{)}\text{6A?}{}_{\mathrm{q}}\text{B6}{}^2$

is proven by Neuberger in [1]. An immediate consequence of this identity is the inequality

$\text{6A · B 6}{}^2\text{?}\text{n+k}\text{n}{}^{\mathrm{?1}}\text{6A · B 6}{}^2$

In this paper a necessary and sufficient condition for

$\text{6A · B 6}{}^2\text{=}\text{n+k}\text{n}{}^{\mathrm{?}}\text{6A · B 6}{}^2$

is given. It is also shown that under certain conditions the inequality can be considerably improved. This improvement results from an analysis of the terms 6A?_qB6, 1?q?n, appearing in the identity.