New lower semicontinuity results for polyconvex integrals

Summary We study integral functionals of the formF(u, )= f(u)dx, defined foru C¹(;R ^k), R ⁿ . The functionf is assumed to be polyconvex and to satisfy the inequalityf(A) c₀¦(A)¦ for a suitable constant c₀ > 0, where (A) is then-vector whose components are the determinants of all minors of thek×n matrixA. We prove thatF is lower semicontinuous onC ¹(;R ^k) with respect to the strong topology ofL ¹(;R ^k). Then we consider the relaxed functional , defined as the greatest lower semicontinuous functional onL ¹(;R ^k ) which is less than or equal toF on C¹(;R ^k). For everyu BV(;R ^k) we prove that (u,) f(u)dx+c₀¦D^su¦(), whereDu=u dx+D^su is the Lebesgue decomposition of the Radon measureDu. Moreover, under suitable growth conditions onf, we show that (u,)= f(u)dx for everyu W^1,p(;R ^k), withp min{n,k}. We prove also that the functional (u, ) can not be represented by an inte- gral for an arbitrary functionu BV_loc(R ⁿ;R ^k). In fact, two examples show that, in general, the set function (u, ) is not subadditive whenu BV_loc(R ⁿ;R ^k), even ifu W _loc ^1,p (R ⁿ;R ^k) for everyp < min{n,k}. Finally, we examine in detail the properties of the functionsu BV(;R ^k) such that (u, )= f(u)dx, particularly in the model casef(A)=¦(A)¦.     

Some geometric applications of the beta distribution

Let be the angle between a line and a random k-space in Euclidean n-space R ⁿ. Then the random variable cos² has the beta distribution. This result is applied to show (1) in R ⁿthere are exponentially many (in n) lines going through the origin so that any two of them are nearly perpendicular, (2) any N-point set of diameter d in R ⁿlies between two parallel hyperplanes distance 2d{(log N)/(n-1)}^1/2 apart and (3) an improved version of a lemma of Johnson and Lindenstrauss (1984, Contemp. Math., 26, 189–206). A simple estimate of the area of a spherical cap, and an area-formula for a neighborhood of a great circle on a sphere are also given.     

On the Embedding of an Affine Space into a Projective Space

Let k, K be fields, and assume that |k| 4 and n, m 2, or |k| = 3 and n 3, m 2. Then, for any embedding of AG(n, k) into PG(m, K), there exists an isomorphism from k into K and an (n+1) × (m+1) matrix B with entries in K such that can be expressed as (x₁,x₂,...,x_n) = [(1,x₁ ,x₂ ,...,x_n )B], where the right-hand side is the equivalence class of (1,x₁ ,x₂ ,...,x_n )B. Moreover, in this expression, is uniquely determined, and B is uniquely determined up to a multiplication of element of K*. Let l 1, and suppose that there exists an embedding of AG(m+l, k) into PG(m, K) which has the above expression. If we put r = dim _k K, then we have r 3 and m > 2 l-1)/(r-2). Conversely, there exists an embedding of AG(l+m, k) into PG(m, K) with the above expression if K is a cyclic extension of k with dim _k K=r 3, and if m 2l/(r-2) with m even or if m 2l/(r-2) +1 with m odd.     

Extremes of a Gaussian Process and the Constant H α

Consider a triangular array of standard Gaussian random variables {_n,i, i 0, n 1} such that {_n,i, i 0} is a stationary normal sequence for each n 1. Let _n,k = corr(_n,i,_n,i+k). If (1-_n,k)log n _k (0,) as n for some k, then the locations where the extreme values occur cluster and the limiting distribution of the maxima is still the Gumbel distribution as in the stationary or i.i.d. case, but shifted by a parameter measuring the clustering. Triangular arrays of Gaussian sequences are used to approximate a continuous Gaussian process X(t), t 0. The cluster behavior of the random sequence refers to the behavior of the extremes values of the continuous process. The relation is analyzed. It reveals a new definition of the constants H used for the limiting distribution of maxima of continuous Gaussian processes and provides further understanding of the limit result for these extremes.     

k-regular factors and semi-k-regular factors in bipartite graphs

LetG be a graph, andk1 an integer. LetU be a subset ofV(G), and letF be a spanning subgraph ofG such that deg _F (x)=k for allx V(G)–U. If deg _F (x)k for allxU, thenF is called an upper semi-k-regular factor with defect setU, and if deg _F (x)k for allxU, thenF is called a lower semi-k-regular factor with defect setU. Now letG=(X, Y;E(G)) be a bipartite graph with bipartition (X,Y) such that X=Yk+2. We prove the following two results.(1) Suppose that for each subsetU ₁X such that U ₁=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.(2) Suppose that for each subsetU ₁X such that U ₁=X–1/k+1,G has a lower semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=X–1/k+1,G has a lower semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.     

