A note on matrix subalgebras containing a full Jordan block

Let A be a subalgebra of the full matrix algebra M_n(F), and suppose J∈A, where J is the Jordan block corresponding to xⁿ. Let $\text{S}$ be a set of generators of A. It is shown that the graph of $\text{S}$ determines whether A is the full matrix algebra M_n(F).     

Scalar polynomial functions on the n×n matrices over a finite field

Let F=GF(q) denote the finite field of order q, and let $\text{?(x)?F[x]}$. Then f(x) defines, via substitution, a function from F_n×n, the n×n matrices over F, to itself. Any function $\text{?:F}{}_{\mathrm{n\times n}}\text{→ F}{}_{\mathrm{n\times n}}$ which can be represented by a polynomialf(x)?F[x] is called a scalar polynomial function on F_n×n. After first determining the number of scalar polynomial functions on F_n×n, the authors find necessary and sufficient conditions on a polynomial $\text{?(x) ? F[x]}$ in order that it defines a permutation of (i) $\text{D}$_n, the diagonalizable matrices in F_n×n, (ii)$\text{R}$_n, the matrices in F_n×n all of whose roots are in F, and (iii) the matric ring F_n×n itself. The results for (i) and (ii) are valid for an arbitrary field F.     

Classes of orderings of measures and related correlation inequalities. I. Multivariate totally positive distributions

A function f(x) defined on $\text{X}$ = $\text{X}$₁ × $\text{X}$₂ × … × $\text{X}$_n where each $\text{X}$_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 $\text{X}$, 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Σ^?1D 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.     

The minimal dimension of maximal commutative subalgebras of full matrix algebras

Let F be a field and A a maximal commutative subalgebra of the full matrix algebra M_n(F). It is shown that dim A > (2n)^{$\text{2}\text{3}$} ? 1. It is also shown that if the radical of A has cube zero, then dim A ? [3n^{$\text{2}\text{3}$} ? 4], and that this result is best possible for infinitely many natural numbers n.     

Linear transformations on matrices: the invariance of generalized permutation matrices—III

Let F be a field, F1 be its multiplicative group, and $\text{H}$ = {H:H is a subgroup of F1 and there do not exist a, b?F1 such that Ha+b?H}. Let D_n be the dihedral group of degree n, H be a nontrivial group in $\text{H}$, and τ_n(H) = {α = (α₁, α₂,…, α_n):α_i?H}. For σ?D_n and α?τ_n(H), let P(σ, α) be the matrix whose (i,j) entry is α_iδ_iσ(j) (i.e., a generalized permutation matrix), and

$\text{P(D}{}_{\mathrm{n}}\text{, H) = {P(σ, α):σ?D}{}_{\mathrm{n}}\text{, α?τ}{}_{\mathrm{n}}\text{(H)}}$

. Let M_n(F) be the vector space of all n×n matrices over F and $\text{T}$P(D_n, H) = {T:T is a linear transformation on M_n (F) to itself and T(P(D_n, H)) = P(D_n, H)}. In this paper we classify all T in $\text{T}$P(D_n, H) and determine the structure of the group $\text{T}$P(D_n, H) (Theorems 1 to 4). An expository version of the main results is given in Sec. 1, and an example is given at the end of the paper.     

Diophantine problems in variables restricted to the values 0 and 1

Let $\text{F}$x₁,…,x_s be a form of degree d with integer coefficients. How large must s be to ensure that the congruence $\text{F}$(x₁,…,x_s) ≡ 0 (mod m) has a nontrivial solution in integers 0 or 1? More generally, if $\text{F}$ has coefficients in a finite additive group G, how large must s be in order that the equation $\text{F}$(x₁,…,x_s) = 0 has a solution of this type? We deal with these questions as well as related problems in the group of integers modulo 1 and in the group of reals.     

A note on polynomial matrix functions over a finite field

Let F_n denote the ring of n×n matrices over the finite field F=GF(q) and let A(x)=A_Nx^N+ ?+ A₁x+A₀?F_n[x]. A function $\text{?:F}{}_{\mathrm{n}}\text{→F}{}_{\mathrm{n}}$ is called a right polynomial function iff there exists an A(x)?F_n[x] such that $\text{?(B)=A}{}_{\mathrm{N}}\text{B}{}^{\mathrm{N}}\text{+?+A}{}_1\text{B+ A}{}_0$ for every B?F_n. This paper obtains unique representations for and determines the number of right polynomial functions.     

