Corrections: on a question of boyle and handelman concerning eigenvalues of nonnegative matrices

Professor Raphale Leowy, of the Technion-Israel Institute of Technology in Haifa, has informed us that the assumptions that we made in the statement of Theorem I (which appeared in Volume 36. 1993, 125-140) concerning the case when n≥5 are weaker that those than we made use of in the proof of the theorem. Thus without a change in the proof, only the following result is correctly proved in the theorem:     

A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces

We give a simple proof of the fact (which follows from the Robertson–Seymour theory) that a graph which is minimal of genusgcannot contain a subdivision of a large grid. Combining this with the tree-width theorem and the quasi-wellordering of graphs of bounded tree-width in the Robertson–Seymour theory, we obtain a simpler proof of the generalized Kuratowski theorem for each fixed surface. The proof requires no previous knowledge of graph embeddings.     

Hahn–Banach extension theorems for multifunctions revisited

Several generalizations of the Hahn–Banach extension theorem to K-convex multifunctions were stated recently in the literature. In this note we provide an easy direct proof for the multifunction version of the Hahn–Banach–Kantorovich theorem and show that in a quite general situation it can be obtained from existing results. Then we derive the Yang extension theorem using a similar proof as well as a stronger version of it using a classical separation theorem. Moreover, we give counterexamples to several extension theorems stated in the literature. Dedicated to Jean-Paul Penot with the occasion of his retirement.     

Estimates of the number of zeros of some functions with algebraic Taylor coefficients

We prove two theorems about the number of zeros of analytic functions from certain classes that include the SiegelE-andG-functions. By using these theorems, we arrive at a new proof of the Gel'fond-Schneider theorem and improve the result that the numerical determinant does not vanish in the proof of the Shidlovskii theorem. Translated fromMatematicheskie Zametki, Vol. 61, No. 6, pp. 817–824, June, 1997. Translated by M. A. Shishkova     

Remarks on a Theorem of Amitsur

Amitsur proved the following theorem for an uncountable field k: Let A be a k-algebra, then any finite-dimensional nil subspace of A has bounded index, and any finite dimensional algebraic subspace of A has bounded degree. Here we give a new proof of Amitsur's theorem, a proof which is more elementary and direct, than Amitsur's original proof.     

A stability criterion

We come up with an independent proof for a corollary to the main theorem in [1]. This corollary is the degenerate case of the main theorem (with empty sets B ₀ and B ₁) and establishes a stability criterion for a Henselian valued field. Such a proof is given here based on an analysis of tame and purely wild extensions made in [2].     

Extending the Greene-Kleitman theorem to directed graphs

The celebrated Dilworth theorem (Ann. of Math. 51 (1950), 161–166) on the decomposition of finite posets was extended by Greene and Kleitman (J. Combin. Theory Ser. A 20 (1976), 41–68). Using the Gallai-Milgram theorem (Acta Sci. Math. 21 (1960), 181–186) we prove a theorem on acyclic digraphs which contains the Greene-Kleitman theorem. The method of proof is derived from M. Saks' elegant proof (Adv. in Math. 33 (1979), 207–211) of the Greene-Kleitman theorem.     

Zariski density in lie groups

In [7] Furstenberg gave a proof of Borel’s density theorem [1], which depended not on complete reducibility but rather on properties of the action of a minimally almost periodic group on projective space. In [9] and [10] the basic idea of this proof was extended in various ways to deal with other particular classes of Lie groupsG and closed subgroupsH of cofinite volume. In [5] Dani gives a more general form of the density theorem in whichH need only be non-wandering. In the present paper we define the condition ofk-minimal quasiboundedness, and prove that this condition is necessary and sufficient for the density theorem to hold ((2.4) and (2.6)). Here we replace the arguments of [9] and [10] simply by proofs that the groups considered there satisfy this condition (2.10). We extend the results of [9] and [10] by considering groups which are analytic rather than algebraic, and in the solvable case we completely characterize thek-minimally quasibounded groups (2.9). In the last section we give two applications of the density theorem.     

TheK-theory of finite fields, revisited

A new, short proof is given for the Quillen theorem that calculates theK-theory of finite fields. This proof uses the Gabber rigidity theorem and the homotopy theory of simplicial presheaves.Research supported by NSERC.     

Dense Families of Selections and Finite-Dimensional Spaces

A characterization of n-dimensional spaces via continuous selections avoiding Z _n -sets is given, and a selection theorem for strongly countable-dimensional spaces is established. We apply these results to prove a generalized Ostrand's theorem, and to obtain a new alternative proof of the Hurewicz formula. It is also shown that our selection theorem yields an easy proof of a Michael's result.     

Rédei’s Theorem is a Consequence of its (p, p) Special Case and Hajós’ Theorem

In the paper we reduce Rédei’s theorem to its (p, p) special case using Hajós’ theorem. The paper also contains a proof for the (p, p) case.     

The Passage Time Distribution for a Birth-and-Death Chain: Strong Stationary Duality Gives a First Stochastic Proof

A well-known theorem usually attributed to Keilson states that, for an irreducible continuous-time birth-and-death chain on the nonnegative integers and any d, the passage time from state 0 to state d is distributed as a sum of d independent exponential random variables. Until now, no probabilistic proof of the theorem has been known. In this paper we use the theory of strong stationary duality to give a stochastic proof of a similar result for discrete-time birth-and-death chains and geometric random variables, and the continuous-time result (which can also be given a direct stochastic proof) then follows immediately. In both cases we link the parameters of the distributions to eigenvalue information about the chain. We also discuss how the continuous-time result leads to a proof of the Ray–Knight theorem. Intimately related to the passage-time theorem is a theorem of Fill that any fastest strong stationary time T for an ergodic birth-and-death chain on {0,…,d} in continuous time with generator G, started in state 0, is distributed as a sum of d independent exponential random variables whose rate parameters are the nonzero eigenvalues of −G. Our approach yields the first (sample-path) construction of such a T for which individual such exponentials summing to T can be explicitly identified. Research of J.A. Fill was supported by NSF grant DMS–0406104 and by The Johns Hopkins University’s Acheson J. Duncan Fund for the Advancement of Research in Statistics.     

