Weak hypergraph regularity and linear hypergraphs

We consider conditions which allow the embedding of linear hypergraphs of fixed size. In particular, we prove that any k-uniform hypergraph H of positive uniform density contains all linear k-uniform hypergraphs of a given size. More precisely, we show that for all integers l >= k >= 2 and every d > 0 there exists Q > 0 for which the following holds: if His a sufficiently large k-uniform hypergraph with the property that the density of H induced on every vertex subset of size on is at least d, then H contains every linear k-uniform hypergraph F with l vertices. The main ingredient in the proof of this result is a counting lemma for linear hypergraphs, which establishes that the straightforward extension of graph epsilon-regularity to hypergraphs suffices for counting linear hypergraphs. We also consider some related problems. (C) 2009 Elsevier Inc. All rights reserved.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

The 3-colored Ramsey number of even cycles

Denote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and Erdos conjectured that when L is the cycle C(n) on n vertices, R(C(n), C(n), C(n)) = 4n - 3 for every odd n > 3. Luczak proved that if n is odd, then R(C(n), C(n), C(n)) = 4n + o(n), as n -> infinity, and Kohayakawa, Simonovits and Skokan confirmed the Bondy-Erdos conjecture for all sufficiently large values of n. Figaj and Luczak determined an asymptotic result for the `complementary` case where the cycles are even: they showed that for even n, we have R(C(n), C(n), C(n)) = 2n + o(n), as n -> infinity. In this paper, we prove that there exists n I such that for every even n >= n(1), R(C(n), C(n), C(n)) = 2n. (C) 2009 Elsevier Inc. All rights reserved.

The curve selection lemma and the Morse-Sard theorem

