Some Ramsey-Turán type results for hypergraphs

To everyk-graphG let(G) be the minimal real number such that for every>0 andn>n ₀(,G) everyk-graphH withn vertices and more than (+) ( ) edges contains a copy ofG. The real number (G) is defined in the same way adding the constraint that all independent sets of vertices inH have sizeo(n). Answering a problem of Erds and Sós it is shown that there exist infinitely manyk-graphs with 0<(G)<(G) for everyk3. It is worth noting that we were unable to find a singleG with the above property.This paper was written while the authors were visiting AT&T Bell Laboratories, Murray Hill, NJ 07974.     

Extensions and selections in subspaces ofC(K)

LetK be a compact Hausdorff space and letFK be a peak interpolation set for a function algebraAC(K). Let be a map fromK to the family of all convex subsets of such that the set {(z, x)zK, x(z)} is open inK×C and such thatg(z)(z) (zK) for somegA. We prove that everyfC(F) satisfyingf(s)(s) (sF) (f(s)closure (s) (sF)) admits an extensionfAA} satisfyingf(z)(z) (zK) (f(z))}closure (z) (zK), respectively). We prove a more general theorem of this kind and present various applications which generalize known dominated interpolation theorems for subspaces ofC(K).     

Cross-monotone subsequences

Two finite real sequences (a ₁,...,a _k ) and (b ₁,...,b _k ) are cross-monotone if each is nondecreasing anda _i+1–a _i b _i+1–b _i for alli. A sequence (₁,..., _n ) of nondecreasing reals is in class CM(k) if it has disjointk-term subsequences that are cross-monotone. The paper shows thatf(k), the smallestn such that every nondecreasing (₁,..., _n ) is in CM(k), is bounded between aboutk ²/4 andk ₂/2. It also shows thatg(k), the smallestn for which all (₁,..., _n ) are in CM(k)and eithera _k b ₁ orb _k a ₁, equalsk(k–1)+2, and thath(k), the smallestn for which all (₁,..., _n ) are in CM(_k)and eithera ₁b ₁...a _k b _k orb ₁a ₁...b _k a _k , equals 2(k–1)²+2.The results forf andg rely on new theorems for regular patterns in (0, 1)-matrices that are of interest in their own right. An example is: Every upper-triangulark ²×k ² (0, 1)-matrix has eitherk 1's in consecutive columns, each below its predecessor, ork 0's in consecutive rows, each to the right of its predecessor, and the same conclusion is false whenk ² is replaced byk ²–1.     

Regressions and monotone chains II: The poset of integer intervals

A regressive function (also called a regression or contractive mapping) on a partial order P is a function mapping P to itself such that (x)x. A monotone k-chain for is a k-chain on which is order-preserving; i.e., a chain x ₁<...ksuch that (x ₁)...(x_k). Let P _nbe the poset of integer intervals {i, i+1, ..., m} contained in {1, 2, ..., n}, ordered by inclusion. Let f(k) be the least value of n such that every regression on P _nhas a monotone k+1-chain, let t(x,j) be defined by t(x, 0)=1 and t(x,j)=x ^t(x,j–1). Then f(k) exists for all k (originally proved by D. White), and t(2,k) < f(K) <t( + _k, k) , where _k 0 as k. Alternatively, the largest k such that every regression on P _nis guaranteed to have a monotone k-chain lies between lg^*(n) and lg^*(n)–2, inclusive, where lg^*(n) is the number of appliations of logarithm base 2 required to reduce n to a negative number. Analogous results hold for choice functions, which are regressions in which every element is mapped to a minimal element.     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

Circles and spheres in pseudo-Riemannian geometry

