Supersaturation For Ramsey-Turán Problems

For an l-graph , the Turán number is the maximum number of edges in an n-vertex l-graph containing no copy of . The limit is known to exist [8]. The Ramsey–Turán density is defined similarly to except that we restrict to only those with independence number o(n). A result of Erdős and Sós [3] states that as long as for every edge E of there is another edge E′of for which |E∩E′|≥2. Therefore a natural question is whether there exists for which . Another variant proposed in [3] requires the stronger condition that every set of vertices of of size at least εn (0<ε<1) has density bounded below by some threshold. By definition, for every . However, even is not known for very many l-graphs when l>2. We prove the existence of a phenomenon similar to supersaturation for Turán problems for hypergraphs. As a consequence, we construct, for each l≥3, infinitely many l-graphs for which . We also prove that the 3-graph with triples 12a, 12b, 12c, 13a, 13b, 13c, 23a, 23b, 23c, abc, satisfies . The existence of a hypergraph satisfying was conjectured by Erdős and Sós [3], proved by Frankl and R?dl [6], and later by Sidorenko [14]. Our short proof is based on different ideas and is simpler than these earlier proofs. * Research supported in part by the National Science Foundation under grants DMS-9970325 and DMS-0400812, and an Alfred P. Sloan Research Fellowship. † Research supported in part by the National Science Foundation under grants DMS-0071261 and DMS-0300529.     

More on Bounding Introspection in Modal Nonmonotonic Logics

Abstract By we denote the set of all propositional formulas. Let be the set of all clauses. Define . In Sec. 2 of this paper we prove that for normal modal logics , the notions of -expansions and -expansions coincide. In Sec. 3, we prove that if I consists of default clauses then the notions of -expansions for I and -expansions for I coincide. To this end, we first show, in Sec. 3, that the notion of -expansions for I is the same as that of -expansions for I. The project is supported by NSFC     

Explicit Bounded-Degree Unique-Neighbor Concentrators

Here we solve an open problem considered by various researchers by presenting the first explicit constructions of an infinite family of bounded-degree ‘unique-neighbor’ concentrators Γ; i.e., there are strictly positive constants α and ε, such that all Γ = (X,Y,E(Γ)) ∈ satisfy the following properties. The output-set Y has cardinality times that of the input-set X, and for each subset S of X with no more than α|X| vertices, there are at least ε|S| vertices in Y that are adjacent in Γ to exactly one vertex in S. Also, the construction of is simple to specify, and each has fewer than edges. We then modify to obtain explicit unique-neighbor concentrators of maximum degree 3. * Supported by NSF grant CCR98210-58 and ARO grant DAAH04-96-1-0013.     

Translation Generalized Quadrangles In Even Characteristic

In this paper, we first introduce new objects called “translation generalized ovals” and “translation generalized ovoids”, and make a thorough study of these objects. We then obtain numerous new characterizations of the of Tits and the classical generalized quadrangle in even characteristic, including the complete classification of 2-transitive generalized ovals for the even case. Next, we prove a new strong characterization theorem for the of Tits. As a corollary, we obtain a purely geometric proof of a theorem of Johnson on semifield flocks. * The second author is a Postdoctoral Fellow of the Fund for Scientific Research—Flanders (Belgium).     

Integral Equations on Function Spaces and Dichotomy on the Real Line

The purpose of this paper is to give new and general characterizations for uniform dichotomy and uniform exponential dichotomy of evolution families on the real line. We consider two general classes denoted and and we prove that if V,W are Banach function spaces with and , then the admissibility of the pair for an evolution family implies the uniform dichotomy of . In addition, we consider a subclass and we prove that if , then the admissibility of the pair implies the uniform exponential dichotomy of the family . This condition becomes necessary if . Finally, we present some applications of the main results.     

Weighted Non-Trivial Multiply Intersecting Families

Let n and r be positive integers. Suppose that a family satisfies F₁∩···∩F_r ≠∅ for all F₁, . . .,F_r ∈ and . We prove that there exists ε=ε(r) >0 such that holds for 1/2≤w≤1/2+ε if r≥13.     

