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)     

Kripke‐style semantics for many‐valued logics

This paper deals with Kripke‐style semantics for many‐valued logics. We introduce various types of Kripke semantics, and we connect them with algebraic semantics. As for modal logics, we relate the axioms of logics extending MTL to properties of the Kripke frames in which they are valid. We show that in the propositional case most logics are complete but not strongly complete with respect to the corresponding class of complete Kripke frames, whereas in the predicate case there are important many‐valued logics like BL, ? and Π, which are not even complete with respect to the class of all predicate Kripke frames in which they are valid. Thus although very natural, Kripke semantics seems to be slightly less powerful than algebraic semantics. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Regularity of weak solutions to rate‐independent systems in one‐dimension

We show that under some appropriate assumptions, every weak solution (e.g. energetic solution) to a given rate‐independent system is of class SBV, or has finite jumps, or is even piecewise C¹. Our assumption is essentially imposed on the energy functional, but not convexity is required.     

Intersection homology with field coefficients: K‐Witt spaces and K‐Witt bordism

We construct geometric examples of pseudomanifolds that satisfy the Witt condition for intersection homology Poincaré duality with respect to certain fields but not others. We then compute the bordism theory of K‐Witt spaces for an arbitrary field K, extending results of Siegel for K = ?. © 2008 Wiley Periodicals, Inc.     

A uniformly optimal‐order estimate for finite volume method for advection‐diffusion equations

We prove an optimal‐order error estimate in a weighted energy norm for finite volume method for two‐dimensional time‐dependent advection–diffusion equations on a uniform space‐time partition of the domain. The generic constants in the estimates depend only on certain norms of the true solution but not on the scaling parameter. These estimates, combined with a priori stability estimates of the governing partial differential equations with full regularity, yield a uniform estimate of the finite volume method, in which the generic constants depend only on the Sobolev norms of the initial and right side data but not on the scaling parameter. We use the interpolation of spaces and stability estimates to derive a uniform estimate for problems with minimal or intermediate regularity, where the convergence rates are proportional to certain Besov norms of the initial and right‐hand side data. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 30: 17‐43, 2014     

Algebraization of logics defined by literal‐paraconsistent or literal‐paracomplete matrices

We study the algebraizability of the logics constructed using literal‐paraconsistent and literal‐paracomplete matrices described by Lewin and Mikenberg in [11], proving that they are all algebraizable in the sense of Blok and Pigozzi in [3] but not finitely algebraizable. A characterization of the finitely algebraizable logics defined by LPP‐matrices is given. We also make an algebraic study of the equivalent algebraic semantics of the logics associated to the matrices ??³_2,2, ??³_2,1, ??³_1,1, ??³_1,3, and ??⁴ appearing in [11] proving that they are not varieties and finding the free algebra over one generator. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Epsilon‐stable quasi‐static brittle fracture evolution

We introduce a new definition of stability, ε‐stability, that implies local minimality and is robust enough for passing from discrete‐time to continuous‐time quasi‐static evolutions, even with very irregular energies. We use this to give the first existence result for quasi‐static crack evolutions that both predicts crack paths and produces states that are local minimizers at every time, but not necessarily global minimizers. The key ingredient in our model is the physically reasonable property, absent in global minimization models, that whenever there is a jump in time from one state to another, there must be a continuous path from the earlier state to the later along which the energy is almost decreasing. It follows that these evolutions are much closer to satisfying Griffith's criterion for crack growth than are solutions based on global minimization, and initiation is more physical than in global minimization models. © 2009 Wiley Periodicals, Inc.     

Clique‐coloring some classes of odd‐hole‐free graphs

We consider the problem of clique‐coloring, that is coloring the vertices of a given graph such that no maximal clique of size at least 2 is monocolored. Whereas we do not know any odd‐hole‐free graph that is not 3‐clique‐colorable, the existence of a constant C such that any perfect graph is C‐clique‐colorable is an open problem. In this paper we solve this problem for some subclasses of odd‐hole‐free graphs: those that are diamond‐free and those that are bull‐free. We also prove the NP‐completeness of 2‐clique‐coloring K₄‐free perfect graphs. © 2006 Wiley Periodicals, Inc. J Graph Theory 53: 233–249, 2006     

