Four‐terminal reducibility and projective‐planar wye‐delta‐wye‐reducible graphs

A graph is YΔY‐reducible if it can be reduced to a vertex by a sequence of series‐parallel reductions and YΔY‐transformations. Terminals are distinguished vertices, that cannot be deleted by reductions and transformations. In this article, we show that four‐terminal planar graphs are YΔY‐reducible when at least three of the vertices lie on the same face. Using this result, we characterize YΔY‐reducible projective‐planar graphs. We also consider terminals in projective‐planar graphs, and establish that graphs of crossing‐number one are YΔY‐reducible. © 2000 John Wiley & Sons, Inc. J Graph Theory 33: 83–93, 2000     

The small‐is‐very‐small principle

The central result of this paper is the small‐is‐very‐small principle for restricted sequential theories. The principle says roughly that whenever the given theory shows that a definable property has a small witness, i.e., a witness in a sufficiently small definable cut, then it shows that the property has a very small witness: i.e., a witness below a given standard number. Which cuts are sufficiently small will depend on the complexity of the formula defining the property. We draw various consequences from the central result. E.g., roughly speaking, (i) every restricted, recursively enumerable sequential theory has a finitely axiomatized extension that is conservative with respect to formulas of complexity $\le n$; (ii) every sequential model has, for any n, an extension that is elementary for formulas of complexity $\le n$, in which the intersection of all definable cuts is the natural numbers; (iii) we have reflection for ${\mathrm{\Sigma }}_2^0$‐sentences with sufficiently small witness in any consistent restricted theory U; (iv) suppose U is recursively enumerable and sequential. Suppose further that every recursively enumerable and sequential V that locally inteprets U, globally interprets U. Then, U is mutually globally interpretable with a finitely axiomatized sequential theory. The paper contains some careful groundwork developing partial satisfaction predicates in sequential theories for the complexity measure depth of quantifier alternations.     

Asymptotic behavior of higher‐order Navier‐Stokes‐Cahn‐Hilliard systems

Our aim in this paper is to study the asymptotic behavior, in terms of finite‐dimensional attractors, for higher‐order Navier‐Stokes‐Cahn‐Hilliard systems. Such equations describe the evolution of a mixture of 2 immiscible incompressible fluids. We also give several numerical simulations.     

Hyper‐Archimedean BL‐algebras are MV‐algebras

Generalizations of Boolean elements of a BL‐algebra L are studied. By utilizing the MV‐center MV(L) of L, it is reproved that an element x ∈ L is Boolean iff x ∨ x * = 1 . L is called semi‐Boolean if for all x ∈ L, x * is Boolean. An MV‐algebra L is semi‐Boolean iff L is a Boolean algebra. A BL‐algebra L is semi‐Boolean iff L is an SBL‐algebra. A BL‐algebra L is called hyper‐Archimedean if for all x ∈ L, xⁿ is Boolean for some finite n ≥ 1. It is proved that hyper‐Archimedean BL‐algebras are MV‐algebras. The study has application in mathematical fuzzy logics whose Lindenbaum algebras are MV‐algebras or BL‐algebras. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Non‐Cayley‐isomorphic self‐complementary circulant graphs

Non‐CI self‐complementary circulant graphs of prime‐squared order are constructed and enumerated. It is shown that for prime p, there exists a self‐complementary circulant graph of order p² not Cayley isomorphic to its complement if and only if p ≡ 1 (mod 8). Such graphs are also enumerated. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 128–141, 2000     

Minimum vertex‐diameter‐2‐critical graphs

We prove that the minimum number of edges in a vertex‐diameter‐2‐critical graph on n ≥ 23 vertices is (5n ? 17)/2 if n is odd, and is (5n/2) ? 7 if n is even. © 2005 Wiley Periodicals, Inc. J Graph Theory     

Some 3‐connected 4‐edge‐critical non‐Hamiltonian graphs

Let γ(G) be the domination number of graph G, thus a graph G is k‐edge‐critical if γ (G) = k, and for every nonadjacent pair of vertices u and υ, γ(G + uυ) = k?1. In Chapter 16 of the book “Domination in Graphs—Advanced Topics,” D. Sumner cites a conjecture of E. Wojcicka under the form “3‐connected 4‐critical graphs are Hamiltonian and perhaps, in general (i.e., for any k ≥ 4), (k?1)‐connected, k‐edge‐critical graphs are Hamiltonian.” In this paper, we prove that the conjecture is not true for k = 4 by constructing a class of 3‐connected 4‐edge‐critical non‐Hamiltonian graphs. © 2005 Wiley Periodicals, Inc.     

