Bogoliubov Spectrum of Interacting Bose Gases

We study the large‐N limit of a system of N bosons interacting with a potential of intensity 1/N. When the ground state energy is to the first order given by Hartree's theory, we study the next order, predicted by Bogoliubov's theory. We show the convergence of the lower eigenvalues and eigenfunctions towards that of the Bogoliubov Hamiltonian (up to a convenient unitary transform). We also prove the convergence of the free energy when the system is sufficiently trapped. Our results are valid in an abstract setting, our main assumptions being that the Hartree ground state is unique and nondegenerate, and that there is complete Bose‐Einstein condensation on this state. Using our method we then treat two applications: atoms with “bosonic” electrons on one hand, and trapped two‐dimensional and three‐dimensional Coulomb gases on the other hand. © 2015 Wiley Periodicals, Inc.     

A boundary obstacle problem for the Mindlin–Timoshenko system

We consider the dynamical one‐dimensional Mindlin–Timoshenko model for beams. We study the existence of solutions for a contact problem associated with the Mindlin–Timoshenko system. We also analyze how its energy decays exponentially to zero as time goes to infinity. Copyright © 2008 John Wiley & Sons, Ltd.     

The initial value problem for some hyperbolic‐dispersive system

We consider the initial value problem for some nonlinear hyperbolic‐dispersive systems in one space dimension. Combining the classical energy method and the smoothing estimates for the Airy equation, we guarantee the time local well‐posedness for this system. We also discuss the extension of our results to more general hyperbolic‐dispersive system. Copyright © 2011 John Wiley & Sons, Ltd.     

Generalization of the Maxwell equation and relation to the elastic equation

In this paper, we propose a hyperbolic system of first‐order pseudo‐differential equations as generalization of the Maxwell equation. We state basic properties of this system corresponding to the ones of the (usual) Maxwell equation and explain that several known generalized Maxwell equations presented by some researchers can be integrated into the system. Namely, their equations can be regarded as our equation in special cases. Their generalized equations admit not only transversal but also longitudinal waves and are examined from the physical viewpoint. Using the present system, from the mathematical viewpoint, we interpret the meaning for presence of the longitudinal wave (with the transversal one) in their generalized equations. This presence means existence of more than one non‐zero characteristic root for the system (ie, non‐zero eigenvalue of the symbol). We prove also that our system becomes a first‐order expression of (generalized) elastic equations. Furthermore, it is shown that introducing the elastic equations implies expressing the generalized Maxwell equations by the potentials.     

Aggregation of microglia in 2D with string gradient weighted moving finite elements

Alzheimer's disease (AD) is a severe neurodegenerative disorder characterised by cognitive impairment and dementia. In the AD‐affected brain, microglia cells are up‐regulated and accumulate at senile plaques, the most prominent pathological feature of AD. In order to further study and predict the movement of activated microglia, we utilised their chemotactic properties. Specifically, we formulated the string gradient weighted moving finite element method for a system of partial differential equations in two dimensions, which includes nonlinear diffusion of a different variable found in chemotaxis models. The method was applied successfully to solve highly nonlinear chemorepulsion–chemorepellent models in two dimensions, and the results were compared with one‐dimensional results found previously in the literature. We conclude that the string gradient weighted moving finite element method is easily applied to chemotaxis models, in particular movement and aggregation of microglia, resulting in the ability to study the models extended in two dimensions efficiently. Our study highlights the feasibility and power of mathematical modelling to advance our understanding of pathophysiological processes in neurodegenerative diseases, including AD. Copyright © 2012 John Wiley & Sons, Ltd.     

Interaction of elementary waves on a boundary for a hyperbolic system of conservation laws

In this paper, we study the interaction of elementary waves including delta‐shock waves on a boundary for a hyperbolic system of conservation laws. A boundary entropy condition is derived, thanks to the results of Dubois and Le Floch (J. Differ. Equations 1988; 71 :93–122) by taking a suitable entropy–flux pair. We obtain the solutions of the initial‐boundary value problem for the system constructively, in which initial‐boundary data are piecewise constant states. Copyright © 2008 John Wiley & Sons, Ltd.     

