Gray code enumeration of families of integer partitions

In this paper we show that the elements of certain families of integer partitions can be listed in a minimal change, or Gray code, order. In particular, we construct Gray code listings for the classes P_δ(n, k) and D(n, k) of partitions of n into parts of size at most k in which, for P_δ(n, k), the parts are congruent to one modulo δ and, for D(n, k), the parts are distinct. It is shown that the elements of these classes can be listed so that the only change between successive partitions is the increase of one part by δ (or the addition of δ ones) and the decrease of one part by δ (or the removal of δ ones), where, in the case of D(n, k), δ = 1.     

Subalgebras of matrix algebras generated by companion matrices

Let f,g∈Z[X] be monic polynomials of degree n and let C,D∈M_n(Z) be the corresponding companion matrices. We find necessary and sufficient conditions for the subalgebra Z〈C,D〉 to be a sublattice of finite index in the full integral lattice M_n(Z), in which case we compute the exact value of this index in terms of the resultant of f and g. If R is a commutative ring with identity we determine when R〈C,D〉=M_n(R), in which case a presentation for M_n(R) in terms of C and D is given.     

Classes of orderings of measures and related correlation inequalities II. Multivariate reverse rule distributions

A function f(x) defined on = ₁ × ₂ × … × _n where each _i is totally ordered satisfying f(x y) f(x y) ≥ f(x) f(y), where the lattice operations and refer to the usual ordering on , is said to be multivariate totally positive of order 2 (MTP₂). A random vector Z = (Z₁, Z₂,…, Z_n) of n-real components is MTP₂ if its density is MTP₂. Classes of examples include independent random variables, absolute value multinormal whose covariance matrix Σ satisfies −DΣ⁻¹D with nonnegative off-diagonal elements for some diagonal matrix D, characteristic roots of random Wishart matrices, multivariate logistic, gamma and F distributions, and others. Composition and marginal operations preserve the MTP₂ properties. The MTP₂ property facilitate the characterization of bounds for confidence sets, the calculation of coverage probabilities, securing estimates of multivariate ranking, in establishing a hierarchy of correlation inequalities, and in studying monotone Markov processes. Extensions on the theory of MTP₂ kernels are presented and amplified by a wide variety of applications.     

Geometric interpretations of two branching theorems of D.E. Littlewood

D.E. Littlewood proved two branching theorems for decomposing the restriction of an irreducible finite-dimensional representation of a unitary group to a symmetric subgroup. One is for restriction of a representation of U(n) to the rotation group SO(n) when the given representation τ_λ of U(n) has nonnegative highest weight λ of depth n/2. It says that the multiplicity in τ_λ|_SO(n) of an irreducible representation of SO(n) of highest weight ν is the sum over μ of the multiplicities of τ_λ in the U(n) tensor product τ_μτ_ν, the allowable μ's being all even nonnegative highest weights for U(n). Littlewood's proof is character-theoretic. The present paper gives a geometric interpretation of this theorem involving the tensor products τ_μτ_ν explicitly. The geometric interpretation has an application to the construction of small infinite-dimensional unitary representations of indefinite orthogonal groups and, for each of these representations, to the determination of its restriction to a maximal compact subgroup. The other Littlewood branching theorem is for restriction from U(2r) to the rank-r quaternion unitary group Sp(r). It concerns nonnegative highest weights for U(2r) of depth r, and its statement is of the same general kind. The present paper finds an analogous geometric interpretation for this theorem also.     

A new class of symmetric polynomials defined in terms of tableaux

