An intersection theorem for four sets

Fix integers n,r?4 and let F denote a family of r-sets of an n-element set. Suppose that for every four distinct A,B,C,D∈F with |A∪B∪C∪D|?2r, we have A∩B∩C∩D≠∅. We prove that for n sufficiently large, , with equality only if _?F∈FF≠∅. This is closely related to a problem of Katona and a result of Frankl and Füredi [P. Frankl, Z. Füredi, A new generalization of the Erd?s-Ko-Rado theorem, Combinatorica 3 (3-4) (1983) 341-349], who proved a similar statement for three sets. It has been conjectured by the author [D. Mubayi, Erd?s-Ko-Rado for three sets, J. Combin. Theory Ser. A, 113 (3) (2006) 547-550] that the same result holds for d sets (instead of just four), where d?r, and for all n?dr/(d−1). This exact result is obtained by first proving a stability result, namely that if |F| is close to then F is close to satisfying _?F∈FF≠∅. The stability theorem is analogous to, and motivated by the fundamental result of Erd?s and Simonovits for graphs.     

EKR type inequalities for 4-wise intersecting families

Let 1?t?7 be an integer and let F be a k-uniform hypergraph on n vertices. Suppose that |A∩B∩C∩D|?t holds for all A,B,C,D∈F. Then we have if holds for some ε>0 and all n>n₀(ε). We apply this result to get EKR type inequalities for “intersecting and union families” and “intersecting Sperner families.”     

On the perturbation of the group generalized inverse for a class of bounded operators in Banach spaces

Given a bounded operator A on a Banach space X with Drazin inverse AD and index r, we study the class of group invertible bounded operators B such that I+AD(B−A) is invertible and R(B)∩N(Ar)={0}. We show that they can be written with respect to the decomposition X=R(Ar)⊕N(Ar) as a matrix operator, , where B₁ and are invertible. Several characterizations of the perturbed operators are established, extending matrix results. We analyze the perturbation of the Drazin inverse and we provide explicit upper bounds of ‖B^?−AD‖ and ‖BB^?−ADA‖. We obtain a result on the continuity of the group inverse for operators on Banach spaces.     

Erd?s-Ko-Rado for three sets

Fix integers k?3 and n?3k/2. Let F be a family of k-sets of an n-element set so that whenever A,B,C∈F satisfy |A∪B∪C|?2k, we have A∩B∩C≠∅. We prove that with equality only when ?_F∈FF≠∅. This settles a conjecture of Frankl and Füredi [2], who proved the result for n?k²+3k.     

Turán’s theorem inverted

In this note we complete an investigation started by Erd?s in 1963 that aims to find the strongest possible conclusion from the hypothesis of Turán’s theorem in extremal graph theory.Let be the complete r-partite graph with parts of sizes s₁≥2,s₂,…,s_r with an edge added to the first part. Letting t_r(n) be the number of edges of the r-partite Turán graph of order n, we prove that:For all r≥2 and all sufficiently small c>0, every graph of sufficiently large order n with t_r(n)+1 edges contains a .We also give a corresponding stability theorem and two supporting results of wider scope.     

No four subsets forming an N

We survey results concerning the maximum size of a family F of subsets of an n-element set such that a certain configuration is avoided. When F avoids a chain of size two, this is just Sperner's theorem. Here we give bounds on how large F can be such that no four distinct sets A,B,C,D∈F satisfy A⊂B, C⊂B, C⊂D. In this case, the maximum size satisfies , which is very similar to the best-known bounds for the more restrictive problem of F avoiding three sets B,C,D such that C⊂B, C⊂D.     

On Bernardi's integral operator and the Briot-Bouquet differential subordination

Let A,B,D,E∈[−1,1]. Conditions on A,B,D and E are determined so that

     

Chromatic Turán problems and a new upper bound for the Turán density of

We consider a new type of extremal hypergraph problem: given an r-graph and an integer k≥2 determine the maximum number of edges in an -free, k-colourable r-graph on n vertices.Our motivation for studying such problems is that it allows us to give a new upper bound for an old Turán problem. We show that a 3-graph in which any four points span at most two edges has density less than , improving previous bounds of due to de Caen [D. de Caen, Extension of a theorem of Moon and Moser on complete subgraphs, Ars Combin. 16 (1983) 5–10], and due to Mubayi [D. Mubayi, On hypergraphs with every four points spanning at most two triples, Electron. J. Combin. 10 (10) (2003)].     

Lengths of central linear generalized polynomials in matrix algebras

Let D be a division algebra finite-dimensional over its center C and let A=M_m(D), the m×m matrix ring over D. By the length of a linear generalized polynomial (GP) ?(X), we mean the least positive integer n such that ?(X) can be represented in the form for some . We denote by L(?)=n the length of ?. By a central linear GP for A we mean a nonzero linear GP with central values on A. In this paper we characterize all central linear GPs for A and determine the lengths of all central linear GPs for A.     