Proof Of A Conjecture Of Erdős On Triangles In Set-Systems

A triangle is a family of three sets A,B,C such that A∩B, B∩C, C∩A are each nonempty, and . Let be a family of r-element subsets of an n-element set, containing no triangle. Our main result implies that for r ≥ 3 and n ≥ 3r/2, we have This settles a longstanding conjecture of Erdős [7], by improving on earlier results of Bermond, Chvátal, Frankl, and Füredi. We also show that equality holds if and only if consists of all r-element subsets containing a fixed element. Analogous results are obtained for nonuniform families.     

On Shadows Of Intersecting Families

The shadow minimization problem for t-intersecting systems of finite sets is considered. Let be a family of k-subsets of . The -shadow of is the set of all (k-)-subsets contained in the members of . Let be a t-intersecting family (any two members have at least t elements in common) with . Given k,t,m the problem is to minimize (over all choices of ). In this paper we solve this problem when m is big enough.     

Exponential Stability of Traveling Pulse Solutions of a Singularly Perturbed System of Integral Differential Equations Arising From Excitatory Neuronal Networks

We establish the exponential stability of fast traveling pulse solutions to nonlinear singularly per-turbed systems of integral differential equations arising from neuronal networks.It has been proved that expo-nential stability of these orbits is equivalent to linear stability.Let (?) be the linear differential operator obtainedby linearizing the nonlinear system about its fast pulse,and let σ((?)) be the spectrum of (?).The linearizedstability criterion says that if max{Reλ:λ∈σ((?)),λ≠0}(?)-D,for some positive constant D,and λ=0 is asimple eigenvalue of (?)(ε),then the stability follows immediately (see [13] and [37]).Therefore,to establish theexponential stability of the fast pulse,it suffices to investigate the spectrum of the operator (?).It is relativelyeasy to find the continuous spectrum,but it is very difficult to find the isolated spectrum.The real part ofthe continuous spectrum has a uniformly negative upper bound,hence it causes no threat to the stability.Itremains to see if the isolated spectrum is safe.Eigenvalue functions (see [14] and [35,36]) have been a powerful tool to study the isolated spectrum of the as-sociated linear differential operators because the zeros of the eigenvalue functions coincide with the eigenvaluesof the operators.There have been some known methods to define eigenvalue functions for nonlinear systems ofreaction diffusion equations and for nonlinear dispersive wave equations.But for integral differential equations,we have to use different ideas to construct eigenvalue functions.We will use the method of variation of param-eters to construct the eigenvalue functions in the complex plane C.By analyzing the eigenvalue functions,wefind that there are no nonzero eigenvalues of (?) in {λ∈C:Reλ(?)-D} for the fast traveling pulse.Moreoverλ=0 is simple.This implies that the exponential stability of the fast orbits is true.     

The Reduced Minimum Modulus in <Emphasis>C</Emphasis><Superscript>*</Superscript>-Algebras

We define the reduced minimum modulus of a nonzero element a in a unital C ^*-algebra by . We prove that . Applying this result to and its closed two side ideal , we get that dist , and for any if RR = 0, where and is the quotient homomorphism and . These results generalize corresponding results in Hilbert spaces.     

Minimal invariant varieties and first integrals for algebraic foliations

Let X be an irreducible algebraic variety over ℂ, endowed with an algebraic foliation . In this paper, we introduce the notion of minimal invariant variety V( , Y) with respect to ( , Y), where Y is a subvariety of X. If Y = {x} is a smooth point where the foliation is regular, its minimal invariant variety is simply the Zariski closure of the leaf passing through x. First we prove that for very generic x, the varieties V( , x) have the same dimension p. Second we generalize a result due to X. Gomez- Mont (see [G-M]). More precisely, we prove the existence of a dominant rational map F : X → Z, where Z has dimension (n − p), such that for very generic x, the Zariski closure of F⁻¹(F(x)) is one and only one minimal invariant variety of a point. We end up with an example illustrating both results.     

Extremal Problems For Transversals In Graphs With Bounded Degree