On minima of rational indefinite quadratic forms

Let f(x) be an indefinite quadratic form with real coefficients in n variables with nonzero determinant d. The collection of all values of $\text{v(f) = |d|}{}^{\mathrm{<mtext>?1</mtext><mtext>n</mtext>}}\text{inf}\text{|f(x)|}$, where infimum is taken over x ∈ Zⁿ such that f(x) ≠ 0 (x ≠ 0) is called the spectrum of nonzero minima (spectrum of minima) of such forms. The spectrum is said to be discrete if for every δ > 0, there are only finitely many values of v(f) > δ. It is proved that for rational quadratic forms in n ≥ 3 variables and real quadratic forms in n ≥ 21 variables the spectra of nonzero minima are discrete. Also the spectra of minima of indefinite ternary and quaternary rational quadratic forms are discrete.     

NP-completeness for minimizing maximum edge length in grid embeddings

Given an embedding f: G →$\text{Z}$² of a graph G in the two-dimensional lattice, let |f| be the maximum L₁ distance between points f(x) and f(y) where xy is an edge of G. Let B₂(G) be the minimum |f| over all embeddings f. It is shown that the determination of B₂(G) for arbitrary G is NP-complete. Essentially the same proof can be used in showing the NP-completeness of minimizing |f| over all embeddings f: G → $\text{Z}$ⁿ of G into the n-dimensional integer lattice for any fixed n ≥ 2.     

On Berry-Esséen rates,a law of the iterated logarithm and an invariance principle for the proportion of the sample below the sample mean

Let F_n(x) be the empirical distribution function based on n independent random variables X₁,…,X_n from a common distribution function F(x), and let $\text{X}\text{= Σ}{}_{\mathrm{i=1}}{}^{\mathrm{n}}\text{X}{}_{\mathrm{i}}\text{n}$ be the sample mean. We derive the rate of convergence of $\text{F}{}_{\mathrm{n}}\text{(}\text{X}\text{)}$ to normality (for the regular as well as nonregular cases), a law of iterated logarithm, and an invariance principle for $\text{F}{}_{\mathrm{n}}\text{(}\text{X}\text{)}$.     

The lattice of subfields of a radical extension

Let x^m ? a be irreducible over F with char $\text{F?m}$ and let α be a root of x^m ? a. The purpose of this paper is to study the lattice of subfields of $\text{F(α)}\text{F}$ and to this end $\text{C(}\text{F(α)}\text{F}\text{, k)}$ is defined to be the number of subfields of F(α) of degree k over $\text{F. C(}\text{F(α)}\text{F}\text{, p}{}^{\mathrm{n}}\text{)}$ is explicitly determined for p a prime and the following structure theorem for the lattice of subfields is proved. Let N be the maximal normal subfield of F(α) over F and set n = |N : F|, then $\text{C(}\text{F(α)}\text{F}\text{, k) = C(}\text{F(α)}\text{F}\text{, (k, n)) = C(}\text{N}\text{F}\text{, (k, n))}$. The irreducible binomials x^s ? b, x^s ? c are said to be equivalent if there exist roots β^s = b, γ^s = a such that F(β) = F(γ). All the mutually inequivalent binomials which have roots in F(α) are determined. Finally these results are applied to the study of normal binomials and those irreducible binomials x^2e ? a which are normal over F (char F ≠ 2) together with their Galois groups are characterized.     

On tilings of the binary vector space

Let n be a positive integer, L a subset of {0, 1,…,n}. We discuss the existence of partitions (or tilings) of the n-dimensional binary vector space F_n into L-spheres. By a L-sphere around an x in F_n we mean {y ? F_n, d(x, y) ? L}, d(x, y) being the Hamming distance betwe en x and y. These tilings are generalizations of perfect error correcting codes. We show that very few such tilings exist (Theorem 2) and characterize them all for any L ? {0, 1,…,[$\text{1}\text{2}$n]}.     

On the density of various classes of groups

Let $\text{T}$ be a subset of the set of all isomorphism classes of finite groups. We consider the number F_$\text{g}$(x) of positive integers n≤x such that all groups of order n lie in $\text{T}$. When $\text{T}$ consists of the isomorphism classes of all finite groups of any of the following types, we obtain an asymptotic formula for F_$\text{g}$(x): cyclic groups, abelian groups, nilpotent groups, supersolvable groups, and solvable groups. In the course of the arguments, we also obtain, for almost all n, a lower bound for the number of groups of a given order n.     