Essential approximate point spectra and Weyl's theorem for operator matrices

When A∈B(H) and B∈B(K) are given, we denote by MC the operator acting on the infinite dimensional separable Hilbert space H⊕K of the form . In this paper, it is shown that a 2×2 operator matrix MC is upper semi-Fredholm and ind(MC)?0 for some C∈B(K,H) if and only if A is upper semi-Fredholm and

     

Limits in compact Abelian groups

For X a compact Abelian group and B an infinite subset of its dual , let CB be the set of all x∈X such that converges to 1. If F is a free filter on , let . The sets CB and DF are subgroups of X. CB always has Haar measure 0, while the measure of DF depends on F. We show that there is a filter F such that DF has measure 0 but is not contained in any CB. This generalizes previous results for the special case where X is the circle group.     

Preservers of spectral radius, numerical radius, or spectral norm of the sum on nonnegative matrices

Let be the set of entrywise nonnegative n×n matrices. Denote by r(A) the spectral radius (Perron root) of . Characterization is obtained for maps such that r(f(A)+f(B))=r(A+B) for all . In particular, it is shown that such a map has the form

     

Finite depth and Jacobson-Bourbaki correspondence

We introduce a notion of depth three tower C⊆B⊆A with depth two ring extension A|B being the case B=C. If and B|C is a Frobenius extension with A|B|C depth three, then A|C is depth two. If A, B and C correspond to a tower G>H>K via group algebras over a base ring F, the depth three condition is the condition that K has normal closure K^G contained in H. For a depth three tower of rings, a pre-Galois theory for the ring and coring (A⊗_BA)^C involving Morita context bimodules and left coideal subrings is applied to specialize a Jacobson-Bourbaki correspondence theorem for augmented rings to depth two extensions with depth three intermediate division rings.     

On the telescope conjecture for module categories

In [H. Krause, O. Solberg, Applications of cotorsion pairs, J. London Math. Soc. 68 (2003) 631-650], the Telescope Conjecture was formulated for the module category of an artin algebra R as follows: “If C=(A,B) is a complete hereditary cotorsion pair in with A and B closed under direct limits, then ”. We extend this conjecture to arbitrary rings R, and show that it holds true if and only if the cotorsion pair C is of finite type. Then we prove the conjecture in the case when R is right noetherian and B has bounded injective dimension (thus, in particular, when C is any cotilting cotorsion pair). We also focus on the assumptions that A and B are closed under direct limits and on related closure properties, and detect several asymmetries in the properties of A and B.     

Retractions and contractibility in hyperspaces

Given a metric continuum X, let X² denote the hyperspace of all nonempty closed subsets of X. For each positive integer k let Ck(X) stand for the hyperspace of members of X² having at most k components. Consider mappings (where B∈Cm(X)) and both defined by A?A∪B. We give necessary and sufficient conditions under which these mappings are deformation retractions (under a special convention for φB). The conditions are related to the contractibility of the corresponding hyperspaces.     

Haagerup property for C-algebras

We define the Haagerup property for C^?-algebras A and extend this to a notion of relative Haagerup property for the inclusion B⊆A, where B is a C^?-subalgebra of A. Let Γ be a discrete group and Λ a normal subgroup of Γ, we show that the inclusion A_?α,rΛ⊆A_?α,rΓ has the relative Haagerup property if and only if the quotient group Γ/Λ has the Haagerup property. In particular, the inclusion has the relative Haagerup property if and only if Γ/Λ has the Haagerup property; has the Haagerup property if and only if Γ has the Haagerup property. We also characterize the Haagerup property for Γ in terms of its Fourier algebra A(Γ).     

A linear algorithm for minimum 1-identifying codes in oriented trees

Consider an oriented graph G=(V,A), a subset of vertices C⊆V, and an integer r?1; for any vertex v∈V, let denote the set of all vertices x such that there exists a path from x to v with at most r arcs. If for all vertices v∈V, the sets are all nonempty and different, then we call C an r-identifying code. We describe a linear algorithm which gives a minimum 1-identifying code in any oriented tree.     

A complement of the Ando-Hiai inequality

In this paper, we present a complement of a generalized Ando-Hiai inequality due to Fujii and Kamei [M. Fujii, E. Kamei, Ando-Hiai inequality and Furuta inequality, Linear Algebra Appl. 416 (2006) 541-545]. Let A and B be positive operators on a Hilbert space H such that 0<m₁?A?M₁ and 0<m₂?B?M₂ for some scalars m_i?M_i (i=1,2), and let α∈[0,1]. Put for i=1,2. Then for each 0<r?1 and s?1