Summary A totally umbilical pseudo-Riemannian submanifold with the parallel mean curvature vector field is said to be an extrinsic sphere. A regular curve in a pseudo-Riemannian manifold is called a circle if it is an extrinsic sphere. LetM be ann-dimensional pseudo-Riemannian submanifold of index (0n) in a pseudo-Riemannian manifold with the metricg and the second fundamental formB. The following theorems are proved. For ₀ = +1 or –1, ₁ = +1, –1 or 0 (2–2 ₀+ ₁2n–2–2) and a positive constantk, every circlec inM withg(c, c) = ₀ andg( _c c, _c c) = ₁ k ² is a circle in iffM is an extrinsic sphere. For ₀ = +1 or –1 (–₀n–), every geodesicc inM withg(c, c) = ₀ is a circle in iffM is constant isotropic and B(x,x,x) = 0 for anyx T(M). In this theorem, assume, moreover, that 1n–1 and the first normal space is definite or zero at every point. Then we can prove thatM is an extrinsic sphere. When = 0 orn, this fact does not hold in general.     

An observation concerning Ryser's conjecture

If in anr-partiter-graphH everyk edges intersect (wherek>2), then (H)[(r–1)/(k–1)].     

On an asymmetric divisor problem with congruence conditions

For fixed positive integersab, natural numbersl ₁k ₁,l ₂k ₂ andn, denote withd _a,b (l ₁,k ₁;l ₂,k ₂;n) the number of all (,)N² with ^{a b} =n,l ₁(modk ₁),l ₂(modk ₂). In the present paper we establish asymptotic formulas for the Dirichlet summatory function ofd _a,b (l ₁,k ₁;l ₂,k ₂;n) with both upper and lower estimates of the error term, all of them uniform in the moduli.     

Factorization intok-dimensional linear bijections

LetV be a vector space,k withkdimV andS _k{GL(V)|dimV(–1)=k}. ThenS _k generates GL _f (V){GL(V)|V(-1) is finite-dimensional} (with the exception that dimV=2=k and the field is GF2). We study the length problem in GL _f (V) withS _k as set of generators.     

Two congruence lattices of completely simple semigroups

For a Rees matrix semigroupS with normalized sandwich matrix and C(S), the congruence lattice ofS, we consider the lattice generated by {itpT_l, pK, pT_r, pt_l, pk, pt_r}. HerepT ₁ andpt _l are the upper and lower ends of the interval which makes up the _i -class of , _i being the left trace relation onC(S). The remaining symbols have the analogous meaning relative to the kernel and the right trace relations. We also consider the lattice generated by {T _l, K, T_r, t_l, _k, t_r} where and are the equality and the universal relations onS, respectively. In both cases, we find lattices freest relative to these lattices and represent them as distributive lattices with generators and relations.With 3 Figures     

Symmetrische Permutationsmengen

A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and ^–1 (x) = ^–1 (x) implies ^–1 = ^–1 , andsharply 3-transitive, if for any two triples (x ₁,x ₂,x ₃), (y ₁,y ₂,y ₃) M ³ with|{x ₁,x ₂,x ₃ }| = |{y ₁,y ₂,y ₃ }| = 3 there is exactly one permutation with(x ₁) =y ₁,(x ₂) =y ₂,(x ₃) =y ₃. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.     

∑II∑ threshold formulas

A II formula has the form, where eachL is either a variable or a negated variable. In this paper we study the computation of threshold functions by II formulas. By combining the proof of the Fredman-Komlós bound [5, 10] and a counting argument, we show that fork andn large andkn/2, every II formula computing the threshold functionT _k ⁿ has size at least exp . Fork andn large andkn ^2/3, we show that there exist II formulas for computingT _k ⁿ with size at most exp .     

Range of the posterior probability of an interval for priors with unimodality preserving contaminations

Range of the posterior probability of an interval over the -contamination class ={=(1–)₀+q:qQ} is derived. Here, ₀ is the elicited prior which is assumed unimodal, is the amount of uncertainty in ₀, andQ is the set of all probability densitiesq for which =(1–)₀+q is unimodal with the same mode as that of ₀. We show that the sup (resp. inf) of the posterior probability of an interval is attained by a prior which is equal to (1–)₀ except in one interval (resp. two disjoint intervals) where it is constant.     

The probability of the triangle inequality in probabilistic metric squares

