Epidemiological models with quadratic equation for endemic equilibria—A bifurcation atlas

The existence and occurrence, especially by a backward bifurcation, of endemic equilibria is of utmost importance in determining the spread and persistence of a disease. In many epidemiological models, the equation for the endemic equilibria is quadratic, with the coefficients determined by the parameters of the model. Despite its apparent simplicity, such an equation can describe an amazing number of dynamical behaviors. In this paper, we shall provide a comprehensive survey of possible bifurcation patterns, deriving explicit conditions on the equation's parameters for the occurrence of each of them, and discuss illustrative examples.     

Proof of a conjecture on irredundance perfect graphs

Let ir(G) and γ(G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H)=γ(H), for every induced subgraph H of G. In this article we present a result which immediately implies three known conjectures on irredundance perfect graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 41: 292–306, 2002     

Circular perfect graphs

For 1 ≤ d ≤ k, let K_k/d be the graph with vertices 0, 1, …, k ? 1, in which i ～j if d ≤ |i ? j| ≤ k ? d. The circular chromatic number χ_c(G) of a graph G is the minimum of those k/d for which G admits a homomorphism to K_k/d. The circular clique number ω_c(G) of G is the maximum of those k/d for which K_k/d admits a homomorphism to G. A graph G is circular perfect if for every induced subgraph H of G, we have χ_c(H) = ω_c(H). In this paper, we prove that if G is circular perfect then for every vertex x of G, N_G[x] is a perfect graph. Conversely, we prove that if for every vertex x of G, N_G[x] is a perfect graph and G ? N[x] is a bipartite graph with no induced P₅ (the path with five vertices), then G is a circular perfect graph. In a companion paper, we apply the main result of this paper to prove an analog of Haj?os theorem for circular chromatic number for k/d ≥ 3. Namely, we shall design a few graph operations and prove that for any k/d ≥ 3, starting from the graph K_k/d, one can construct all graphs of circular chromatic number at least k/d by repeatedly applying these graph operations. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 186–209, 2005     

Chern and Pontryagin Numbers in Perfect Symmetries of Spheres

The paper presents a procedure for constructing smooth actions of finite perfect groups on spheres with fixed point sets having certain prescribed properties (Theorem A); in particular, having any prescribed configuration of Chern and Pontryagin numbers (Corollary C). The main ingredients used are equivariant thickening and equivariant surgery.     

Mathematical models of innovation diffusion with stage structure

Mathematical models with stage structures are proposed to describe the process of awareness, evaluation and decision-making. First, a system of ordinary differential equations is presented that incorporates the awareness stage and the decision-making stage. If the adoption rate is bilinear and imitations are dominant, we find a threshold above which innovation diffusion is successful. Further, if the adoption rate has a higher nonlinearity, it is shown that there exist bistable equilibria and a region such that an innovation diffusion is successful inside and is unsuccessful outside. Secondly, a model with a time delay is proposed that includes an evaluation stage of a product. It is proved that the system exhibits stability switches. The bifurcation direction of equilibria is also discussed.     

On the origin of irreproducible behaviour of Na1−xLixNbO3 solid solutions

The irreproducibility of electrical properties of Na_0.88Li_0.12NbO₃ solid solution on thermal cycling reported by M.A.L. Nobre and S. Lanfredi is explained by gradual decomposition of the supersaturated solid solution below ca. 800 °C.     

Gk^d图的平面性和平面图的色数

利用欧拉公式研究了Gdk图的平面性,获得了一个重要定理,并由此得到了关于平面图色数的一个结论.     

On Nash Equilibria for Noncooperative Games Governed by the Burgers Equation

Existence of a Nash equilibrium in a noncooperative game governed by the one-dimensional Burgers equation, proposed in the case of pointwise controls in Ref. 1, is proved under data qualifications that guarantee the diffusion term in the Burgers’ equation to be dominant enough with respect to the uniform convexity of the payoffs. This work was partly supported by Grants 201/03/0934 (GA čR) and MSM 0021620839 (MšMT čR). Inspiring discussions with Angel M. Ramos are acknowledged.     

Making equation of state models predictive: Part 2: An improved PCP-SAFT equation of state

We use the PCP-SAFT equation of state, which is of the Van der Waals type and has a sound physical basis, to predict mixture properties, such as vapor–liquid and liquid–liquid equilibria, as well as excess enthalpies. We use molecular properties, such as dipole moment, quadrupole moment, polarizability and dispersion interaction coefficients, that have been determined quantum mechanically in Part I of this publication and adjust the remaining three pure compound parameters to pure compound data. We finally present a new combination rule for the dispersion energy parameter ? that is based on the quantum mechanically determined data. The predictions based on quantum mechanically determined pure compound properties along with the new combination rule show an improved performance compared to the original PCP-SAFT combination rule.