The dimension theorem in axiomatic geometry

Given a matroid and an integer n 0, eleven conditions are shown to be equivalent to the validity of the rank formula r(E F) + r(E F = r(E) + r(F) for subspaces satisfying r(EF)n. For n=0 one finds the projective geometries. The case n=1 also includes the affine and the hyperbolic geometries, the case n=2 the Möbius geometries. The general case covers the incidence geometries of grade n of Wille.     

Weak convergence using higher-order cumulants

Denote byc _j (F) thejth cumulant (or semi-invariant) of the distribution functionF. We say thatF is specified by its higher-order cumulants if it is the unique distribution functionG having the following property: there exists a positive integerJ such thatc _j (G)=c _j (F) forj=1,2 andjJ. Let (F _n n1) be a sequence of distribution functions, and suppose that there existsJ such thatc _j (F _n )c _j (F) asn, forj=1,2 andjJ. It is proved thatF _n F so long asF is specified by its higher-order cumulants. It is an open problem to characterize the family of distributions which are specified by their higher-order cumulants.     

On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

Covering a convex body by smaller homothetic copies

Let a convex bodyAE ⁿ be covered bys smaller homothetic copies with coefficients ₁, ..., _s , respectively. It is conjectured that ₁ + ...+ _s n. This conjecture is confirmed in two cases:n is arbitrary ands=n+1;s is arbitrary andn=2.     

Weight functions on the Kneser graph and the solution of an intersection problem of Sali

LetX, Y be finite sets and suppose thatF is a collection of pairs of sets (F, G),FX,GY satisfying |FF|s, |GG|t and |FF|+|GG|s+t+1 for all (F, G),F, GF. Extending a result of Sali, we determine the maximum ofF.     

Some tilings of the plane whose singular points are uncountable and unbounded

Let I be a tiling of the plane such that for every tile T of I there correspond a tile T of I (not necessarily unique) and an integer k(T, T) (depending on T and T), k(T, T)>2, such that T meets T in k(T, T) connected components. Tiles T and T satisfying this condition are called associated tiles in I. Various properties concerning I and its singular points are obtained. First, it is not possible that every tile in I have a unique associated tile. In fact, there exist infinite families of tiles {F} {F _n:n1} such that F is the unique associated tile for every F _n. Next, if x is a singular point of I, then every neighborhood of x contains uncountably many singular points of I. Finally, the set of singular points of I is unbounded.     

Boundedness of singular integrals of variable rough Calderón-Zygmund kernels along surfaces

Letn2. The authors establish theL ²( ⁿ )-boundedness of singular integrals with variable rough Calderón-Zygmund kernels associated to surfaces satisfying some conditions.The research is supported in part by the NNSF and the SEDF of China.     

Non removable edges in 3-connected cubic graphs

LetG be a cyclicallyk-edge-connected cubic graph withk 3. Lete be an edge ofG. LetG be the cubic graph obtained fromG by deletinge and its end vertices. The edgee is said to bek-removable ifG is also cyclicallyk-edge-connected. Let us denote by S _k (G) the graph induced by thek-removable edges and by N _k (G) the graph induced by the non 3-removable edges ofG. In a previous paper [7], we have proved that N ₃(G) is empty if and only ifG is cyclically 4-edge connected and that if N ₃(G) is not empty then it is a forest containing at least three trees. Andersen, Fleischner and Jackson [1] and, independently, McCuaig [11] studied N ₄(G). Here, we study the structure of N _k (G) fork 5 and we give some constructions of graphs such thatN _k (G) = E(G). We note that the main result of this paper (Theorem 5) has been announced independently by McCuaig [11].

---

Résumé SoitG un graphe cubique cyliquementk-arête-connexe, aveck 3. Soite une arête deG et soitG le graphe cubique obtenu à partir deG en supprimante et ses extrémités. L'arêtee est ditek-suppressible siG est aussi cycliquementk-arête-connexe. Désignons par S _k (G) le graphe induit par les arêtesk-suppressibles et par N _k (G) celui induit par les arêtes nonk-suppressibles. Dans un précédent article [7], nous avons montré que N ₃(G) est vide si et seulement siG est cycliquement 4-arête-connexe et que si N ₃(G) n'est pas vide alors c'est une forêt possédant au moins trois arbres. Andersen, Fleischner and Jackson [1] et, indépendemment, McCuaig [11] ont étudié N ₄(G). Ici, nous étudions la structure de N _k (G) pourk 5 et nous donnons des constructions de graphes pour lesquelsN _k (G) = E(G). Nous signalons que le résultat principal de cet article (Théorème 5) a été annoncé indépendamment par McCuaig [11].

     

Random Walks Crossing High Level Curved Boundaries

Let {S _n} be a random walk, generated by i.i.d. increments X _i which drifts weakly to in the sense that as n . Suppose k0, k1, and E|X ₁|^1\k = if k>1. Then we show that the probability that S. crosses the curve nan ^K before it crosses the curve n –an ^k tends to 1 as a . This intuitively plausible result is not true for k = 1, however, and for 1/2 <k<1, the converse results are not true in general, either. More general boundaries g(n) than g(n) = n ^k are also considered, and we also prove similar results for first passages out of regions like { (n, y): n1, |y| (a + n) ^k } as a .     

Stability of unconditional convergence almost everywhere

We will investigate the properties of series of functions which are unconditionally convergent almost everywhere on [0, 1]. We will establish the following theorem: If the series _k=1 f _k(x) converges unconditionally almost everywhere, then there exists a sequence {_k} ₁ ,_k , such that if _{k k} , k=1, 2,..., the series _{k=1 k}/k(x) converges unconditionally almost every-where.Translated from Mate matte heskie Zametki, Vol. 14, No. 5, pp. 645–654, November, 1973.The author wishes to thank Professor P. L. Ul'yanov for his help.     

The quality of the Diophantine approximations found by the Jacobi-Perron algorithm and related algorithms

Given a vector of real numbers=(₁,... _d ) ^d , the Jacobi-Perron algorithm and related algorithms, such as Brun's algorithm and Selmer's algorithm, produce a sequence of (d+1)×(d+1) convergent matrices {C⁽ⁿ⁾():n1} whose rows provide Diophantine approximations to . Such algorithms are specified by two mapsT:[0, 1] ^d [0, 1] ^d and A:[0,1] ^d GL(d+1,), which compute convergent matrices C⁽ⁿ⁾())...A(T())A(). The quality of the Diophantine approximations these algorithms find can be measured in two ways. The best approximation exponent is the upper bound of those values of for which there is some row of the convergent matrices such that for infinitely many values ofn that row of C⁽ⁿ⁾() has . The uniform approximation exponent is the upper bound of those values of such that for all sufficiently large values ofn and all rows of C⁽ⁿ⁾⁽⁾ one has . The paper applies Oseledec's multiplicative ergodic theorem to show that for a large class of such algorithms and take constant values and on a set of Lebesgue measure one. It establishes the formula where are the two largest Lyapunov exponents attached by Oseledec's multiplicative ergodic theorem to the skew-product (T, A,d), whered is aT-invariant measure, absolutely continuous with respect to Lebesgue measure. We conjecture that holds for a large class of such algorithms. These results apply to thed-dimensional Jacobi-Perron algorithm and Selmer's algorithm. We show that; experimental evidence of Baldwin (1992) indicates (nonrigorously) that. We conjecture that holds for alld2.     

