An extremal problem for sets with applications to graph theory

Let X₁, …, X_n be n disjoint sets. For 1 ? i ? n and 1 ? j ? h let A_ij and B_ij be subsets of X_i that satisfy |A_ij| ? r_i and |B_ij| ? s_i for 1 ? i ? n, 1 ? j ? h, $\text{(∪}{}_{\mathrm{i}}\text{A}{}_{\mathrm{ij}}\text{) ∩ (∪}{}_{\mathrm{i}}\text{B}{}_{\mathrm{ij}}\text{) = ?}$ for 1 ? j ? h, $\text{(∪}{}_{\mathrm{i}}\text{A}{}_{\mathrm{ij}}\text{) ∩ (∪}{}_{\mathrm{i}}\text{B}{}_{\mathrm{il}}\text{) ≠ ?}$ for 1 ? j < l ? h. We prove that $\text{h?}\text{Π}\text{i=1}\text{n}\text{r}{}_{\mathrm{i}}\text{+s}{}_{\mathrm{i}}\text{r}{}_{\mathrm{i}}$. This result is best possible and has some interesting consequences. Its proof uses multilinear techniques (exterior algebra).     

The asymptotic eigenvalue-distribution for a certain class of random matrices

For an n × n Hermitean matrix A with eigenvalues λ₁, …, λ_n the eigenvalue-distribution is defined by $\text{G(x, A) :=}\text{1}\text{n}$ · number {λ_i: λ_i ? x} for all real x. Let A_n for n = 1, 2, … be an n × n matrix, whose entries a_ik are for i, k = 1, …, n independent complex random variables on a probability space (Ω, $\text{R}$, p) with the same distribution F_a. Suppose that all moments $\text{E}$ | a | ^k, k = 1, 2, … are finite, $\text{E}$a=0 and $\text{E}$ | a | ². Let

$\text{M(A)=}\text{∑}\text{σ=1}\text{s}\text{θ}{}_{\mathrm{\sigma }}\text{P}{}_{\mathrm{\sigma }}\text{(A,A}{}^1\text{)}$