We use an inequality due to Bochnak and Lojasiewicz, which follows from the Curve Selection Lemma of real algebraic geometry in order to prove that, given a C(r) function f : U subset of R(m) -> R, we have lim(y -> xy is an element of crit(f)) vertical bar f(y) - f(x)vertical bar/vertical bar y - x vertical bar(r) = 0, for all x is an element of crit(f)` boolean AND U, where crit( f) = {x is an element of U vertical bar df ( x) = 0}. This shows that the so-called Morse decomposition of the critical set, used in the classical proof of the Morse-Sard theorem, is not necessary: the conclusion of the Morse decomposition lemma holds for the whole critical set. We use this result to give a simple proof of the classical Morse-Sard theorem ( with sharp differentiability assumptions).

Strongly damped wave problems: Bootstrapping and regularity of solutions

The aim of the article is to present a unified approach to the existence, uniqueness and regularity of solutions to problems belonging to a class of second order in time semilinear partial differential equations in Banach spaces. Our results are applied next to a number of examples appearing in literature, which fall into the class of strongly damped semilinear wave equations. The present work essentially extends the results on the existence and regularity of solutions to such problems. Previously, these problems have been considered mostly within the Hilbert space setting and with the main part operators being selfadjoint. In this article we present a more general approach, involving sectorial operators in reflexive Banach spaces. (C) 2008 Elsevier Inc. All rights reserved.

Regularity of solutions on the global attractor for a semilinear damped wave equation

We consider attractors A(eta), eta epsilon [0, 1], corresponding to a singularly perturbed damped wave equation u(tt) + 2 eta A(1/2)u(t) + au(t) + Au = f (u) in H-0(1)(Omega) x L-2 (Omega), where Omega is a bounded smooth domain in R-3. For dissipative nonlinearity f epsilon C-2(R, R) satisfying vertical bar f ``(s)vertical bar <= c(1 + vertical bar s vertical bar) with some c > 0, we prove that the family of attractors {A(eta), eta >= 0} is upper semicontinuous at eta = 0 in H1+s (Omega) x H-s (Omega) for any s epsilon (0, 1). For dissipative f epsilon C-3 (R, R) satisfying lim(vertical bar s vertical bar) (->) (infinity) f ``(s)/s = 0 we prove that the attractor A(0) for the damped wave equation u(tt) + au(t) + Au = f (u) (case eta = 0) is bounded in H-4(Omega) x H-3(Omega) and thus is compact in the Holder spaces C2+mu ((Omega) over bar) x C1+mu((Omega) over bar) for every mu epsilon (0, 1/2). As a consequence of the uniform bounds we obtain that the family of attractors {A(eta), eta epsilon [0, 1]} is upper and lower semicontinuous in C2+mu ((Omega) over bar) x C1+mu ((Omega) over bar) for every mu epsilon (0, 1/2). (c) 2007 Elsevier Inc. All rights reserved.

Global analytic regularity for structures of co-rank one

We consider real analytic involutive structures V, of co-rank one, defined on a real analytic paracompact orientable manifold M. To each such structure we associate certain connected subsets of M which we call the level sets of V. We prove that analytic regularity propagates along them. With a further assumption on the level sets of V we characterize the global analytic hypoellipticity of a differential operator naturally associated to V. As an application we study a case of tube structures.

On the manifold structure of the set of unparameterized embeddings with low regularity

Given manifolds M and N, with M compact, we study the geometrical structure of the space of embeddings of M into N, having less regularity than C(infinity) quotiented by the group of diffeomorphisms of M.

Explaining sleep duration in adolescents: The impact of socio-demographic and lifestyle factors and working status

Previous studies found students who both work and attend school undergo a partial sleep deprivation that accumulates across the week. The aim of the present study was to obtain information using a questionnaire on a number of variables (e.g., socio-demographics, lifestyle, work timing, and sleep-wake habits) considered to impact on sleep duration of working (n = 51) and non-working (n = 41) high-school students aged 14-21 yrs old attending evening classes (19:00-22:30h) at a public school in the city of Sao Paulo, Brazil. Data were collected for working days and days off. Multiple linear regression analyses were performed to assess the factors associated with sleep duration on weekdays and weekends. Work, sex, age, smoking, consumption of alcohol and caffeine, and physical activity were considered control variables. Significant predictors of sleep duration were: work (p < 0.01), daily work duration (8-10h/day; p < 0.01), sex (p = 0.04), age 18-21 yrs (0.01), smoking (p = 0.02) and drinking habits (p = 0.03), irregular physical exercise (p < 0.01), ease of falling asleep (p = 0.04), and the sleep-wake cycle variables of napping (p < 0.01), nocturnal awakenings (p < 0.01), and mid-sleep regularity (p < 0.01). The results confirm the hypotheses that young students who work and attend school showed a reduction in night-time sleep duration. Sleep deprivation across the week, particularly in students working 8-10h/day, is manifested through a sleep rebound (i.e., extended sleep duration) on Saturdays. However, the different roles played by socio-demographic and lifestyle variables have proven to be factors that intervene with nocturnal sleep duration. The variables related to the sleep-wake cyclenaps and night awakeningsproved to be associated with a slight reduction in night-time sleep, while regularity in sleep and wake-up schedules was shown to be associated with more extended sleep duration, with a distinct expression along the week and the weekend. Having to attend school and work, coupled with other socio-demographic and lifestyle factors, creates an unfavorable scenario for satisfactory sleep duration.

A non-autonomous strongly damped wave equation: Existence and continuity of the pullback attractor

In this paper we consider the strongly damped wave equation with time-dependent terms u(tt) - Delta u - gamma(t)Delta u(t) + beta(epsilon)(t)u(t) = f(u), in a bounded domain Omega subset of R(n), under some restrictions on beta(epsilon)(t), gamma(t) and growth restrictions on the nonlinear term f. The function beta(epsilon)(t) depends on a parameter epsilon, beta(epsilon)(t) -> 0. We will prove, under suitable assumptions, local and global well-posedness (using the uniform sectorial operators theory), the existence and regularity of pullback attractors {A(epsilon)(t) : t is an element of R}, uniform bounds for these pullback attractors, characterization of these pullback attractors and their upper and lower semicontinuity at epsilon = 0. (C) 2010 Elsevier Ltd. All rights reserved.

Positive solutions for the p-Laplacian involving critical and supercritical nonlinearities with zeros

In this paper we show the existence of multiple solutions to a class of quasilinear elliptic equations when the continuous non-linearity has a positive zero and it satisfies a p-linear condition only at zero. In particular, our approach allows us to consider superlinear, critical and supercritical nonlinearities. (C) 2009 Elsevier Masson SAS. All rights reserved.

Positive solutions of the p-Laplacian involving a superlinear nonlinearity with zeros

Using a combination of several methods, such as variational methods. the sub and supersolutions method, comparison principles and a priori estimates. we study existence, multiplicity, and the behavior with respect to lambda of positive solutions of p-Laplace equations of the form -Delta(p)u = lambda h(x, u), where the nonlinear term has p-superlinear growth at infinity, is nonnegative, and satisfies h(x, a(x)) = 0 for a suitable positive function a. In order to manage the asymptotic behavior of the solutions we extend a result due to Redheffer and we establish a new Liouville-type theorem for the p-Laplacian operator, where the nonlinearity involved is superlinear, nonnegative, and has positive zeros. (C) 2009 Elsevier Inc. All rights reserved.

On C(r)-closing for flows on orientable and non-orientable 2-manifolds

We provide an affirmative answer to the C(r)-Closing Lemma, r >= 2, for a large class of flows defined on every closed surface.

Template-based quadrilateral meshing

Generating quadrilateral meshes is a highly non-trivial task, as design decisions are frequently driven by specific application demands. Automatic techniques can optimize objective quality metrics, such as mesh regularity, orthogonality, alignment and adaptivity; however, they cannot make subjective design decisions. There are a few quad meshing approaches that offer some mechanisms to include the user in the mesh generation process; however, these techniques either require a large amount of user interaction or do not provide necessary or easy to use inputs. Here, we propose a template-based approach for generating quad-only meshes from triangle surfaces. Our approach offers a flexible mechanism to allow external input, through the definition of alignment features that are respected during the mesh generation process. While allowing user inputs to support subjective design decisions, our approach also takes into account objective quality metrics to produce semi-regular, quad-only meshes that align well to desired surface features. Published by Elsevier Ltd.

Testing permutation properties through subpermutations

There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this combinatorial structure, by considering only a randomly chosen substructure of sufficiently large, but constant size. These problems are called property testing and parameter testing, where a property or parameter is said to be testable if it can be estimated accurately in this way. The algorithmic appeal is evident, as, conditional on sampling, this leads to reliable constant-time randomized estimators. Our paper addresses property testing and parameter testing for permutations in a subpermutation perspective; more precisely, we investigate permutation properties and parameters that can be well approximated based on a randomly chosen subpermutation of much smaller size. In this context, we use a theory of convergence of permutation sequences developed by the present authors [C. Hoppen, Y. Kohayakawa, C.G. Moreira, R.M. Sampaio, Limits of permutation sequences through permutation regularity, Manuscript, 2010, 34pp.] to characterize testable permutation parameters along the lines of the work of Borgs et al. [C. Borgs, J. Chayes, L Lovasz, V.T. Sos, B. Szegedy, K. Vesztergombi, Graph limits and parameter testing, in: STOC`06: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, ACM, New York, 2006, pp. 261-270.] in the case of graphs. Moreover, we obtain a permutation result in the direction of a famous result of Alon and Shapira [N. Alon, A. Shapira, A characterization of the (natural) graph properties testable with one-sided error, SIAM J. Comput. 37 (6) (2008) 1703-1727.] stating that every hereditary graph property is testable. (C) 2011 Elsevier B.V. All rights reserved.