Thermo‐visco‐elasticity for Norton‐Hoff‐type models with Cosserat effects

We consider the quasi‐static evolution of thermo‐visco‐elastic material. The main goal of this paper is to present how taking into account the additional effects may improve the result of solutions' existence. We added a micropolarity effect to thermo‐visco‐elastic model regarding Norton‐Hoff‐type constitutive function. This additional phenomenon improves the regularity of solution. Copyright © 2016 John Wiley & Sons, Ltd.     

Self‐dual and self‐petrie‐dual regular maps

Regular maps are cellular decompositions of surfaces with the “highest level of symmetry”, not necessarily orientation‐preserving. Such maps can be identified with three‐generator presentations of groups G of the form G = 〈a, b, c|a² = b² = c² = (ab)^k = (bc)^m = (ca)² = … = 1〉; the positive integers k and m are the face length and the vertex degree of the map. A regular map (G;a, b, c) is self‐dual if the assignment b?b, c?a and a?c extends to an automorphism of G, and self‐Petrie‐dual if G admits an automorphism fixing b and c and interchanging a with ca. In this note we show that for infinitely many numbers k there exist finite, self‐dual and self‐Petrie‐dual regular maps of vertex degree and face length equal to k. We also prove that no such map with odd vertex degree is a normal Cayley map. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 69:152‐159, 2012     

Complexity of clique‐coloring odd‐hole‐free graphs

In this paper we investigate the problem of clique‐coloring, which consists in coloring the vertices of a graph in such a way that no monochromatic maximal clique appears, and we focus on odd‐hole‐free graphs. On the one hand we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, but on the other hand it is NP‐hard to decide if they are 2‐clique‐colorable, and we do not know if there exists any bound k₀ such that they are all k₀ ‐clique‐colorable. First we will prove that (odd hole, codiamond)‐free graphs are 2‐clique‐colorable. Then we will demonstrate that the complexity of 2‐clique‐coloring odd‐hole‐free graphs is actually Σ₂ P‐complete. Finally we will study the complexity of deciding whether or not a graph and all its subgraphs are 2‐clique‐colorable. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 139–156, 2009     

Weak‐quasi‐Stone algebras