We introduce and discuss generalizations of the problem of independent transversals. Given a graph property , we investigate whether any graph of maximum degree at most d with a vertex partition into classes of size at least p admits a transversal having property . In this paper we study this problem for the following properties : “acyclic”, “H-free”, and “having connected components of order at most r”. We strengthen a result of [13]. We prove that if the vertex set of a d-regular graph is partitioned into classes of size d+⌞d/r⌟, then it is possible to select a transversal inducing vertex disjoint trees on at most r vertices. Our approach applies appropriate triangulations of the simplex and Sperner’s Lemma. We also establish some limitations on the power of this topological method. We give constructions of vertex-partitioned graphs admitting no independent transversals that partially settles an old question of Bollobás, Erdős and Szemerédi. An extension of this construction provides vertex-partitioned graphs with small degree such that every transversal contains a fixed graph H as a subgraph. Finally, we pose several open questions. * Research supported by the joint Berlin/Zurichgrad uate program Combinatorics, Geometry, Computation, financed by the German Science Foundation (DFG) and ETH Zürich. † Research partially supported by Hungarian National Research Fund grants T-037846, T-046234 and AT-048826.     

Lie and Jordan Ideals in Reflexive Algebras

A CDCSL algebra is a reflexive operator algebra with completely distributive and commutative subspace lattice. In this paper, we show, for a weakly closed linear subspace of a CDCSL algebra , that is a Lie ideal if and only if for all invertibles A in , and that is a Jordan ideal if and only if it is an associative ideal.     

Set Systems with few Disjoint Pairs

Let X = {1, . . . , n}, and let be a family of subsets of X. Given the size of , at least how many pairs of elements of must be disjoint? In this paper we give a lower bound for the number of disjoint pairs in . The bound we obtain is essentially best possible. In particular, we give a new proof of a result of Frankl and of Ahlswede, that if satisfies then contains at least as many disjoint pairs as X^(r).The situation is rather different if we restrict our attention to : then we are asking for the minimum number of edges spanned by a subset of the Kneser graph of given size. We make a conjecture on this lower bound, and disprove a related conjecture of Poljak and Tuza on the largest bipartite subgraph of the Kneser graph.* Research partially supported by NSF grant DMS-9971788     

Ultraproducts of real interpolation spaces between L p -spaces

Let , be a family of compatible couples of L^p-spaces. We show that, given a countably incomplete ultrafilter in , the ultraproduct of interpolation spaces defined by the real method is isomorphic to the direct sum of an interpolation space of type , an intermediate K?the space between and being a purely atomic measure space, and a K?the function space K(Ω₃) defined on some purely non atomic measure space (Ω₃, ν₃) in such a way that Ω₂ ∪ Ω₃ ≠∅. The research of first and third authors is partially supported by the MEC and FEDER project MTM2004-02262 and AVCIT group 03/050.     

On A Hypergraph Turán Problem Of Frankl

Let be the 2k-uniform hypergraph obtained by letting P₁, . . .,P_r be pairwise disjoint sets of size k and taking as edges all sets P_i∪P_j with i ≠ j. This can be thought of as the ‘k-expansion’ of the complete graph K_r: each vertex has been replaced with a set of size k. An example of a hypergraph with vertex set V that does not contain can be obtained by partitioning V = V1 ∪V₂ and taking as edges all sets of size 2k that intersect each of V₁ and V₂ in an odd number of elements. Let denote a hypergraph on n vertices obtained by this construction that has as many edges as possible. For n sufficiently large we prove a conjecture of Frankl, which states that any hypergraph on n vertices that contains no has at most as many edges as . Sidorenko has given an upper bound of for the Tur′an density of for any r, and a construction establishing a matching lower bound when r is of the form 2^p+1. In this paper we also show that when r=2^p+1, any -free hypergraph of density looks approximately like Sidorenko’s construction. On the other hand, when r is not of this form, we show that corresponding constructions do not exist and improve the upper bound on the Turán density of to , where c(r) is a constant depending only on r. The backbone of our arguments is a strategy of first proving approximate structure theorems, and then showing that any imperfections in the structure must lead to a suboptimal configuration. The tools for its realisation draw on extremal graph theory, linear algebra, the Kruskal–Katona theorem and properties of Krawtchouck polynomials. * Research supported in part by NSF grants DMS-0355497, DMS-0106589, and by an Alfred P. Sloan fellowship.     