A Lévy Type Martingale Convergence Theorem for Random Sets with Unbounded Values

Given a nondecreasing sequence ( _n ) of sub--fields and a real or vector valued random variable f, the Lévy Martingale convergence Theorem (LMCT) asserts that E(f/ _n ) converges to E(f/) almost surely and in L ¹, where stands for the -field generated by the _n . In the present paper, we study the validity of the multivalued analog this theorem for a random set F whose values are members of (X), the space of nonempty closed sets of a Banach space X, when (X) is endowed either with the Painlevé–Kuratowski convergence or its infinite dimensional extensions. We deduce epi-convergence results for integrands via the epigraphical multifunctions. As it is known, these results are useful for approximating optimization problems. The method relies on countability supportness hypotheses which are shown to hold when the values of the random set E(F/ _n ) do not contain any line. On the other hand, since the values of F are not assumed to be bounded, conditions involving barrier and asymptotic cones are shown to be necessary. Moreover, we discuss the relations with other multivalued martingale convergence theorems and provide examples showing the role of the hypotheses. Even in the finite dimensional setting, our results are new or subsume already existing ones.     

Turán's extremal problem in random graphs: Forbidding odd cycles

For 0<1 and graphsG andH, we writeGH if any -proportion of the edges ofG span at least one copy ofH inG. As customary, we writeC ^k for a cycle of lengthk. We show that, for every fixed integerl1 and real >0, there exists a real constantC=C(l, ), such that almost every random graphG _{n, p} withp=p(n)Cn ^–1+1/2l satisfiesG _n,p1/2+ C ^2l+1. In particular, for any fixedl1 and >0, this result implies the existence of very sparse graphsG withG _1/2+ C ^2l+1.The first author was partially supported by NSERC. The second author was partially supported by FAPESP (Proc. 93/0603-1) and by CNP_q (Proc. 300334/93-1). The third author was partially sopported by KBN grant 2 1087 91 01.