One‐level Newton–Krylov–Schwarz algorithm for unsteady non‐linear radiation diffusion problem

In this paper, we present a parallel Newton–Krylov–Schwarz (NKS)‐based non‐linearly implicit algorithm for the numerical solution of the unsteady non‐linear multimaterial radiation diffusion problem in two‐dimensional space. A robust solver technology is required for handling the high non‐linearity and large jumps in material coefficients typically associated with simulations of radiation diffusion phenomena. We show numerically that NKS converges well even with rather large inflow flux boundary conditions. We observe that the approach is non‐linearly scalable, but not linearly scalable in terms of iteration numbers. However, CPU time is more important than the iteration numbers, and our numerical experiments show that the algorithm is CPU‐time‐scalable even without a coarse space given that the mesh is fine enough. This makes the algorithm potentially more attractive than multilevel methods, especially on unstructured grids, where course grids are often not easy to construct. Copyright © 2004 John Wiley & Sons, Ltd.     

Semi‐transitive graphs

In this paper, we first consider graphs allowing symmetry groups which act transitively on edges but not on darts (directed edges). We see that there are two ways in which this can happen and we introduce the terms bi‐transitive and semi‐transitive to describe them. We examine the elementary implications of each condition and consider families of examples; primary among these are the semi‐transitive spider‐graphs PS(k,N;r) and MPS(k,N;r). We show how a product operation can be used to produce larger graphs of each type from smaller ones. We introduce the alternet of a directed graph. This links the two conditions, for each alternet of a semi‐transitive graph (if it has more than one) is a bi‐transitive graph. We show how the alternets can be used to understand the structure of a semi‐transitive graph, and that the action of the group on the set of alternets can be an interesting structure in its own right. We use alternets to define the attachment number of the graph, and the important special cases of tightly attached and loosely attached graphs. In the case of tightly attached graphs, we show an addressing scheme to describe the graph with coordinates. Finally, we use the addressing scheme to complete the classification of tightly attached semi‐transitive graphs of degree 4 begun by Marus?ic? and Praeger. This classification shows that nearly all such graphs are spider‐graphs. © 2003 Wiley Periodicals, Inc. J Graph Theory 45: 1–27, 2004     

Students' Concepts‐ and Theorems‐in‐Action on a Novel Task About Similarity

Similarity is a fundamental concept in the middle grades. In this study, we applied Vergnaud's theory of conceptual fields to answer the following questions: What concepts‐in‐action and theorems‐in‐action about similarity surfaced when students worked in a novel task that required them to enlarge a puzzle piece? How did students use geometric and multiplicative reasoning at the same time in order to construct similar figures? We found that students used concepts of scaling and proportional reasoning, as well as the concept of circle and theorems about similar triangles, in their work on the problem. Students relied not only on visual perception, but also on numeric reasoning. Moreover, students' use of multiplicative and proportional concepts supported their geometric constructions. Knowledge of the concepts and ideas that students have available when working on a task about similarity can inform instruction by helping to ground formal introduction of new concepts in students' informal prior experiences and knowledge.     

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     

A uniform estimate for the MMOC for two‐dimensional advection‐diffusion equations

We prove an optimal‐order error estimate in a weighted energy norm for the modified method of characteristics (MMOC) and the modified method of characteristics with adjusted advection (MMOCAA) for two‐dimensional time‐dependent advection‐diffusion equations, in the sense that the generic constants in the estimates depend on certain Sobolev norms of the true solution but not on the scaling diffusion parameter ε. © 2009 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2010     

A Crank‐Nicolson Petrov‐Galerkin method with quadrature for semi‐linear parabolic problems