Tolokonnikov’s Lemma for Real H ∞ and the Real Disc Algebra

We prove Tolokonnikov’s Lemma and the inner-outer factorization for the real Hardy space , the space of bounded holomorphic (possibly operator-valued) functions on the unit disc all of whose matrix-entries (with respect to fixed orthonormal bases) are functions having real Fourier coefficients, or equivalently, each matrix entry f satisfies for all z ∈ . Tolokonnikov’s Lemma for means that if f is left-invertible, then f can be completed to an isomorphism; that is, there exists an F, invertible in , such that F = [ f f _c ] for some f _c in . In control theory, Tolokonnikov’s Lemma implies that if a function has a right coprime factorization over , then it has a doubly coprime factorization in . We prove the lemma for the real disc algebra as well. In particular, and are Hermite rings. The work of the first author was supported by Magnus Ehrnrooth Foundation. Received: December 5, 2006. Revised: February 4, 2007.     

Coincidences of Centers of Edge-Incentric, or Balloon, Simplices

An edge-incentric d-simplex is defined to be a d-simplex S which admits a (d − 1)-sphere that touches all the edges of S internally. The center of such a sphere is called the edge-incenter of S and is denoted by . Equivalently, S is edge-incentric if and only if its vertices are the centers of d + 1 (d − 1)-spheres in mutual external touch, and for this reason one may call such an S a balloon d-simplex. An orthocentric d-simplex is a d-simplex in which the altitudes are concurrent. The point of concurrence is called the orthocenter and is denoted by . The spaces of edge-incentric and of orthocentric d-simplices have the same dimension d in the sense that a d-simplex in either space can be parametrized, up to shape, by d numbers. Edge-incentric and orthocentric tetrahedra are the first two of the four special classes of tetrahedra studied in [1, Chapter IX.B, pp. 294–333]. The degree of regularity implied by the coincidence of two or more centers of a general d-simplex is investigated in [8], where it is shown that the coincidence of the centroid , the circumcenter , and the incenter does not imply much regularity. For an orthocentric d-simplex S, however, it is proved in [9] that if any two of the centers , and coincide, then S is regular. In this paper, the same question is addressed for edge-incentric d-simplices. Among other things, it is proved that if any three of the centers , and of an edge-incentric d-simplex S coincide, then S is regular, and it is also shown that none of the coincidences , and implies regularity (except when d ≤ 3, d ≤ 4, and d ≤ 6, respectively). In contrast with the afore-mentioned results for orthocentric d-simplices, this emphasizes once more the feeling that, regarding many important properties, orthocentric d-simplices are the true generalizations of triangles. Several open questions are posed. Received: June 19, 2006.     

On Well-posed Mutually Nearest and Mutually Furthest Point Problems in Banach Spaces

Let G be a non-empty closed(resp．bounded closed)boundedly relatively weakly compact subset in a strictly convex Kadec Banach space X．Let K(X)denote the space of all non-empty compact convex subsets of X endowed with the Hausdorff distance．Moreover,let KG(X)denote the closure of the set {A∈K(x)：A∩G=0}．We prove that the set of all A∈KG(X)(resp．A∈K(X)),such that the minimization (resp．maximization)problem min(A,G)(resp．max(A,G))is well posed,contains a dense Gδ-subset of KG(X)(resp．K(X))．thus extending the recent results due to Blasi,Myjak and Papini and Li．     

One-sided Grothendieck quotients

We introduce one-sided thick subcategories of an arbitrary preadditive category and define a quotient category . When is abelian, this concept specializes to Grothendieck’s quotient for two-sided thick . We determine the left noetherian rings for which the injective modules form a left thick subcategory. We exhibit a class of one-sided thick subcategories in categories of coherent functors which are ubiquitous in representation theory. Received: 14 November 2006 Revised: 12 March 2007