In this paper we shall introduce the variety WQS of weak‐quasi‐Stone algebras as a generalization of the variety QS of quasi‐Stone algebras introduced in [9]. We shall apply the Priestley duality developed in [4] for the variety N of ¬‐lattices to give a duality for WQS. We prove that a weak‐quasi‐Stone algebra is characterized by a property of the set of its regular elements, as well by mean of some principal lattice congruences. We will also determine the simple and subdirectly irreducible algebras (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

3‐Factor‐Criticality of Vertex‐Transitive Graphs

A graph of order n is p ‐factor‐critical, where p is an integer of the same parity as n, if the removal of any set of p vertices results in a graph with a perfect matching. 1‐factor‐critical graphs and 2‐factor‐critical graphs are factor‐critical graphs and bicritical graphs, respectively. It is well known that every connected vertex‐transitive graph of odd order is factor‐critical and every connected nonbipartite vertex‐transitive graph of even order is bicritical. In this article, we show that a simple connected vertex‐transitive graph of odd order at least five is 3‐factor‐critical if and only if it is not a cycle.     

A high‐order Godunov method for one‐dimensional convection‐diffusion‐reaction problems

In this article we develop a high‐order Godunov method for one‐dimensional convection‐diffusion‐reaction problems where convection dominates diffusion. The heart of this method comes from incorporating the diffusion term via the slope of the linear representation (recovery) of the solution on each grid cell. The method is conservative and explicit. Therefore, it is efficient in computing time. For constant coefficient linear convection, diffusion, and Lipschitz‐type reaction, the properties of the total variation stability and monotonicity preservation are proved. An error estimation is derived. Computational examples are presented and compared with the exact solutions. © 2000 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 16: 495–512, 2000     

On non‐autonomous integro‐differential‐algebraic evolutionary problems

In this article, we show that a technique for showing well‐posedness results for evolutionary equations in the sense of Picard and McGhee [Picard, McGhee, Partial Differential Equations: A unified Hilbert Space Approach, DeGruyter, Berlin, 2011] established in [Picard, Trostorff, Wehowski, Waurick, On non‐autonomous evolutionary problems. J. Evol. Equ. 13:751‐776, 2013] applies to a broader class of non‐autonomous integro‐differential‐algebraic equations. Using the concept of evolutionary mappings, we prove that the respective solution operators do not depend on certain parameters describing the underlying spaces in which the well‐posedness results are established. Copyright © 2014 John Wiley & Sons, Ltd.     

Life‐like self‐reproducers

In order to understand the interplay among information, genetic instructions, and phenotypic variations, self‐reproducers discovered in two‐dimensional cellular automata are considered as proto‐organisms, which undergo to mutations as they were in a real environmental situation. We realized a computational model through which we have been able to discover the genetic map of the self‐reproducers and the networks they use. Identifying in these maps sets of different functional genes, we found that mutations in the genetic sequences could affect both external shapes and behavior of the self‐reproducers, thus realizing different life‐like strategies in the evolution process. The results highlight that some strategies evolution uses in selecting organisms that are fitting with changing environmental situations maintain the self‐reproducing function, whereas other variations create new self‐reproducers. These self‐reproducers in turn realize different genetic networks, which can be very different from the basic ancestors pools. The mutations that are disruptive bring self‐reproducers to disappear, while other proto‐organisms are generated. © 2004 Wiley Periodicals, Inc. Complexity 9: 38–55, 2004     

Incomplete Self‐Similar Blow‐Up in a Semilinear Fourth‐Order Reaction‐Diffusion Equation

Blow‐up behavior for the fourth‐order semilinear reaction‐diffusion equation (1) is studied. For the classic semilinear heat equation from combustion theory (2) various blow‐up patterns were investigated since 1970s, while the case of higher‐order diffusion was studied much less. Blow‐up self‐similar solutions of (1) of the form are constructed. These are shown to admit global similarity extensions for t > T : The continuity at t = T is preserved in the sense that This is in a striking difference with blow‐up for (2) , which is known to be always complete in the sense that the minimal (proper) extension beyond blow‐up is u(x, t) ≡+∞ for t > T . Difficult fourth‐order dynamical systems for extension pairs {f(y), F(y)} are studied by a combination of various analytic, formal, and numerical methods. Other nonsimilarity patterns for (1) with nongeneric complete blow‐up are also discussed.     

Connected‐Homomorphism‐Homogeneous Graphs

A relational structure is (connected‐) homogeneous if every isomorphism between finite (connected) substructures extends to an automorphism of the structure. We investigate notions that generalise (connected‐) homogeneity, where ‘isomorphism’ may be replaced by ‘homomorphism’ or ‘monomorphism’ in the definition. In particular, we study the classes of finite connected‐homomorphism‐homogeneous graphs, with the aim of producing classifications. The main result is a classification of the finite graphs, where a graph G is if every homomorphism from a finite connected induced subgraph of G into G extends to an endomorphism of G. The finite (connected‐homogeneous) graphs were classified by Gardiner in 1976, and from this we obtain classifications of the finite and finite graphs. Although not all the classes of finite connected‐homomorphism‐homogeneous graphs are completely characterised, we may still obtain the final hierarchy picture for these classes.     

Non‐isolated quasi‐degrees

We show that non‐isolated from below 2‐c.e. Q ‐degrees are dense in the structure of c.e. Q ‐degrees. We construct a 2‐c.e. Q ‐degree, which can't be isolated from below not only by c.e. Q ‐degrees, but by any Q ‐degree. We also prove that below any c.e. Q ‐degree there is a 2‐c.e. Q ‐degree, which is non‐isolated from below and from above (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Global solutions to the Navier‐Stokes‐Landau‐Lifshitz system

This paper is dedicated to the study of the Navier‐Stokes‐Landau‐Lifshitz system. We obtain the global existence of a unique solution for this system without any small conditions imposed on the third component of the initial velocity field. Our methods mainly rely upon the Fourier frequency localization and Bony's paraproduct decomposition.