The notion of a random semi-metric space provides an alternate approach to the study of probabilistic metric spaces from the standpoint of random variables instead of distribution functions and permits a new investigation of the triangle inequality. Starting with a probability space (, , P) and an abstract setS, each pair of points,p, q, inS is assigned a random variableX _pq with the interpretation thatX _pq () is the distance betweenp andq at the instant . The probability of the eventJ _pqr = { :X _pr ()X _pq ()+X _qr ()} is studied under distribution function conditions imposed by Menger Spaces (K. Menger, Statistical Metrics, Proc. Nat. Acad. Sci., U.S.A., 28 (1942), 535–537; B. Schweizer and A. Sklar, Statistical Metric Spaces, Pacific J. Math.10 (1960), 313–334). It turns out that for > 0 there are 3 non-negative, identically-distributed random variablesX, Y andZ for whichP(X < Y + Z) < . This and other results show that distribution function triangle inequalities are very weak. Conditional probabilities are introduced to give necessary and sufficient conditions forP(J _pqr ) = 1.     

On the stability properties of Brown's multistep multiderivative methods

Summary Brown introducedk-step methods usingl derivatives. We investigate for whichk andl the methods are stable or unstable. It is seen that to anyl the method becomes unstable fork large enough. All methods withk2(l+1) are stable. Fork=1,2,..., 18 there exists a _k such that the methods are stable for anyl _k and unstable for anyl < _k . The _k are given.     

Sharp Large Deviation Estimates for the Stochastic Heat Equation

We consider the family {X , 0} of solution to the heat equation on [0,T]×[0,1] perturbed by a small space-time white noise, that is _t X = X +b({X })+({X }) . Then, for a large class of Borelian subsets of the continuous functions on [0,T]×[0,1], we get an asymptotic expansion of P({X }A) as 0. This kind of expansion has been handled for several stochastic systems, ranging from Wiener integrals to diffusion processes.     

Joint similarity problems and the generation of operator algebras with bounded length

There is a pair of commuting operators (T ₁,T ₂) on Hilbert space such that eachT ₁ andT ₂ is similar to a contraction but the pair (T ₁,T ₂) is not similar to a pair of contractions. There is a pair of commuting unitarizable representations (₁,₂) on the free group withN2 generators such that (₁,₂) is not similar to a pair of unitary representations. In connection with these examples, we introduce and study a notion of length for aC ^*-algebra (or an operator algebra) generated by two subalgebras, which is analogous to the minimum length of a word in the generators of a group.Partially supported by the N.S.F.     

Decompositions of complete graphs into isomorphic bipartite subgraphs

Let |E(G)|= andf, a 1-1 mapping ofV(G) into {0,1,...,}. Thenf is called a -valuation ofG if the induced function given by , for alluvE(G) is 1-1. A -valuationf is called an -valuation ofG if there exists a nonnegative number such that for everyuvE(G) withf(u)<f(v),f(u)<f(v). Let denote the graph of then-dimensionalG-cube. ForG=K _{3, 3},K _{4, 4}, andP _k ,it is shown that for any positive integern, then-dimensionalG-cube has an -valuation. This gives rise to decompositions of some complete graphs into certain bipartite graphs.     

Homogenization with jumping nonlinearities

Summary Let a bounded regular open set of R ^N (N1),and {A ,0} be a sequence of second order, uniformly elliptic operators, which G-converges to A ₀.Let gC(R, R)be a nonlinear function with «jumping nonlinearities» (that is ).For h L ² () given, we obtain some results of convergence of the (eventual) solutions of the equation A u =g(u) +h.For instance, we study the case so-called «Ambrosetti-Prodi equation», that is when –< ^– < ₁ < ⁺ < ₂ where ₁ and ₂ are the firts and the second) eigenvalues of A ₀.

---

Résumé Soient un ouvert borné régulier de R ^N (N1), et {A ,0} une suite d'opérateurs sur , du 2éme ordre, uniformément elliptiques et qui G-converge vers A ₀.Soit gC (R, R)une fonction demi-linéaire à l'infini (c'est à dire telle que ).Pour hL ² () donné, on obtient des résultats de convergence pour les solutions (éventuelles) de l'équation A u =g(u) +h.Par exemple, on étudie le cas de «l'équation d' Ambrosetti-Prodi», c'est à dire le cas – _– < ₁) ⁺ < ₂,où ₁ et ₂ sont les lère et 2éme valeurs propres de A ₀.

     

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.