with complex numbers θ_σ and finite products P_σ of factors A and $\text{A}{}^1$ (= Hermitean conjugate) be a function which assigns to each matrix A an Hermitean matrix M(A). The following limit theorem is proved: There exists a distribution function G₀(x) = G₁x) + G₂(x), where G₁ is a step function and G₂ is absolutely continuous, such that with probability $\text{1 G(x, M(}\text{A}{}_{\mathrm{n}}\text{n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{))}$ converges to G₀(x) as n → ∞ for all continuity points x of G₀. The density g of G₂ vanishes outside a finite interval. There are only finitely many jumps of G₁. Both, G₁ and G₂, can explicitly be expressed by means of a certain algebraic function f, which is determined by equations, which can easily be derived from the special form of M(A). This result is analogous to Wigner's semicircle theorem for symmetric random matrices (E. P. Wigner, Random matrices in physics, SIAM Review9 (1967), 1–23). The examples $\text{A}{}_{\mathrm{r}}\text{A}{}^{\mathrm{1r}}$, $\text{A}{}^{\mathrm{r}}\text{+ A}{}^{\mathrm{1r}}$, $\text{A}{}^{\mathrm{r}}\text{A}{}^{\mathrm{1r}}\text{± A}{}^{\mathrm{1r}}\text{A}{}^{\mathrm{r}}$, r = 1, 2, …, are discussed in more detail. Some inequalities for random matrices are derived. It turns out that with probability 1 the sharpened form

$\text{lim sup}\text{n→∞}\text{∑}\text{i=1}{}^{\mathrm{n}}\text{|γ}{}_{\mathrm{i}}{}^{\mathrm{(n)}}\text{|}{}^2\text{?6A}{}_{\mathrm{n}}\text{6}{}^2\text{? 0.8228…}$

of Schur's inequality for the eigenvalues λ_i⁽ⁿ⁾ of A_n holds. Consequently random matrices do not tend to be normal matrices for large n.     

Decomposable bilinear numerical radii

Let A be an n-square normal matrix over $\text{C}$, and Q_{m, n} be the set of strictly increasing integer sequences of length m chosen from 1,…, n. For α,β∈Q_{m, n} denote by A[α|β] the submatrix obtained from A by using rows numbered α and columns numbered β. For k∈{0,1,…,m} write z.sfnc;α∩β|=k if there exists a rearrangement of 1,…,m, say i₁,…,i_k, i_k+1,…,i_m, such that α(i_j)=β(i_j), j=1,…,k, and {α(i_k+1),…,α(i_m)};∩{β(i_k+1),…,β(i_m)}=ø. Let

be the group of n-square unitary matrices. Define the nonnegative number

$\text{?}{}_{\mathrm{k}}\text{(A)=}\text{max}\text{U∈}\textcolor{red}{}\text{|}\text{det}\text{(U}{}^1\text{AU) [α|β]|}$

, where |α∩β|=k. Theorem 1 establishes a bound for ?_k(A), 0?k<m?1, in terms of a classical variational inequality due to Fermat. Let A be positive semidefinite Hermitian, n?2m. Theorem 2 leads to an interlacing inequality which, in the case n=4, m=2, resolves in the affirmative the conjecture that

$\text{?}{}_{\mathrm{m}}\text{(A)??}{}_{\mathrm{m?1}}\text{(A)????}{}_0\text{(A)}$

.     

Subproper splitting for rectangular matrices

In this paper iterative schemes for approximating a solution to a rectangular but consistent linear system Ax = b are studied. Let A?C^{m × n}_r. The splitting A = M ? N is called subproper if R(A) ? R(M) and $\text{R(A}{}^1\text{) ?R(M}{}^1\text{)}$. Consider the iteration $\text{x}{}_{\mathrm{i}}\text{= M}{}^2\text{Nx}{}_{\mathrm{i}}{}_{\mathrm{?1}}\text{+ M}{}^2\text{b}$. We characterize the convergence of this scheme to a solution of the linear system. When A?R^m×ⁿ_r, monotonicity and the concept of subproper regular splitting are used to determine a necessary and a sufficient condition for the scheme to converge to a solution.     

Anti-Hadamard matrices

An anti-Hadamard matrix may be loosely defined as a real (0, 1) matrix which is invertible, but only just. Let A be an invertible (0, 1) matrix with eigenvalues λ_i, singular values σ_i, and inverse B = (b_ij). We are interested in the four closely related problems of finding λ(n) = min_{A, i}|λ_i|, σ(n) = min_{A, i}σ_i, χ(n) = max_{A, i, j} |b_ij|, and μ(n) = max_AΣ_ijb²_ij. Then A is an anti-Hadamard matrix if it attains μ(n). We show that λ(n), σ(n) are between $\text{(2n)}{}^{\mathrm{?1}}\text{(}\text{n}\text{4}\text{)}{}^{\mathrm{<mtext>?n</mtext><mtext>2</mtext>}}$ and c√n (2.274)^?n, where c is a constant, $\text{c}\text{(2.274)}{}^{\mathrm{n}}\text{?χ(n)?2(}\text{n}\text{4}\text{)}{}^{\mathrm{<mtext>n</mtext><mtext>2</mtext>}}$, and $\text{c}\text{(5.172)}{}^{\mathrm{n}}\text{?μ(n)?4n}{}^2\text{(}\text{n}\text{4}\text{)}{}^{\mathrm{n}}$. We also consider these problems when A is restricted to be a Toeplitz, triangular, circulant, or (+1, ?1) matrix. Besides the obvious application—to finding the most ill-conditioned (0, 1) matrices—there are connections with weighing designs, number theory, and geometry.     

The edge-coloring of complete hypergraphs I

This paper contains and generalizes the solution of the following classical problem:If h | n then the h-element subsets of an n-element set can be partitioned into (_h?1^n?1) classes so that every class contains $\text{n}\text{h}$ disjoint h-element sets and every h-element set appears in exactly one class. A short formulation of this statement is: If h | n then the hypergraph $\text{K}{}_{\mathrm{n}}{}^{\mathrm{h}}$ is 1-factorizable. In this paper we study the factorization and edge-coloring problems of the hypergraph K_rxm^h (which is the complete, regular, h-uniform, r-partite hypergraph with m vertices in each of the r classes of vertices).     

Sur la densité divisorielle d'une suite d'entiers

The condition $\text{Σ}{}_{\mathrm{k<x}}\text{|Σ}{}_{\mathrm{n<x}}\text{(χ(n) ? z)}\text{4}{}^{\mathrm{\Omega (n)}}\text{n}\text{| = o(√}\text{log}\text{x)}$, where Ω(n) stands for the number of prime factors, counted according to multiplicity, of the positive integer n, is shown to be necessary and sufficient for the integer sequence with characteristic function χ to have divisor density z, i.e., Σ_d|nχ(d) = (z + o(1)) Σ_d|n 1 when n → ∞ if one neglects a sequence of asymptotic density zero. Among the applications, the following result, first conjectured by R. R. Hall, is proved: given any positive α, we have, for almost all n's, and uniformly with respect to z in |0, 1|,

$\text{card}\text{{d:d|n, (}\text{log}\text{d)}{}^{\mathrm{\alpha }}\text{< z (}\text{mod}\text{1)}=(z+o(1))}\text{∑}\text{d|n}\text{1.}$

     

Strong law for the bootstrap

Let X₁, X₂, X₃, … be i.i.d. r.v. with E|X₁| < ∞, E X₁ = μ. Given a realization X = (X₁,X₂,…) and integers n and m, construct Y_n,i, i = 1, 2, …, m as i.i.d. r.v. with conditional distribution $\text{P}{}^1\text{(Y}{}_{\mathrm{n,i}}\text{= X}{}_{\mathrm{j}}\text{) =}\text{1}\text{n}$ for 1 ? j ? n. ($\text{P}{}^1$ denotes conditional distribution given X). Conditions relating the growth rate of m with n and the moments of X₁ are given to ensure the almost sure convergence of $\text{(}\text{1}\text{m}\text{)Σ}{}^{\mathrm{m}}{}_{\mathrm{i=1}}\text{Y}{}_{\mathrm{n,i}}$ toμ. This equation is of some relevance in the theory of Bootstrap as developed by Efron (1979) and Bickel and Freedman (1981).     

Asymptotic behavior of nonoscillatory solutions of nonlinear differential equations with retarded arguments

For nonlinear retarded differential equations $\text{y}{}^{\mathrm{2n}}\text{(t)?}\text{∑}\text{i=1}\text{m}\text{f}{}_{\mathrm{i}}\text{(t,y(t),y(g}{}_{\mathrm{i}}\text{(t)))=0}$ and $\text{y}{}^{\mathrm{n}}\text{(t)?}\text{∑}\text{i=1}\text{m}\text{P}{}_{\mathrm{i}}\text{(t)F}{}_{\mathrm{i}}\text{(y(g}{}_{\mathrm{i}}\text{(t)))=h(t),}$ the sufficient conditions are given on f_i, p_i, F_i, and h under which every bounded nonoscillatory solution of (${}^1$) or (${}^7$) tends to zero as t → ∞.     

A new form of trigonometric orthogonality and Gaussian-type quadrature

Gauss's (2n+1)-point trigonometric interpolation formula, based upon f(x_i), i = 1(1)2n+1, gives a trigonometric sum of the n^th order, S_2n+1(x = a₀ + ∑_jⁿ = 1^(a_jcos jx + b_jsin jx), which may be integrated to provide formulas for either direct quadrature or stepwise integration of differential equations having periodic (or near-periodic) solutions. An “orthogonal” trigonometric sum S_2r+1(x) is one that satisfies

$\text{∫}{}_{\mathrm{a}}{}^{\mathrm{b}}\text{S}{}_{\mathrm{2r+1}}\text{(x)S}{}_{\mathrm{2r\prime +1}}\text{(x)dx=0, r′<r}$

and two other arbitrarily imposable conditions needed to make S_2r1(x) unique. Two proofs are given of a fundamental factor theorem for any S_2n+1(x) (somewhat different from that for polynomials) from which we derive 2r-point Gaussian-type quadrature formulas, r = [n/2] + 1, which are exact for any S_4r?1(x). We have

$\text{∫}{}_{\mathrm{a}}{}^{\mathrm{b}}\text{S}{}_{\mathrm{4r?1(x)}}\text{dx=∑}{}_{\mathrm{j=1}}{}^{\mathrm{2r}}\text{A}{}_{\mathrm{j}}\text{S}{}_{\mathrm{4r?1}}\text{(x}{}_{\mathrm{j}}\text{)}$

where the nodes x_j, j = 1(1)2r, are the zeros of the orthogonal S_2r+1(x). It is proven that A_j > 0 and that 2r-1 of the nodes must lie within the interval [a,b], and the remaining node (which may or may not be in [a,b]) must be real. Unlike Legendre polynomials, any [a′,b′] other than a translation of [a,b], requires different and unrelated sets of nodes and weights. Gaussian-type quadrature formulas are applicable to the numerical integration of the Gauss (2n+1)-point interpolation formulas, with extra efficiency when the latter are expressed in barycentric form. S_2r+1(x), x_jandA_j, j = 1(1)2r, were calculated for [a,b] = [0, π/4], 2r = 2 and 4, to single-precision accuracy.     

On a class of stopping times for M-estimators

For a given score function ψ = ψ(x, θ), let θ_n be Huber's M-estimator for an unknown population parameter θ. Under some mild smoothness assumptions it is known that $\text{n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{(θ}{}_{\mathrm{n}}\text{? θ)}$ is asymptotically normal. In this paper the stopping times $\text{τ}{}_{\mathrm{c}}\text{(m) =}\text{inf}\text{{n ≥ m: n}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{|θ}{}_{\mathrm{n}}\text{? θ | > c }}$ associated with the sequence of confidence intervals for θ are investigated. A useful representation of M-estimators is derived, which is also appropriate for proving laws of the iterated logarithm and Donskertype invariance principles for (π_n)_n.     

Doubly stochastic matrices with equal subpermanents

It has been conjectured that if A is a doubly stochastic n>× n matrix such that per A(i, j)≥perA for all i, j, then either A = J_n, then n × n matrix with each entry equal to $\text{1}\text{n}$, or, up to permutations of rows and columns, $\text{A =}\text{1}\text{2}\text{(I}{}_{\mathrm{n}}\text{+ P}{}_{\mathrm{n}}\text{)}$, where P_n is a full cycle permutation matrix. This conjecture is proved.     

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.     

On nonnormal matrices

For the eigenvalues λ_i of an n × n matrix A the inequality

$\text{∑}\text{i}\text{|λ}{}_{\mathrm{i}}\text{|}{}^2\text{(6A6}{}^4\text{?}\text{1}\text{2}\text{6D6}{}^2\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}$

is proved, where $\text{D ? AA}{}^1\text{? A}{}^1\text{A}$ and 6 ● 6; denotes the euclidean norm. Conditions for equality are stated.     

A generalization of Lavoie's inequality concerning the sum of idempotent matrices

Let a complex pxn matrix A be partitioned as A′=(A′₁,A′₂,…,A′_k). Denote by ?(A), A′, and A^? respectively the rank of A, the transpose of A, and an inner inverse (or a g-inverse) of A. Let A⁽¹⁴⁾ be an inner inverse of A such that A⁽¹⁴⁾A is a Hermitian matrix. Let B=(A⁽¹⁴⁾₁,A⁽¹⁴⁾₂,…,A_k⁽¹⁴⁾) and $\text{ρ(A)=}\text{∑}\text{i=1}\text{k}\text{ρ(A}{}_{\mathrm{i}}\text{)}$.Then the product of nonzero eigenvalues of BA (or AB) cannot exceed one, and the product of nonzero eigenvalues of BA is equal to one if and only if either B=A⁽¹⁴⁾ or $\text{A}{}_{\mathrm{i>}}\text{A}{}_{\mathrm{<mtext>j</mtext>}}{}^1\text{=0}$ for all i ≠ j,i, j=1,2,…,k . The results of Lavoie (1980) and Styan (1981) are obtained as particular cases. A result is obtained for k=2 when the condition $\text{ρ(A)=}\text{∑}\text{i=1}\text{k}\text{ρ(A}{}_{\mathrm{i}}\text{)}$ is no longer true.     

A theorem on products of matrices

A new result on products of matrices is proved in the following theorem: let M_i (i=1,2,…) be a bounded sequence of square matrices, and K be the l.u.b. of the spectral radii ρ(M_i). Then for any positive number ε there is a constant A and an ordering p(j) (j = 1,2,…) of the matrices such that

$\text{∏}\text{j=1}\text{n}\text{M}{}_{\mathrm{p(j)}}\text{?A·(K+ε)}{}^{\mathrm{n}}\text{(n = 1,2,…)}$

. The ordering is well defined by p(j), a one-to-one mapping on the set of positive integers. In general the inequality does not hold for any ordering p(j) (a counterexample is provided); however, some sufficient conditions are given for the result to remain true irrespective of the order of the matrices.     

The phase transition in a random hypergraph

We show that in the evolution of the random d-uniform hypergraph $\text{G}{}^{\mathrm{d}}\text{(n,M)}$ the phase transition occurs when M=n/d(d−1)+O(n^2/3). We also prove local limit theorems for the distribution of the size of the largest component of $\text{G}{}^{\mathrm{d}}\text{(n,M)}$ in the subcritical and in the early supercritical phase.     

A complete set of invariants for finite groups and other results

For a finite group G and a set I ? {1, 2,…, n} let

${}_{\mathrm{G}}\text{(n,I) = ∑}{}_{\mathrm{g\; \in \; G}}\text{ε}{}_1\text{(g)?ε}{}_2\text{(g)???ε}{}_{\mathrm{n}}\text{(g)}$

,where

$\text{ε}{}_{\mathrm{i}}\text{(g)=g}\text{if}\text{i=∈ I,}$

$\text{ε}{}_{\mathrm{l}}\text{(g)=l}\text{if}\text{i=∈ I.}$

We prove, among other results, that the positive integers

$\text{tr}\text{(e}{}_{\mathrm{G}}\text{(n,I}{}_1\text{)+?+e}{}_{\mathrm{G}}\text{(n,I}{}_{\mathrm{r}}\text{))}{}^{\mathrm{k}}\text{:n,r,k,?1, I}{}_{\mathrm{j}}\text{?{1,…,n}, 1?|i}{}_{\mathrm{j}}\text{|?3}$

for 1 ? j ? r, I_j1 ∩ I_j2 ∩ I_j3 ∩ I_j4 = Ø for any 1 ? j₁ <j₂ <j₃ <j₄ ? r, determine G up to isomorphism. We also show that under certain assumptions finite groups are determined up to isomorphism by the number of their subgroups.     

Singular perturbation problems for systems of partial differential equations of elliptic type

Elliptic boundary value problems for systems of nonlinear partial differential equations of the form $\text{F}{}_{\mathrm{i}}\text{(x, u}{}_1\text{, u}{}_2\text{,…, u}{}_{\mathrm{N}}\text{,}\text{?u}{}_{\mathrm{i}}\text{?x}{}_{\mathrm{j}}\text{, ?}{}^{\mathrm{p}}{}_{\mathrm{i}}\text{?}{}^2\text{u}{}_{\mathrm{i}}\text{?x}{}_{\mathrm{j}}\text{?x}{}_{\mathrm{k}}\text{) = ?}{}_{\mathrm{i}}\text{(x), x ? R}{}^{\mathrm{n}}$, i = 1(1)N, j, k = 1(1)n, p_i ? 0, ? being a small parameter, with Dirichlet boundary conditions are considered. It is supposed that a formal approximation Z is given which satisfies the boundary conditions and the differential equations upto the order χ(?) = o(1) in some norm. Then, using the theory of differential inequalities, it is shown that under certain conditions the difference between the exact solution u of the boundary value problem and the formal approximation Z, taken in the sense of a suitable norm, can be made small.     

Generalizations of theorems of Lyapunov and Stein

The matrix equation $\text{f}{}_{\mathrm{H}}\text{(A)=∑C}{}_{\mathrm{ij}}\text{A}{}^{\mathrm{1i}}\text{HA}{}^{\mathrm{j}}\text{=W, H >0}$, W ?0, is studied. In the case A¹H+HA = W[H?A¹HA = W], the controllability matrix of (A¹,W) is used to determine the number of eigenvalues of A on the imaginary axis [on the unit circle]. As an application a result of Pták on the critical exponent of the spectral norm is obtained. Estimates for the eigenvalues of A satisfying f_H(A) = M are given.