Existence of pullback attractors for pullback asymptotically compact processes

This paper is concerned with the existence of pullback attractors for evolution processes. Our aim is to provide results that extend the following results for autonomous evolution processes (semigroups) (i) An autonomous evolution process which is bounded, dissipative and asymptotically compact has a global attractor. (ii) An autonomous evolution process which is bounded, point dissipative and asymptotically compact has a global attractor. The extension of such results requires the introduction of new concepts and brings up some important differences between the asymptotic properties of autonomous and non-autonomous evolution processes. An application to damped wave problem with non-autonomous damping is considered. (C) 2009 Elsevier Ltd. All rights reserved.

TRANSITIVE CIRCLE EXCHANGE TRANSFORMATIONS WITH FLIPS

We study the existence of transit we exchange transformations with flips defined on the unit circle S(1). We provide a complete answer to the question of whether there exists a transitive exchange transformation of S(1) defined on a subintervals and having f flips.

Existence of Solution for a Class of Quasilinear Systems

This paper proves the existence of nontrivial solution for a class of quasilinear systems oil bounded domains in R(N), N >= 2, whose nonlinearity has a double criticality. The proof is based oil a linking theorem without the Palais-Smale condition.

Isometric immersions into a homogeneous Lorentzian Heisenberg group and rigidity

In this paper we prove an existence result for local and global isometric immersions of semi-Riemannian surfaces into the three dimensional Heisenberg group endowed with a homogeneous left-invariant Lorentzian metric. As a corollary, we prove a rigidity result for such immersions.

Dynamics of the viscous Cahn-Hilliard equation

We study generalized viscous Cahn-Hilliard problems with nonlinearities satisfying critical growth conditions in W-0(1,p)(Omega), where Omega is a bounded smooth domain in R-n, n >= 3. In the critical growth case, we prove that the problems are locally well posed and obtain a bootstrapping procedure showing that the solutions are classical. For p = 2 and almost critical dissipative nonlinearities we prove global well posedness, existence of global attractors in H-0(1)(Omega) and, uniformly with respect to the viscosity parameter, L-infinity(Omega) bounds for the attractors. Finally, we obtain a result on continuity of regular attractors which shows that, if n = 3, 4, the attractor of the Cahn-Hilliard problem coincides (in a sense to be specified) with the attractor for the corresponding semilinear heat equation. (C) 2008 Elsevier Inc. All rights reserved.

Schrodinger-Poisson equations without Ambrosetti-Rabinowitz condition

We prove the existence of ground state solutions for a stationary Schrodinger-Poisson equation in R(3). The proof is based on the mountain pass theorem and it does not require the Ambrosetti-Rabinowitz condition. (C) 2010 Elsevier Inc. All rights reserved.

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

Existence of secondary bifurcations or isolas for PDEs

In this paper, we introduce a method to conclude about the existence of secondary bifurcations or isolas of steady state solutions for parameter dependent nonlinear partial differential equations. The technique combines the Global Bifurcation Theorem, knowledge about the non-existence of nontrivial steady state solutions at the zero parameter value and explicit information about the coexistence of multiple nontrivial steady states at a positive parameter value. We apply the method to the two-dimensional Swift-Hohenberg equation. (C) 2011 Elsevier Ltd. All rights reserved.

Bubbling transition to spatial mode excitation in an extended dynamical system

We investigated the transition to spatio-temporal chaos in spatially extended nonlinear dynamical systems possessing an invariant subspace with a low-dimensional attractor. When the latter is chaotic and the subspace is transversely stable we have a spatially homogeneous state only. The onset of spatio-temporal chaos, i.e. the excitation of spatially inhomogeneous modes, occur through the loss of transversal stability of some unstable periodic orbit embedded in the chaotic attractor lying in the invariant subspace. This is a bubbling transition, since there is a switching between spatially homogeneous and nonhomogeneous states with statistical properties of on-off intermittency. Hence the onset of spatio-temporal chaos depends critically both on the existence of a chaotic attractor in the invariant subspace and its being transversely stable or unstable. (C) 2008 Elsevier B.V. All rights reserved.

Objective characterization of the course of the parasellar internal carotid artery using mathematical tools

Background Along the internal carotid artery (ICA), atherosclerotic plaques are often located in its cavernous sinus (parasellar) segments (pICA). Studies indicate that the incidence of pre-atherosclerotic lesions is linked with the complexity of the pICA; however, the pICA shape was never objectively characterized. Our study aims at providing objective mathematical characterizations of the pICA shape. Methods and results Three-dimensional (3D) computer models, reconstructed from contrast enhanced computed tomography (CT) data of 30 randomly selected patients (60 pICAs) were analyzed with modern visualization software and new mathematical algorithms. As objective measures for the pICA shape complexity, we provide calculations of curvature energy, torsion energy, and total complexity of 3D skeletons of the pICA lumen. We further measured the posterior knee of the so-called ""carotid siphon"" with a virtual goniometer and performed correlations between the objective mathematical calculations and the subjective angle measurements. Conclusions Firstly, our study provides mathematical characterizations of the pICA shape, which can serve as objective reference data for analyzing connections between pICA shape complexity and vascular diseases. Secondly, we provide an objective method for creating Such data. Thirdly, we evaluate the usefulness of subjective goniometric measurements of the angle of the posterior knee of the carotid siphon.

Three-dimensional description and mathematical characterization of the parasellar internal carotid artery in human infants