A new class of symmetric polynomials in n variables z = (z₁,…, z_n), denoted t_λ(z), and labelled by partitions λ = [λ₁ … λ_n] is defined in terms of standard tableaux (equivalently, in terms of Gel'fand-Weyl patterns of the general linear group GL(n,C)). The t_λ(z) are shown to be a -basis of the ring of all symmetric polynomials in n variables. In contrast to the usual basis sets such as the Schur functions e_λ(z), which are homogeneous polynomials in the z_i, the t_λ(z) are inhomogeneous. This property is reflected in the fact that the t_λ(z) are a natural basis for the expansion of certain (inhomogeneous) symmetric polynomials constructed from rising factorials. This and several other properties of the t_λ(z) are proved. Two generalizations of the t_λ(z) are also given. The first generalizes the t_λ(z) to a 1-parameter family of symmetric polynomials, T_λ(α; z), where α is an arbitrary parameter. The T_λ(α; z) are shown to possess properties similar to those of the t_λ(z). The second generalizes the t_λ(z) to a class of skew-tableau symmetric polynomials, t_λ/μ(z), for which only a few preliminary results are given.     

Adjacency preserving bijective maps on triangular matrices over any division ring

Let 𝕋 _n (D) be the set of n × n upper triangular matrices over a division ring D. We characterize the adjacency preserving bijective maps in both directions on 𝕋 _n (D) (n ≥ 3). As applications, we describe the ring semi-automorphisms and the Jordan automorphisms on upper triangular matrices over a simple Artinian ring.     

Approximation to continuous functions by Cesàro means of double Fourier series and conjugate series

We study the rate of uniform approximation to continuous functions ƒ(x, y), 2π-periodic in each variable, in Lipschitz classes Lip(α, β) and in Zygmund classes Z(α, β), 0 < α, β 1, by Cesàro means σ_mn^γδ(ƒ) of positive orders of the rectangular partial sums of double Fourier series. The rate of uniform approximation to the conjugate functions ^1,0, ^0,1 and ^1,1 by the corresponding Cesàro means is also discussed in detail. The difference between the classes Lip(α, β) and Z(α, β), similar to the one-dimensional case, appears again when max(α, β) = 1. (Compare Theorems 2 and 3 with Theorems 4 and 5.) One surprising result is the following: The uniform approximation rate by σ_mn^{γδ 1,0} to ^1,0 is worse in general than that by σ_mn^{γδ 1,1} to ^1,1 for ƒ ε Lip(1, 1). In fact, the appearance of an extra factor [log(n + 2)]² in the former case is unavoidable (see Theorem 6). All approximation rates we obtain, with one exception, are shown to be exact. Two conjectures are also included.     

Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices

We present a structured perturbation theory for the LDU factorization of (row) diagonally dominant matrices and we use this theory to prove that a recent algorithm of Ye (Math Comp 77(264):2195–2230, 2008) computes the L, D and U factors of these matrices with relative errors less than 14n ³ u, where u is the unit roundoff and n × n is the size of the matrix. The relative errors for D are componentwise and for L and U are normwise with respect the “max norm” ||A||_M = max_ij |a_ij|{\|A\|_M = \max_{ij} |a_{ij}|}. These error bounds guarantee that for any diagonally dominant matrix A we can compute accurately its singular value decomposition and the solution of the linear system Ax = b for most vectors b, independently of the magnitude of the traditional condition number of A and in O(n ³) flops.     

On the number of matrices and a random matrix with prescribed row and column sums and 0-1 entries

We consider the set Σ(R,C) of all m×n matrices having 0-1 entries and prescribed row sums R=(r₁,…,rm) and column sums C=(c₁,…,cn). We prove an asymptotic estimate for the cardinality |Σ(R,C)| via the solution to a convex optimization problem. We show that if Σ(R,C) is sufficiently large, then a random matrix D∈Σ(R,C) sampled from the uniform probability measure in Σ(R,C) with high probability is close to a particular matrix Z=Z(R,C) that maximizes the sum of entropies of entries among all matrices with row sums R, column sums C and entries between 0 and 1. Similar results are obtained for 0-1 matrices with prescribed row and column sums and assigned zeros in some positions.     

Linear groups over a skew field of quaternions containing the group T_{n}(A, \Phi) over a subsfield

We study the subgroups of GL_n(D) (n \geqq 3) GL_{n}(D) (n \geqq 3) over a skew field of quaternions D that comprise the subgroup of the unitary group U_n(A, F) U_{n}(A, \Phi) over a subsfield A \subseteqq D A \subseteqq D generated by all transvections in U_n(A, F) U_{n}(A, \Phi) .