On a theorem about projectivities

The main result of this paper is a theorem about projectivities in then-dimensional complex projective spaceP ⁿ (n 2). Puttingn = 2, we showed in [3] that the theorem of Desargues inP ⁿ is a special case of this theorem. And not only the theorem of Desargues but also the converse of the theorem of Pascal, the theorem of Pappus-Pascal, the theorem of Miquel, the Newton line, the Brocard points and a lot of lesser known results in the projective, the affine and the Euchdean plane were obtained from this theorem as special cases without any further proof. Many extensions of classical theorems in the projective, affine and Euclidean plane to higher dimensions can be found in the literature and probably some of these are special cases of this theorem inP ⁿ. We only give a few examples and leave it as an open problem which other special cases could be found.     

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.     

Unique continuous selections for metric projections of C(X) onto finite-dimensional vector subspaces, II

Best approximation in C(X) by elements of a Chebyshev subspace is governed by Haar's theorem, the de la Vallée Poussin estimates, the alternation theorem, the Remez algorithm, and Mairhuber's theorem. J. Blatter (1990, J. Approx. Theory 61, 194–221) considered best approximation in C(X) by elements of a subspace whose metric projection has a unique continuous selection and extended Haar's theorem and Mairhuber's theorem to this situation. In the present paper we so extend the de la Vallée Poussin estimates, the alternation theorem, and the Remez algorithm.     

The weak isovariant Borsuk-Ulam theorem for compact Lie groups

In this paper we shall deal with a weak version of the Borsuk-Ulam theorem for G-isovariant maps, which we call the weak isovariant Borsuk-Ulam theorem. One of the results is that the weak isovariant Borsuk-Ulam theorem in linear G-spheres holds for an arbitrary compact Lie group G. On the contrary the weak isovariant Borsuk-Ulam theorem in semilinear G-(homology) spheres holds if and only if G is solvable. Received: 2 April 2002     

Punktprozesse mit Wechselwirkung

We consider classical, continuous systems of particles in r dimensions described by infinite system equilibrium states which have been defined by Dobrushin [5] and Lanford/Ruelle [24]. For a large class of potentials we prove the theorem of Lee/Yang [43] together with a variational characterizafor these equilibrium states. The main idea stems from Föllmer [9] who showed that in the case of lattice systems, the theorem of Lee/Yang is intimately related to Birkhoff's ergodic theorem and McMillan's theorem (ergodic theorem of information theory). Following this idea we obtain as main results an r-dimensional ergodic theorem for random measures in ^r , limit theorems concerning energy and entropy and an r-dimensional version of Breiman's theorem showing that there is almost sure convergence behind McMillan's theorem.

---

---

Danken möchten wir Klaus Krickeberg, der diese Arbeit durch eine Fülle wertvoller Hinweise und Anregungen gefördert hat.     

On the Equivalence and Generalized of Weyl Theorem Weyl Theorem

We know that an operator T acting on a Banach space satisfying generalized Weyl＇s theorem also satisfies Weyl＇s theorem. Conversely we show that if all isolated eigenvalues of T are poles of its resolvent and if T satisfies Weyl＇s theorem, then it also satisfies generalized Weyl＇s theorem. We give also a sinlilar result for the equivalence of a-Weyl＇s theorem and generalized a-Weyl＇s theorem. Using these results, we study the case of polaroid operators, and in particular paranormal operators.     

A theorem on the absolute Cesàro summability of factored fourier series

Summary In this paper, the author proves a theorem on the absoluteCesàro summability of factoredFourier series. His theorem extends a theorem ofMatsumoto and generalizes a theorem ofPrasad andBhatt.     

Subdirectly Irreducible Double Demi-p-Lattices

The aim of this paper is to give a characterization of the (finitely) subdirectly irreducible double demi-p-lattices. First, we prove a congruence representation theorem for double demi-p-lattices, which is a natural analogue of the theorem given in [2] for double p-algebras. These results are inspired by the representation theorem given by Lakser [6] for p-algebras, and yield a natural approach to the study of subdirectly irreducible algebras.     

Independence numbers of graphs and generators of ideals

This article investigates the generators of certain homogeneous ideals which are associated with graphs with bounded independence numbers. These ideals first appeared in the theory oft-designs. The main theorem suggests a new approach to the Clique Problem which isNP-complete. This theorem has a more general form in commutative algebra dealing with ideals associated with unions of linear varieties. This general theorem is stated in the article; a corollary to it generalizes Turán’s theorem on the maximum graphs with a prescribed clique number. Research supported in part by NSF Grant MCS77-03533.     

Classical and approximate sampling theorems; studies in the and the uniform norm

The approximate sampling theorem with its associated aliasing error is due to J.L. Brown (1957). This theorem includes the classical Whittaker–Kotel’nikov–Shannon theorem as a special case. The converse is established in the present paper, that is, the classical sampling theorem for , 1p<∞, w>0, implies the approximate sampling theorem. Consequently, both sampling theorems are fully equivalent in the uniform norm.Turning now to -space, it is shown that the classical sampling theorem for , 1<p<∞ (here p=1 must be excluded), implies the -approximate sampling theorem with convergence in the -norm, provided that f is locally Riemann integrable and belongs to a certain class Λ^p. Basic in the proof is an intricate result on the representation of the integral as the limit of an infinite Riemann sum of |f|^p for a general family of partitions of ; it is related to results of O. Shisha et al. (1973–1978) on simply integrable functions and functions of bounded coarse variation on . These theorems give the missing link between two groups of major equivalent theorems; this will lead to the solution of a conjecture raised a dozen years ago.     