A radiation condition for uniqueness in a wave propagation problem for 2‐D open waveguides

We study the uniqueness of solutions of Helmholtz equation for a problem that concerns wave propagation in waveguides. The classical radiation condition does not apply to our problem because the inhomogeneity of the index of refraction extends to infinity in one direction. Also, because of the presence of a waveguide, some waves propagate in one direction with different propagation constants and without decaying in amplitude. We provide an explicit condition for uniqueness for rectilinear waveguides, which takes into account the physically significant components, corresponding to guided and non‐guided waves; this condition reduces to the classical Sommerfeld–Rellich condition in the relevant cases. By a careful asymptotic analysis we prove that the solution derived by Magnanini and Santosa (SIAM J. Appl. Math. 2001; 61 :1237–1252) for stratified media satisfies our radiation condition. Copyright © 2008 John Wiley & Sons, Ltd.     

The modulus‐based matrix splitting algorithms for a class of weakly nonlinear complementarity problems

In this paper, we study a class of weakly nonlinear complementarity problems arising from the discretization of free boundary problems. By reformulating the complementarity problems as implicit fixed‐point equations based on splitting of the system matrices, we propose a class of modulus‐based matrix splitting algorithms. We show their convergence by assuming that the system matrix is positive definite. Moreover, we give several kinds of typical practical choices of the modulus‐based matrix splitting iteration methods based on the different splitting of the system matrix. Numerical experiments on two model problems are presented to illustrate the theoretical results and examine the numerical effectiveness of our modulus‐based matrix splitting algorithms. Copyright © 2016 John Wiley & Sons, Ltd.     

A modified Leslie–Gower predator–prey model with ratio‐dependent functional response and alternative food for the predator

In this work, a modified Leslie–Gower predator–prey model is analyzed, considering an alternative food for the predator and a ratio‐dependent functional response to express the species interaction. The system is well defined in the entire first quadrant except at the origin ( 0 , 0 ) . Given the importance of the origin ( 0 , 0 ) as it represents the extinction of both populations, it is convenient to provide a continuous extension of the system to the origin. By changing variables and a time rescaling, we obtain a polynomial differential equations system, which is topologically equivalent to the original one, obtaining that the non‐hyperbolic equilibrium point ( 0 , 0 ) in the new system is a repellor for all parameter values. Therefore, our novel model presents a remarkable difference with other models using ratio‐dependent functional response. We establish conditions on the parameter values for the existence of up to two positive equilibrium points; when this happen, one of them is always a hyperbolic saddle point, and the other can be either an attractor or a repellor surrounded by at least one limit cycle. We also show the existence of a separatrix curve dividing the behavior of the trajectories in the phase plane. Moreover, we establish parameter sets for which a homoclinic curve exits, and we show the existence of saddle‐node bifurcation, Hopf bifurcation, Bogdanov–Takens bifurcation, and homoclinic bifurcation. An important feature in this model is that the prey population can go to extinction; meanwhile, population of predators can survive because of the consumption of alternative food in the absence of prey. In addition, the prey population can attain their carrying capacity level when predators go to extinction. We demonstrate that the solutions are non‐negatives and bounded (dissipativity and permanence of population in many other works). Furthermore, some simulations to reinforce our mathematical results are shown, and we further discuss their ecological meanings. Copyright © 2017 John Wiley & Sons, Ltd.     

Augmenting the Edge‐Connectivity of a Hypergraph by Adding a Multipartite Graph