We propose and analyze an application of a fully discrete C² spline quadrature Petrov‐Galerkin method for spatial discretization of semi‐linear parabolic initial‐boundary value problems on rectangular domains. We prove second order in time and optimal order H¹ norm convergence in space for the extrapolated Crank‐Nicolson quadrature Petrov‐Galerkin scheme. We demonstrate numerically both L² and H¹ norm optimal order convergence of the scheme even if the nonlinear source term is not smooth. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005.     

Uniform attractor for non‐autonomous Boussinesq‐type equation with critical nonlinearity

In this paper, we study the longtime dynamics of the non‐autonomous Boussinesq‐type equation with critical nonlinearity, and time‐dependent external forcing, which is translation bounded but not translation compact. We prove the existence of a uniform attractor in . Copyright © 2015 John Wiley & Sons, Ltd.     

Local well‐posedness and blow‐up criterion for a compressible Navier‐Stokes‐Fourier‐P1 approximate model arising in radiation hydrodynamics

We establish a local well‐posedness and a blow‐up criterion of strong solutions for the compressible Navier‐Stokes‐Fourier‐P1 approximate model arising in radiation hydrodynamics. For the local well‐posedness result, we do not need the assumption on the positivity of the initial density and it may vanish in an open subset of the domain.     

Average‐case complexity of shortest‐paths problems in the vertex‐potential model

We study the average‐case complexity of shortest‐paths problems in the vertex‐potential model. The vertex‐potential model is a family of probability distributions on complete directed graphs with arbitrary real edge lengths, but without negative cycles. We show that on a graph with n vertices and with respect to this model, the single‐source shortest‐paths problem can be solved in O(n²) expected time, and the all‐pairs shortest‐paths problem can be solved in O(n² log n) expected time. ©2000 John Wiley & Sons, Inc. Random Struct. Alg., 16, 33–46, 2000     

Towards a Ryll‐Nardzewski‐type theorem for weakly oligomorphic structures

A structure is called weakly oligomorphic if its endomorphism monoid has only finitely many invariant relations of every arity. The goal of this paper is to show that the notions of homomorphism‐homogeneity, and weak oligomorphy are not only completely analogous to the classical notions of homogeneity and oligomorphy, but are actually closely related. We first prove a Fraïssé‐type theorem for homomorphism‐homogeneous relational structures. We then show that the countable models of the theories of countable weakly oligomorphic structures are mutually homomorphism‐equivalent (we call first order theories with this property weakly ω‐categorical). Furthermore we show that every weakly oligomorphic homomorphism‐homogeneous structure contains (up to isomorphism) a unique homogeneous, homomorphism‐homogeneous core, to which it is homomorphism‐equivalent. As a consequence we obtain that every countable weakly oligomorphic structure is homomorphism‐equivalent to a finite or ω‐categorical structure. As a corollary we obtain a characterization of positive existential theories of weakly oligomorphic structures as the positive existential parts of ω‐categorical theories.     

A non‐commutative Landau‐Zener formula

We study semi‐classical measures of families of solutions to a 2 × 2 Dirac system with 0 mass, which presents bands crossing. We focus on constant electro‐magnetic fields. The fact that these fields are orthogonal or not leads to different geometric situations. In the first case, one reduces to some well‐understood model problem. For studying the second case, we introduce some two‐scale semi‐classical measures associated with symplectic submanifold. These measures are operator‐valued measures and the transfer of energy at the crossing is described by a non‐commutative Landau‐Zener formula for these measures. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hamiltonicity of random graphs produced by 2‐processes

Suppose that a random graph begins with n isolated vertices and evolves by edges being added at random, conditional upon all vertex degrees being at most 2. The final graph is usually 2‐regular, but is not uniformly distributed. Some properties of this final graph are already known, but the asymptotic probability of being a Hamilton cycle was not known. We answer this question along with some related questions about cycles arising in the process. © 2006 Wiley Periodicals, Inc. Random Struct. Alg., 2007