The 1-width of (0,1)-matrices having constant row sum 3

In this note we establish upper bounds for the 1-width of an m × n matrix of 0's and 1's having three 1's in every row and having a constant number, c, of 1's in every column. When c = 3, this upper bound is $\text{n}\text{2}$ and when c = 4 this estimate is $\text{5n}\text{9}$. In these cases the upper bound is best possible, in the sense that for every possible size there exist matrices with this maximal 1-width. The technique of proof is also used to improve the known bound for the 1-width of (0, 1)-matrices with constant line sum 4.     

Bounds for the variance of certain stationary point processes

For the variance of stationary renewal and alternating renewal processes N_n(·) the paper establishes upper and lower bounds of the form

$\text{?B}{}_1\text{?varN}{}_8\text{(0,x–Aλx?B}{}_2\text{(0<x<∞)}$

, where λ=EN₈(0,1), with constants A, B₁ and B₂ that depend on the first three moments of the interval distributions for the processes concerned. These results are consistent with the value of the constant A for a general stationary point process suggested by Cox in 1963 [1].     

On polyhedra of Perron-Frobenius eigenvectors

This paper deals with the positive eigenvectors of nonnegative irreducible matrices which are merely characterized by a given upper bound u on their spectral radius and by a given matrix L of lower bounds for their elements. For any such matrix, the normalized positive left [right] eigenvector is shown to belong to the polyhedron the vertices of which are given by the normalized rows [columns] of the matrix $\text{(u}\text{I}\text{?}\text{L}\text{)}{}^{\mathrm{?1}}$. This polyhedron is proven to be also the smallest closed set which is guaranteed to contain the positive left [right] normalized eigenvector; its vertices are therefore the best componentwise bounds one can obtain on the positive eigenvectors of these matrices. A less general result has also been obtained for the symmetrical case, when the matrices are only characterized by a given lower bound l on their spectral radius and by a given matrix U of upper bounds for their elements.     

Lower bounds for combinatorial problems on graphs

Nontrivial lower bounds are given for the computation time of various combinatorial problems on graphs under a linear or algebraic decision tree model. An $\text{Ω(n}{}^3\text{log}\text{n)}$ bound is obtained for a “travelling salesman problem” on a weighted complete graph of n vertices. Moreover it is shown that the same bound is valid for the “subgraph detection problem” with respect to property P if P is hereditary and determined by components. Thus an $\text{Ω(n}{}^3\text{log}\text{n)}$ bound is established in a unified way for a rather large class of problems.     

Lower bounds on the independence number in terms of the degrees

Wei discovered that the independence number of a graph G is at least Σ_v(1 + d(v))^?1. It is proved here that if G is a connected triangle-free graph on n ≥ 3 vertices and if G is neither an odd cycle nor an odd path, then the bound above can be increased by $\text{n}\text{Δ(Δ + 1)}$, where Δ is the maximum degree. This new bound is sharp for even cycles and for three other graphs. These results relate nicely to some algorithms for finding large independent sets. They also have a natural matrix theory interpretation. A survey of other known lower bounds on the independence number is presented.     

General forbidden configuration theorems

Results in this paper gives bounds on the number of columns in a matrix when certain submatrices are forbidden. Let F be a k by l (0, 1)-matrix with no repeated columns, column sums at least s. Let A be a m by n (0, 1)-matrix with no repeated column, column sums at least s and no submatrix F nor any row and column permutation of F. Then $\text{n?(}\text{m}\text{k?1}\text{) + (}\text{m}\text{k?2}\text{) + ? + (}\text{m}\text{s}\text{)}$. This bound is best possible for numerous F. The bound, with s = 0, is an easy corollary to a bound of Sauer and Perles and Shelah. The bounds can be extended to any F and to any F where we do not allow row and column permutations. The results follow from a configuration theorem that says, in essence, that matrices without a configuration are determined by row intersections of sets of rows of various sizes. A linear independence argument yields the bound. Results of Ryser, Frankl and Pach, Quinn and the author are obtained.     

On the first factor of the class number of prime cyclotomic fields

Let H(l) be the first factor of the class number of the field $\text{Q}$(exp 2πi/l), l a prime. The best-known upper and lower bounds on H(l) are improved for small l. The methods would also improve the best-known bounds for large l. It is shown that H(l) is the absolute value of the determinant of an easily written down matrix whose only entries are 0 and 1. The upper bounds obtained on H(l) significantly improve the Hadamard bound on the determinant of this matrix. Results of Lehmer on the factors of H(l) are explained via class field theory.     

Bounds on the number of switchings for trajectories of piecewise analytic vector fields

We study the trajectories of systems $\text{x}\text{?}\text{= X(x)}$, where X is a continuous “extendably piecewise analytic” vector field, i.e., a continuous vector field X such that the domain of ? admits a locally finite partition $\text{I}$ into sets such that for each A ∈ $\text{I}$ there is a vector field X_A which is analytic on a neighborhood of the closure of A and whose restriction to A coincides with that of X. We prove that the trajectories are piecewise analytic, with a priori bounds on the number of switchings for all trajectories that stay in a fixed compact set and whose duration does not exceed a fixed number T. This result implies the existence of a regular synthesis for optimal control problems with a strictly convex Lagrangian, and a linear dynamics with polyhedral constraints on the controls.     

A lower bound for v in a t − (v,k, λ) design

In this paper it is shown that if v ? k + 1 then $\text{v ? t ? 1 + (k ? t + 1)(k ? t + 2)}\text{λ}$, where v, k, λ and t are the characteristic parameters of a t ? (v, k, λ) design. We compare this bound with the known lower bounds on v.     

Multipliers of Sobolev spaces

Let W^m,p denote the Sobolev space of functions on $\text{R}$ⁿ whose distributional derivatives of order up to m lie in L^p($\text{R}$ⁿ) for 1 ? p ? ∞. When 1 < p < ∞, it is known that the multipliers on W^m,p are the same as those on L^p. This result is true for p = 1 only if n = 1. For, we prove that the integrable distributions of order ?1 whose first order derivatives are also integrable of order ?1, belong to the class of multipliers on W^m,1 and there are such distributions which are not bounded measures. These distributions are also multipliers on L^p, for 1 < p < ∞. Moreover, they form exactly the multiplier space of a certain Segal algebra. We have also proved that the multipliers on W^m,l are necessarily integrable distributions of order ?1 or ?2 accordingly as m is odd or even. We have obtained the multipliers from L¹($\text{R}$ⁿ) into W^m,p, 1 ? p ? ∞, and the multiplier space of W^m,1 is realised as a dual space of certain continuous functions on $\text{R}$ⁿ which vanish at infinity.     

Estimates for the number of sums and products and for exponential sums over subgroups in fields of prime order

Our first result is a ‘sum–product’ theorem for subsets A of the finite field $\text{F}{}_{\mathrm{p}}$, p prime, providing a lower bound on max(|A+A|,|A·A|). As corollary, the second and main result provides new bounds on exponential sums associated to subgroups of the multiplicative group $\text{F}{}^1{}_{\mathrm{p}}$. To cite this article: J. Bourgain, S.V. Konyagin, C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

On the enumeration of finite maximal connected topologies

A connected topology $\text{T}$ is said to be maximal connected if $\text{U}$ strictly finer than $\text{T}$ implies that $\text{U}$ is disconnected. In this paper, it is shown that the number of homeomorphism classes of maximal connected topologies defined on a set with n points is equal to twice the number of n point trees minus the number of n point trees possessing a symmetry line. An enumeration of a class called critical connected topologies, which includes the maximal connected spaces is then carried out with the help of Pólya's theorem. Another result is that a chain of connected n point T₀ topologies, linearly ordered by strict fineness, can contain a maximum of $\text{1}\text{2}\text{(n}{}^2\text{? 3n + 4)}$ topologies, and, moreover, this number is the best possible upper bound for the length of such a chain.     

On the convergence of the symmetric successive overrelaxation method

The symmetric successive overrelaxation (SSOR) iterative method is applied to the solution of the system of linear equations $\text{A}\text{x}\text{=}\text{b}$, where A is an n×n nonsingular matrix. We give bounds for the spectral radius of the SSOR iterative matrix when A is an Hermitian positive definite matrix, and when A is a nonsingular M-matrix. Then, we discuss the convergence of the SSOR iterative method associated with a new splitting of the matrix A which extends the results of Varga and Buoni [1].     

On the accuracy of the Gerschgorin circle theorem for bounding the spread of a real symmetric matrix

The spread of a matrix with real eigenvalues is the difference between its largest and smallest eigenvalues. The Gerschgorin circle theorem can be used to bound the extreme eigenvalues of the matrix and hence its spread. For nonsymmetric matrices the Gerschgorin bound on the spread may be larger by an arbitrary factor than the actual spread even if the matrix is symmetrizable. This is not true for real symmetric matrices. It is shown that for real symmetric matrices (or complex Hermitian matrices) the ratio between the bound and the spread is bounded by $\text{p+1}$, where p is the maximum number of off diagonal nonzeros in any row of the matrix. For full matrices this is just $\text{n}$. This bound is not quite sharp for n greater than 2, but examples with ratios of $\text{n?1}$ for all n are given. For banded matrices with m nonzero bands the maximum ratio is bounded by $\text{m}$ independent of the size of n. This bound is sharp provided only that n is at least 2m. For sparse matrices, p may be quite small and the Gerschgorin bound may be surprisingly accurate.     

Bernstein's asymptotic best bound for the Kth derivative of a polynomial

A complete proof, which yields an error term showing a dependence on n and x, is given for Bernstein's result that the best bound on the kth derivative on polynomials of degree less than or equal to n, at a point x in ( ?1, 1), is asymptotic to $\text{(}\text{n}\text{√1 ? x}{}^2\text{)}{}^{\mathrm{k}}$ as n tends to infinity.     

The binding number of a graph and its Anderson number

The binding number of a graph G, bind(G), is defined; some examples of its calculation are given, and some upper bounds for it are proved. It is then proved that, if bind(G) ≥ c, then G contains at least $\text{|G|}\text{c}\text{(c + 1)}$ disjoint edges if $\text{0 ≤ c ≤}\text{1}\text{2}$, at least $\text{| G |}\text{(3c ? 2)}\text{3c}\text{?}\text{2(c ? 1)}\text{c}$ disjoint edges if $\text{1 ≤ c ≤}\text{4}\text{3}$, a Hamiltonian circuit if $\text{c ≥}\text{3}\text{2}$, and a circuit of length at least $\text{3(| G | ?1)(c ? 1)}\text{c}$ if $\text{1 < c ≤}\text{3}\text{2}$ and G is not one of two specified exceptional graphs. Each of these results is best possible.The Anderson number of a graph is defined. The Anderson numbers of a few very simple graphs are determined; and some rather weak bounds are obtained, and some conjectures made, on the Anderson numbers of graphs in general.     

Lower bounds for the distributions of certain multivariate test statistics

A lower (upper) bound is given for the distribution of each d_j, j = k + 1, …, p (j = 1, …, s), the jth latent root of AB^?1, where A and B are independent noncentral and central Wishart matrices having $\text{W}{}_{\mathrm{p}}\text{(q, Σ; Ω)}$ with rank $\text{(Ω) ≤ k = p ? s}$ and W_p(n, Σ), respectively. Similar bound are also given for the distributions of noncentral means and canonical correlations. The results are applied to obtain lower bounds for the null distributions of some multivariate test statistics in Tintner's model, MANOVA and canonical analysis.     

On the sum of cardinalities of extremum maximal independent sets

Upper bounds are established for the sum of the smallest and largest cardinalities of maximal independent sets in simple undirected graphs with p vertices and minimum degree k, for the cases k = 1, 2 and $\text{k ?}\text{1}\text{2}\text{p}$.     

Extremal values of the interval number of a graph,II

It is shown that the interval number of a graph on n vertices is at most $\text{[}\text{1}\text{4}\text{(n+1)]}$, and this bound is best possible. This means that we can represent any graph on n vertices as an intersection graph in which the sets assigned to the vertices each consist of the union of at most $\text{[}\text{1}\text{4}\text{(n+1)]}$ finite closed intervals on the real line. This upper bound is attained by the complete bipartite graph K_[n/2],[n/2].