Given a hypergraph, a partition of its vertex set, and a nonnegative integer k, find a minimum number of graph edges to be added between different members of the partition in order to make the hypergraph k‐edge‐connected. This problem is a common generalization of the following two problems: edge‐connectivity augmentation of graphs with partition constraints (J. Bang‐Jensen, H. Gabow, T. Jordán, Z. Szigeti, SIAM J Discrete Math 12(2) (1999), 160–207) and edge‐connectivity augmentation of hypergraphs by adding graph edges (J. Bang‐Jensen, B. Jackson, Math Program 84(3) (1999), 467–481). We give a min–max theorem for this problem, which implies the corresponding results on the above‐mentioned problems, and our proof yields a polynomial algorithm to find the desired set of edges.     

Small vertex‐transitive and Cayley graphs of girth six and given degree: an algebraic approach

We examine the existing constructions of the smallest known vertex‐transitive graphs of a given degree and girth 6. It turns out that most of these graphs can be described in terms of regular lifts of suitable quotient graphs. A further outcome of our analysis is a precise identification of which of these graphs are Cayley. We also investigate higher level of transitivity of the smallest known vertex‐transitive graphs of a given degree and girth 6 and relate their constructions to near‐difference sets. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:265‐284, 2011     

A boundary integral equation for the transmission eigenvalue problem for Maxwell equation

We propose a new integral equation formulation to characterize and compute transmission eigenvalues in electromagnetic scattering. As opposed to the approach that was recently developed by Cakoni, Haddar and Meng (2015) which relies on a two‐by‐two system of boundary integral equations, our analysis is based on only one integral equation in terms of the electric‐to‐magnetic boundary trace operator that results in a simplification of the theory and in a considerable reduction of computational costs. We establish Fredholm properties of the integral operators and their analytic dependence on the wave number. Further, we use the numerical algorithm for analytic nonlinear eigenvalue problems that was recently proposed by Beyn (2012) for the numerical computation of the transmission eigenvalues via this new integral equation.     

Enhanced Euler's method to a free boundary porous media flow problem

We study an ODE‐based iterative method, the residual velocity method, for steady state free boundary problems. The convergence analysis of the method, as well as the numerical implementation based on Euler's method were provided by Donaldson and Wetton (J Appl Math 71 (2006), 877–897). In this article, we develop an enhanced Euler's method which is nearly as simple as the modified Euler's method but can achieve a rapid convergence rate similar to the fourth‐order Runge‐Kutta method. Numerical results are also provided to verify the validity of our method. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2012     

Primitivity and independent sets in direct products of vertex‐transitive graphs

We introduce the concept of the primitivity of independent set in vertex‐transitive graphs, and investigate the relationship between the primitivity and the structure of maximum independent sets in direct products of vertex‐transitive graphs. As a consequence of our main results, we positively solve an open problem related to the structure of independent sets in powers of vertex‐transitive graphs. © 2010 Wiley Periodicals, Inc. J Graph Theory 67: 218‐225, 2011     

Linear and non‐linear stability thresholds for thermal convection in a box

We analyse the problem of finding instability thresholds and global non‐linear stability bounds for thermal convection in a linearly viscous fluid in a finite box. The vertical walls are maintained at different temperatures which gives rise to a non‐uniform temperature field in steady state. This problem was previously analysed by Georgescu and Mansutti (Int. J. Non‐Linear Mech. 1999; 34 :603–613). In our work we determine the linear instability threshold to be well above the global stability boundary found by an energy method. Since the perturbed system is not symmetric we expect this to be the case, and our analysis yields a parameter region where possible sub‐critical instabilities may be found. Copyright © 2006 John Wiley & Sons, Ltd.     

Asymptotic behaviour for a non‐monotone fluid in one dimension: the positive temperature case

We consider a one‐dimensional continuous model of neutron star, described by a compressible Navier–Stokes system with a non‐monotone equation of state, due to the effective Skyrme nuclear interaction between particles. We study the asymptotic behaviour of globally defined solutions of a mixed free boundary problem for our model, for large time, assuming that a sufficient thermal dissipation is present. Copyright © 2001 John Wiley & Sons, Ltd.     

Disjoint Hamilton cycles in the random geometric graph