Degree Sequences and the Existence of <Emphasis Type="Italic">k</Emphasis>-Factors

We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note that previous work on degrees and factors has focused primarily on finding conditions for a degree sequence to be potentially k-factor graphical. We first give a theorem for π to be forcibly 1-factor graphical and, more generally, forcibly graphical with deficiency at most β ≥ 0. These theorems are equal in strength to Chvátal’s well-known hamiltonian theorem, i.e., the best monotone degree condition for hamiltonicity. We then give an equally strong theorem for π to be forcibly 2-factor graphical. Unfortunately, the number of nonredundant conditions that must be checked increases significantly in moving from k = 1 to k = 2, and we conjecture that the number of nonredundant conditions in a best monotone theorem for a k-factor will increase superpolynomially in k. This suggests the desirability of finding a theorem for π to be forcibly k-factor graphical whose algorithmic complexity grows more slowly. In the final section, we present such a theorem for any k ≥ 2, based on Tutte’s well-known factor theorem. While this theorem is not best monotone, we show that it is nevertheless tight in a precise way, and give examples illustrating this tightness.     

Uniform convergence of fuzzy random renewal process

Recently, Zhao et al. (in Fuzzy Optimization and Decision Making 2007 6, 279–295) presented a fuzzy random elementary renewal theorem and fuzzy random renewal reward theorem in the fuzzy random process. In this paper, we study the convergence of fuzzy random renewal variable and of the total rewards earned by time t with respect to the extended Hausdorff metrics d _∞ and d ₁. Using this convergence information and applying the uniform convergence theorem, we provide some new versions of the fuzzy random elementary renewal theorem and the fuzzy random renewal reward theorem.     

A Criterion for Designs in ℤ4-codes on the Symmetrized Weight Enumerator

The Assmus–Mattson theorem is known as a method to find designs in linear codes over a finite field. It is an interesting problem to find an analog of the theorem for Z ₄-codes. In a previous paper, the author gave a candidate of the theorem. The purpose of this paper is to give an improvement of the theorem. It is known that the lifted Golay code over Z ₄ contains 5-designs on Lee compositions. The improved method can find some of those without computational difficulty and without the help of a computer.     

Positive solutions for quasilinear second order differential equation

It is well known that the Krasnoselskii's fixed point theorem is very very important. It was extensively used for studying the boundary value problems. In this article, the Krasnoselskii's fixed point theorem is extended. The new fixed point theorem is obtained. The second order quasilinear differential equation (Φ (y′))′+a(t)f(t,y,y′)=0,, 0<t<1 subject to mixed boundary condition is studied, where f is a nonnegative continuous function, Φ (v)= |v|^p-2 v, p>1. We show the existence of at least one positive solution by using the new fixed point theorem in cone.     

Re-extending Chebyshev’s theorem about Bertrand’s conjecture

In this paper, Chebyshev’s theorem (1850) about Bertrand’s conjecture is re-extended using a theorem about Sierpinski’s conjecture (1958). The theorem had been extended before several times, but this extension is a major extension far beyond the previous ones. At the beginning of the proof, maximal gaps table is used to verify initial states. The extended theorem contains a constant r, which can be reduced if more initial states can be checked. Therefore, the theorem can be even more extended when maximal gaps table is extended. The main extension idea is not based on r, though. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 59, No. 12, pp. 1701–1706, December, 2007.     

Extending partial isomorphisms on finite structures

We prove the following theorem:Let A be a finite structure in a fixed finite relational language,p ₁,...,p _m partial isomorphisms of A. Then there exists a finite structure B, and automorphismsf _i of B extending thep _i 's. This theorem can be used to prove the small index property for the random structure in this language. A special case of this theorem is, if A and B are hypergraphs. In addition we prove the theorem for the case of triangle free graphs.     

Towards variational analysis in metric spaces: metric regularity and fixed points

The main results of the paper include (a) a theorem containing estimates for the surjection modulus of a “partial composition” of set-valued mappings between metric spaces which contains as a particlar case well-known Milyutin’s theorem about additive perturbation of a mapping into a Banach space by a Lipschitz mapping; (b) a “double fixed point” theorem for a couple of mappings, one from X into Y and another from Y to X which implies a fairly general version of the set-valued contraction mapping principle and also a certain (different) version of the first theorem.     

The Gauss-Bonnet theorem for vector bundles

We give a short proof of the Gauss-Bonnet theorem for a real oriented Riemannian vector bundle E of even rank over a closed compact orientable manifold M. This theorem reduces to the classical Gauss-Bonnet-Chern theorem in the special case when M is a Riemannian manifold and E is the tangent bundle of M endowed with the Levi-Civita connection. The proof is based on an explicit geometric construction of the Thom class for 2-plane bundles. Dedicated to the memory of Philip Bell Research partially supported by NSF grant DMS-9703852.     

ON INESSENTIAL IDEALS IN BANACH ALGEBRAS

Abstract

In [2], Aupetit studied the perturbation of elements of a Banach algebra A by elements of an inessential ideal I of A. The main result of his paper is based on a lemma ([2], theorem 1.1) obtained by the use of subharmonic methods and analytic multivalued functions. Our aim in this note is to prove Auptetit's perturbation theorem ([2], theorem 2.4) by making use of elementary methods.