Maximization,under equality constraints,of a functional of a probability distribution

Let $\text{F}$ be a family of probability distributions. Let O, C₁…C_n be real functions on $\text{F}$. Let z₁…z_n be real numbers. Then we consider the problem of maximization of the object function O(F)(F?$\text{F}$) under the equality constraints C₁(F)=z₁(i=1,…,n) . The theory is developed in order to solve problems of the following kind: Find the maximal variance of a stop-loss reinsured risk under partial information on the risk such as its range and two first moments.     

On the rate for uniform strong consistency of empirical distributions of independent nonidentically distributed multivariate random variables

Let X_j = (X_1j ,…, X_pj), j = 1,…, n be n independent random vectors. For x = (x₁ ,…, x_p) in R^p and for α in [0, 1], let F_j${}^1$(x) = αI(X_1j < x₁ ,…, X_pj < x_p) + (1 ? α) I(X_1j ≤ x₁ ,…, X_pj ≤ x_p), where I(A) is the indicator random variable of the event A. Let F_j(x) = E(F_j${}^1$(x)) and D_n = sup_{x, α} max_{1 ≤ N ≤ n} |Σ₀ⁿ(F_j${}^1$(x) ? F_j(x))|. It is shown that P[D_n ≥ L] < 4pL exp{?2(L²n^?1 ? 1)} for each positive integer n and for all L² ≥ n; and, as n → ∞, $\text{D}{}_{\mathrm{n}}\text{= 0((n}\text{log}\text{n)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{)}$ with probability one.     

Existence of stable equilibrium point for dynamical systems of Volterra type

This paper presents sufficient conditions for the existence of a nonnegative and stable equilibrium point of a dynamical system of Volterra type, (1) $\text{(}\text{d}\text{dt}\text{) x}{}_{\mathrm{i}}\text{(t) = ?x}{}_{\mathrm{i}}\text{(t)[f}{}_{\mathrm{i}}\text{(x}{}_1\text{(t),…, x}{}_{\mathrm{n}}\text{(t)) ? q}{}_{\mathrm{i}}\text{], i = 1,…, n}$, for every q = (q₁,…, q_n)^T?Rⁿ. Results of a nonlinear complementarity problem are applied to obtain the conditions. System (1) has a nonnegative and stable equilibrium point if (i) f(x) = (f₁(x),…,f_n(x))^T is a continuous and differentiable M-function and it satisfies a certain surjectivity property, or (ii), f(x) is continuous and strongly monotone on R₊₀ⁿ.     

Duality in hypercomplex function theory

Let $\text{A}$ be the Clifford algebra constructed over a quadratic n-dimensional real vector space with orthogonal basis {e₁,…, e_n}, and e₀ be the identity of $\text{A}$. Furthermore, let M_k(Ω;$\text{A}$) be the set of $\text{A}$-valued functions defined in an open subset Ω of R^m+1 (1 ? m ? n) which satisfy D^kf = 0 in Ω, where D is the generalized Cauchy-Riemann operator $\text{D = ∑}{}_{\mathrm{i\; =\; 0}}{}^{\mathrm{m}}\text{e}{}_{\mathrm{i}}\text{(}\text{?}\text{?x}{}_{\mathrm{i}}\text{)}$ and k? N. The aim of this paper is to characterize the dual and bidual of M_k(Ω;$\text{A}$). It is proved that, if M_k(Ω;$\text{A}$) is provided with the topology of uniform compact convergence, then its strong dual is topologically isomorphic to an inductive limit space of Fréchet modules, which in its turn admits M_k(Ω;$\text{A}$) as its dual. In this way, classical results about the spaces of holomorphic functions and analytic functionals are generalized.     

A criterion for generating full matrix algebras

Let M_n(F) be the algebra of n×n matrices over a field F, and let A∈M_n(F) have characteristic polynomial c(x)=p₁(x)p₂(x)?p_r(x) where p₁(x),…,p_r(x) are distinct and irreducible in F[x]. Let X be a subalgebra of M_n(F) containing A. Under a mild hypothesis on the p_i(x), we find a necessary and sufficient condition for X to be M_n(F).