We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge‐length. For fixed k?1, weprove that the first edge in the process that creates a k‐connected graph coincides a.a.s. with the first edge that causes the graph to contain k/2 pairwise edge‐disjoint Hamilton cycles (for even k), or (k?1)/2 Hamilton cycles plus one perfect matching, all of them pairwise edge‐disjoint (for odd k). This proves and extends a conjecture of Krivelevich and M ler. In the special case when k = 2, our result says that the first edge that makes the random geometric graph Hamiltonian is a.a.s. exactly the same one that gives 2‐connectivity, which answers a question of Penrose. (This result appeared in three independent preprints, one of which was a precursor to this article.) We prove our results with lengths measured using the ?_p norm for any p>1, and we also extend our result to higher dimensions. © 2011 Wiley Periodicals, Inc. J Graph Theory 68:299‐322, 2011     

High‐girth cubic graphs are homomorphic to the Clebsch graph

We give a (computer assisted) proof that the edges of every graph with maximum degree 3 and girth at least 17 may be 5‐colored (possibly improperly) so that the complement of each color class is bipartite. Equivalently, every such graph admits a homomorphism to the Clebsch graph (Fig. 1 ). Hopkins and Staton [J Graph Theory 6(2) (1982), 115–121] and Bondy and Locke [J Graph Theory 10(4) (1986), 477–504] proved that every (sub)cubic graph of girth at least 4 has an edge‐cut containing at least of the edges. The existence of such an edge‐cut follows immediately from the existence of a 5‐edge‐coloring as described above; so our theorem may be viewed as a coloring extension of their result (under a stronger girth assumption). Every graph which has a homomorphism to a cycle of length five has an above‐described 5‐edge‐coloring; hence our theorem may also be viewed as a weak version of Ne?et?il's Pentagon Problem (which asks whether every cubic graph of sufficiently high girth is homomorphic to C₅). Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 66: 241—259, 2011     

Self‐organizing traffic lights at multiple‐street intersections

The elementary cellular automaton following rule 184 can mimic particles flowing in one direction at a constant speed. Therefore, this automaton can model highway traffic qualitatively. In a recent paper, we have incorporated intersections regulated by traffic lights to this model using exclusively elementary cellular automata. In such a paper, however, we only explored a rectangular grid. We now extend our model to more complex scenarios using an hexagonal grid. This extension shows first that our model can readily incorporate multiple‐way intersections and hence simulate complex scenarios. In addition, the current extension allows us to study and evaluate the behavior of two different kinds of traffic‐light controller for a grid of six‐way streets allowing for either two‐ or three‐street intersections: a traffic light that tries to adapt to the amount of traffic (which results in self‐organizing traffic lights) and a system of synchronized traffic lights with coordinated rigid periods (sometimes called the “green‐wave” method). We observe a tradeoff between system capacity and topological complexity. The green‐wave method is unable to cope with the complexity of a higher‐capacity scenario, while the self‐organizing method is scalable, adapting to the complexity of a scenario and exploiting its maximum capacity. Additionally, in this article, we propose a benchmark, independent of methods and models, to measure the performance of a traffic‐light controller comparing it against a theoretical optimum. © 2011 Wiley Periodicals, Inc. Complexity, 2012     

Two‐tier healthcare service systems and cost of waiting for patients

Waiting has been a significant concern for healthcare services. We address this issue in the context of a two‐tier service system in this study. A two‐tier healthcare service system consists of two different service providers, typically one public service provider and one private service provider. In a baseline model, the two service providers are modeled by two queue servers, which charge each patient a common fixed fee for the service. Then, we study a queue model in which one service provider offers a subsidy or charges a premium while the other maintains the fixed service fee. This system provides a mechanism to segment patients along their waiting time cost through price discrimination. We analyze the problem from both the perspective of minimizing total waiting cost for all patients and the perspective of maximizing social gain for the public service provider or profit for the private service provider. We show that this model can significantly alleviate the burden of waiting for patients. The study addresses the design, the efficiency, and the implementation of two‐tier healthcare service systems. Copyright © 2017 John Wiley & Sons, Ltd.