Inside the `cavernous sinus` or `parasellar region` the human internal carotid artery takes the shape of a siphon that is twisted and torqued in three dimensions and surrounded by a network of veins. The parasellar section of the internal carotid artery is of broad biological and medical interest, as its peculiar shape is associated with temperature regulation in the brain and correlated with the occurrence of vascular pathologies. The present study aims to provide anatomical descriptions and objective mathematical characterizations of the shape of the parasellar section of the internal carotid artery in human infants and its modifications during ontogeny. Three-dimensional (3D) computer models of the parasellar section of the internal carotid artery of infants were generated with a state-of-the-art 3D reconstruction method and analysed using both traditional morphometric methods and novel mathematical algorithms. We show that four constant, demarcated bends can be described along the infant parasellar section of the internal carotid artery, and we provide measurements of their angles. We further provide calculations of the curvature and torsion energy, and the total complexity of the 3D skeleton of the parasellar section of the internal carotid artery, and compare the complexity of this in infants and adults. Finally, we examine the relationship between shape parameters of the parasellar section of the internal carotid artery in infants, and the occurrence of intima cushions, and evaluate the reliability of subjective angle measurements for characterizing the complexity of the parasellar section of the internal carotid artery in infants. The results can serve as objective reference data for comparative studies and for medical imaging diagnostics. They also form the basis for a new hypothesis that explains the mechanisms responsible for the ontogenetic transformation in the shape of the parasellar section of the internal carotid artery.

Identifying the borders of mathematical knowledge

Based on a divide and conquer approach, knowledge about nature has been organized into a set of interrelated facts, allowing a natural representation in terms of graphs: each `chunk` of knowledge corresponds to a node, while relationships between such chunks are expressed as edges. This organization becomes particularly clear in the case of mathematical theorems, with their intense cross-implications and relationships. We have derived a web of mathematical theorems from Wikipedia and, thanks to the powerful concept of entropy, identified its more central and frontier elements. Our results also suggest that the central nodes are the oldest theorems, while the frontier nodes are those recently added to the network. The network communities have also been identified, allowing further insights about the organization of this network, such as its highly modular structure.

The information capacity of hypercycles

Hypercycles are information integration systems which are thought to overcome the information crisis of prebiotic evolution by ensuring the coexistence of several short templates. For imperfect template replication, we derive a simple expression for the maximum number of distinct templates n(m). that can coexist in a hypercycle and show that it is a decreasing function of the length L of the templates. In the case of high replication accuracy we find that the product n(m)L tends to a constant value, limiting thus the information content of the hypercycle. Template coexistence is achieved either as a stationary equilibrium (stable fixed point) or a stable periodic orbit in which the total concentration of functional templates is nonzero. For the hypercycle system studied here we find numerical evidence that the existence of an unstable fixed point is a necessary condition for the presence of periodic orbits. (C) 2008 Elsevier Ltd. All rights reserved.

Approximating a class of combinatorial problems with rational objective function

In the late seventies, Megiddo proposed a way to use an algorithm for the problem of minimizing a linear function a(0) + a(1)x(1) + ... + a(n)x(n) subject to certain constraints to solve the problem of minimizing a rational function of the form (a(0) + a(1)x(1) + ... + a(n)x(n))/(b(0) + b(1)x(1) + ... + b(n)x(n)) subject to the same set of constraints, assuming that the denominator is always positive. Using a rather strong assumption, Hashizume et al. extended Megiddo`s result to include approximation algorithms. Their assumption essentially asks for the existence of good approximation algorithms for optimization problems with possibly negative coefficients in the (linear) objective function, which is rather unusual for most combinatorial problems. In this paper, we present an alternative extension of Megiddo`s result for approximations that avoids this issue and applies to a large class of optimization problems. Specifically, we show that, if there is an alpha-approximation for the problem of minimizing a nonnegative linear function subject to constraints satisfying a certain increasing property then there is an alpha-approximation (1 1/alpha-approximation) for the problem of minimizing (maximizing) a nonnegative rational function subject to the same constraints. Our framework applies to covering problems and network design problems, among others.

Bootstrap percolation on homogeneous trees has 2 phase transitions

We study the threshold theta bootstrap percolation model on the homogeneous tree with degree b + 1, 2 <= theta <= b, and initial density p. It is known that there exists a nontrivial critical value for p, which we call p(f), such that a) for p > p(f), the final bootstrapped configuration is fully occupied for almost every initial configuration, and b) if p < p(f) , then for almost every initial configuration, the final bootstrapped configuration has density of occupied vertices less than 1. In this paper, we establish the existence of a distinct critical value for p, p(c), such that 0 < p(c) < p(f), with the following properties: 1) if p <= p(c), then for almost every initial configuration there is no infinite cluster of occupied vertices in the final bootstrapped configuration; 2) if p > p(c), then for almost every initial configuration there are infinite clusters of occupied vertices in the final bootstrapped configuration. Moreover, we show that 3) for p < p(c), the distribution of the occupied cluster size in the final bootstrapped configuration has an exponential tail; 4) at p = p(c), the expected occupied cluster size in the final bootstrapped configuration is infinite; 5) the probability of percolation of occupied vertices in the final bootstrapped configuration is continuous on [0, p(f)] and analytic on (p(c), p(f) ), admitting an analytic continuation from the right at p (c) and, only in the case theta = b, also from the left at p(f).