A constructive proof of Tucker's combinatorial lemma

Tucker's combinatorial lemma is concerned with certain labellings of the vertices of a triangulation of the n-ball. It can be used as a basis for the proof of antipodal-point theorems in the same way that Sperner's lemma yields Brouwer's theorem. Here we give a constructive proof, which thereby yields algorithms for antipodal-point problems. Our method is based on an algorithm of Reiser.     

Expansion properties of random Cayley graphs and vertex transitive graphs via matrix martingales

The Alon–Roichman theorem states that for every ε> 0 there is a constant c(ε), such that the Cayley graph of a finite group G with respect to c(ε)log ∣G∣ elements of G, chosen independently and uniformly at random, has expected second largest eigenvalue less than ε. In particular, such a graph is an expander with high probability. Landau and Russell, and independently Loh and Schulman, improved the bounds of the theorem. Following Landau and Russell we give a new proof of the result, improving the bounds even further. When considered for a general group G, our bounds are in a sense best possible. We also give a generalization of the Alon–Roichman theorem to random coset graphs. Our proof uses a Hoeffding‐type result for operator valued random variables, which we believe can be of independent interest. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2008     

Generalized quadrangles in finite projective spaces

If a pointset of the projective spacePG(d,q), together with a lineset ofPG(d,q) form a generalized quadrangleS, thenS is of classical type. This beautiful theorem was proved by F. Buekenhout and C. Lefèvre. In this paper we give a simple proof of this theorem in the cased 4 (we suppose that the result is established ford = 3). We remark that in our proof a central role is played by the theory of subquadrangles.     

Elements of the KKM theory for generalized convex spaces

In the present paper, we introduce fundamental results in the KKM theory for G-convex spaces which are equivalent to the Brouwer theorem, the Sperner lemma, and the KKM theorem. Those results are all abstract versions of known corresponding ones for convex subsets of topological vector spaces. Some earlier applications of those results are indicated. Finally, we give a new proof of the Himmelberg fixed point theorem andG-convex space versions of the von Neumann type minimax theorem and the Nash equilibrium theorem as typical examples of applications of our theory.     

An Algebraic Proof of Barlet's Join Theorem

In this article we give an algebraic proof of Barlet's join theorem, using an improved version of an algorithm for computing the join that was presented in (J. Dalbec and B. Sturmfels,in“Invariant Methods in Discrete and Computational Geometry, Curaçao, 1994,” pp. 37–58, Kluwer Academic, Dordrecht, 1995). The improvements in the algorithm consist of proving the correctness of the algorithm in large prime characteristics and giving explicit formulas for the functionsp(q,L) that were left unspecified in the original. The first three sections are largely expository; the fourth presents the modified algorithm and the proof of the main theorem. The last section gives an example of the algorithm; unfortunately, the complexity of the process makes it difficult to compute anything without resorting to tricky shortcuts, as we do in the example.     

Convergence of Ishikawa Iterates for a Multi-Valued Mapping with a Fixed Point

Existence of fixed points of multivalued mappings that satisfy a certain contractive condition was proved by N. Mizoguchi and W. Takahashi. An alternative proof of this theorem was given by Peter Z. Daffer and H. Kaneko. In the present paper, we give a simple proof of that theorem. Also, we define Mann and Ishikawa iterates for a multivalued map T with a fixed point p and prove that these iterates converge to a fixed point q of T under certain conditions. This fixed point q may be different from p. To illustrate this phenomenon, an example is given. This work is supported by the U. G. C. Grant No. U4/4997/97-98. G. V. R. Babu thanks the University Grants Commission, India for the financial support.     

Walker's Cancellation Theorem

Walker's cancellation theorem says that, if B ⊕ Z is isomorphic to C ⊕ Z in the category of abelian groups, then B is isomorphic to C. We construct an example in a diagram category of abelian groups where the theorem fails. As a consequence, the original theorem does not have a constructive proof even if B and C are subgroups of the free abelian group on two generators. Both of these results contrast with a group whose endomorphism ring has stable range one, which allows a constructive proof of cancellation and also a proof in any diagram category.     

Characters,genericity, and multiplicity one for U(3)

Let ψ:U→ℂ be a generic character of the unipotent radicalU of a Borel subgroup of a quasisplitp-adic groupG. The number (0 or 1) of ψ-Whittaker models on an admissible irreducible representation π ofG was expressed by Rodier in terms of the limit of values of the trace of π at certain measures concentrated near the origin. An analogous statement holds in the twisted case. This twisted analogue is used in [F, p. 47] to provide a local proof of the multiplicity one theorem for U(3). This assert that each discrete spectrum automorphic representation of the quasisplit unitary group U(3) associated with a quadratic extensionE/F of number fields occurs in the discrete spectrum with multiplicity one. It is pointed out in [F, p. 47] that a proof of the twisted analogue of Rodier's theorem does not appear in print. It is then given below. Detailing this proof is necessitated in particular by the fact that the attempt in [F, p. 48] at a global proof of the multiplicity one theorem for U(3), although widely quoted, is incomplete, as we point out here. Partially supported by a Lady Davis Visiting Professorship at the Hebrew University and the Max-Planck-Institut für Mathematik, Bonn.