On a theorem of lovász on covers inr-partite hypergraphs

A theorem of Lovász asserts that (H)/*(H)r/2 for everyr-partite hypergraphH (where and * denote the covering number and fractional covering number respectively). Here it is shown that the same upper bound is valid for a more general class of hypergraphs: those which admit a partition (V ₁, ...,V _k ) of the vertex set and a partitionp ₁+...+p _k ofr such that |eV _i |p _i r/2 for every edgee and every 1ik. Moreover, strict inequality holds whenr>2, and in this form the bound is tight. The investigation of the ratio /* is extended to some other classes of hypergraphs, defined by conditions of similar flavour. Upper bounds on this ratio are obtained fork-colourable, stronglyk-colourable and (what we call)k-partitionable hypergraphs.Supported by grant HL28438 at MIPG, University of Pennsylvania, and by the fund for the promotion of research at the Technion.This author's research was supported by the fund for the promotion of research at the Technion.     

On weak structures of Császár

We further extend the study of weak structures and m-structures defined on a set X and prove that an m-structure generates a finer topology.     

On a Theorem of Milin

Let S be class of functions f(z)=z a_2 z~2 … analytic and univalent in the unit disk D, and let 1.M.Milin proved that Theorem A. If f∈S and then where d_o(h)=1and In fact,the result is deduced from Milan′s Tauberian Theorem. Here     

On a Theorem of Drasin

D. Drasin in 1969 proved that a family of holomorphic functions is normal ifevery function in the family satisfies f' - af~3≠b, where a and b are two complexnumbers and a≠0. Now, we obtain two improvements of this criterion. Theorem 1 A family {f} of holomorphic functions is normal if every functionin {f} satisfies     

On a Generalization of Szász–Mirakjan–Kantorovich Operators

In this paper we introduce and study a sequence of positive linear operators acting on suitable spaces of measurable functions on [0,+∞[, including L ^p ([0,+∞[) spaces, 1 ≤ p < +∞, as well as continuous function spaces with polynomial weights. These operators generalize the Szász–Mirakjan–Kantorovich operators and they allow to approximate (or to reconstruct) suitable measurable functions by knowing their mean values on a sequence of subintervals of [0,+∞[ that do not constitute a subdivision of it. We also give some estimates of the rates of convergence by means of suitable moduli of smoothness.     

On the Generalized Szász–Mirakyan Operators

In this paper, we construct sequences of Szász–Mirakyan operators which are based on a function ρ. This function not only characterizes the operators but also characterizes the Korovkin set ${\left \{ 1,\rho ,\rho ^{2} \right \}}$ in a weighted function space. We give theorems about convergence of these operators to the identity operator on weighted spaces which are constructed using the function ρ and which are subspaces of the space of continuous functions on ${\mathbb{R} ^{+}}$ . We give quantitative type theorems in order to obtain the degree of weighted convergence with the help of a weighted modulus of continuity constructed using the function ρ. Further, we prove some shape-preserving properties of the operators such as the ρ-convexity and the monotonicity. Our results generalize the corresponding ones for the classical Szász operators.     

On a Proof of Roth''''s Theorem

We denote by M_(n,m)(F) the set of all n×m matrices over the field F and by M_n(F) the set of all n×n matrices over the field F. W. E. Roth has shown the following theorem in 1952, [1]. Theorem Let A∈M_n(F),B∈M_m(F) and C∈M_(n,m)(F), then the matrix equation AX-YB=C (1) has a solution X, Y∈M_(n,m)(F) if and only if the matrices     

On the Lovász theta function and some variants

The Lovász theta function of a graph is a well-known upper bound on the stability number. It can be computed efficiently by solving a semidefinite program (SDP). Actually, one can solve either of two SDPs, one due to Lovász and the other to Grötschel et al. The former SDP is often thought to be preferable computationally, since it has fewer variables and constraints. We derive some new results on these two equivalent SDPs. The surprising result is that, if we weaken the SDPs by aggregating constraints, or strengthen them by adding cutting planes, the equivalence breaks down. In particular, the Grötschel et al. scheme typically yields a stronger bound than the Lovász one.     

Spectral Characterizations of the Lovász Number and the Delsarte Number of a Graph

This paper gives spectral characterizations of two closely related graph functions: the Lovász number and a generalization ¹ of Delsarte's linear programming bound. There are many known characterizations of the Lovász number , and each one corresponds to a similar characterization of ¹ obtained by extremizing over a larger or smaller class of objects.The spectral characterizations of and ¹ given here involve the largest eigenvalue of a type of weighted Laplacian that Fan Chung introduced.     

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.     

Erratum to “On a Classical Theorem on the Diameter and Minimum Degree of a Graph”

The original version of the article was published in[1]. Unfortunately, the original version of this article contains a mistake:in Theorem 6.2 appears that β(n, Δ)=(n-Δ+5)/4 but the correct statement is β(n, Δ)=(n-Δ+4)/4. In this erratum we correct the theorem and give the correct proof.     

On a Generalization of Voronin’s Theorem

Mathematical Notes - Voronin’s theorem states that the Riemann zeta-function ζ(s) is universal in the sense that all analytic functions that are defined and have no zeros on the right...     

On a problem of Erdős and Lovász: Random lines in a projective plane

Letn(k) be the least size of an intersecting family ofk-sets with cover numberk, and let _k denote any projective plane of orderk–1.Theorem There is a constant A such that ifH is a random set ofm Aklogk lines from _k then P_r(H<)0(k).Corollary If there exists a _k thenn(k)=O(klogk). These statements were conjectured by P. Erds and L. Lovász in 1973.Supported in part by NSF-DMS87-83558 and AFOSR grants 89-0066, 89-0512 and 90-0008