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     

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     

One‐dimensional q‐Dirac equation

In this paper, we introduce a q‐analog of 1‐dimensional Dirac equation. We investigate the existence and uniqueness of the solution of this equation. Later, we discuss some spectral properties of the problem, such as formally self‐adjointness, the case that the eigenvalues are real, orthogonality of eigenfunctions, Green function, existence of a countable sequence of eigenvalues, and eigenfunctions forming an orthonormal basis of . Finally, we give some examples.     

Analyzing Risky Choices: Q‐learning for Deal‐No‐Deal

In this paper, we derive an optimal strategy for the popular Deal or No Deal game show. To do this, we use Q‐learning methods, which quantify the continuation value inherent in sequential decision making in the game. We then analyze two contestants, Frank and Susanne, risky choices from the European version of the game. Given their choices and our optimal strategy, we find what their implied bounds would be on their levels of risk aversion. Previous empirical evidence in risky decision making has suggested that past outcomes affect future choices and that contestants have time‐varying risk aversion. We demonstrate that the strategies of Frank and Susanne are consistent with constant risk aversion levels except for their final risk‐seeking choice. We conclude with directions for future research. Copyright © 2013 John Wiley & Sons, Ltd.     

The geometry of t‐spreads in k‐walk‐regular graphs

A graph is walk‐regular if the number of closed walks of length ? rooted at a given vertex is a constant through all the vertices for all ?. For a walk‐regular graph G with d+1 different eigenvalues and spectrally maximum diameter D=d, we study the geometry of its d‐spreads, that is, the sets of vertices which are mutually at distance d. When these vertices are projected onto an eigenspace of its adjacency matrix, we show that they form a simplex (or tetrahedron in a three‐dimensional case) and we compute its parameters. Moreover, the results are generalized to the case of k‐walk‐regular graphs, a family which includes both walk‐regular and distance‐regular graphs, and their t‐spreads or vertices at distance t from each other. © 2009 Wiley Periodicals, Inc. J Graph Theory 64:312–322, 2010     

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     

Partitioning 2‐Edge‐Colored Ore‐Type Graphs by Monochromatic Cycles

Consider a graph G on n vertices satisfying the following Ore‐type condition: for any two nonadjacent vertices x and y of G, we have . We conjecture that if we color the edges of G with two colors then the vertex set of G can be partitioned to two vertex disjoint monochromatic cycles of distinct colors. In this article, we prove an asymptotic version of this conjecture.     

n ‐fold filters in BL‐algebras

In this paper we introduce n ‐fold (positive) implicative basis logic and the related algebras called n ‐fold (positive) implicative BL‐algebras. Also we define n ‐fold (positive) implicative filters and we prove some relations between these filters and construct quotient algebras via these filters. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Schrödinger‐Poisson system with Hardy‐Littlewood‐Sobolev critical exponent

In this paper, we consider the following Schrödinger‐Poisson system: where parameters α,β∈(0,3),λ>0, , , and are the Hardy‐Littlewood‐Sobolev critical exponents. For α<β and λ>0, we prove the existence of nonnegative groundstate solution to above system. Moreover, applying Moser iteration scheme and Kelvin transformation, we show the behavior of nonnegative groundstate solution at infinity. For β<α and λ>0 small, we apply a perturbation method to study the existence of nonnegative solution. For β<α and λ is a particular value, we show the existence of infinitely many solutions to above system.     

Web‐spline‐based finite element approximation of some quasi‐newtonian flows: Existence‐uniqueness and error bound

This article deals with the web‐spline‐based finite element approximation of quasi‐Newtonian flows. First, we consider the scalar elliptic p‐Laplace problem. Then, we consider quasi‐Newtonian flows where viscosity obeys power law or Carreau law. We prove well‐posedness at the continuous as well as the discrete level. We give some error bounds for the solution of quasi‐Newtonian flow problem based on the web‐spline method. Finally, we provide the numerical results for the p‐Laplace problem. © 2014 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq31: 54–77, 2015     

Generalized Dirichlet‐to‐Neumann Map in Time‐Dependent Domains

We study the heat, linear Schrödinger (LS), and linear KdV equations in the domain l(t) < x < ∞ , 0 < t < T , with prescribed initial and boundary conditions and with l(t) a given differentiable function. For the first two equations, we show that the unknown Neumann or Dirichlet boundary value can be computed as the solution of a linear Volterra integral equation with an explicit weakly singular kernel. This integral equation can be derived from the formal Fourier integral representation of the solution. For the linear KdV equation we show that the two unknown boundary values can be computed as the solution of a system of linear Volterra integral equations with explicit weakly singular kernels. The derivation in this case makes crucial use of analyticity and certain invariance properties in the complex spectral plane. The above Volterra equations are shown to admit a unique solution.     

Non‐self‐adjoint singular second‐order dynamic operators on time scale

In this study, maximal dissipative second‐order dynamic operators on semi‐infinite time scale are studied in the Hilbert space , that the extensions of a minimal symmetric operator in limit‐point case. We construct a self‐adjoint dilation of the dissipative operator together with its incoming and outgoing spectral representations so that we can determine the scattering function of the dilation as stated in the scheme of Lax‐Phillips. Moreover, we construct a functional model of the dissipative operator and identify its characteristic function in terms of the Weyl‐Titchmarsh function of a self‐adjoint second‐order dynamic operator. Finally, we prove the theorems on completeness of the system of root functions of the dissipative and accumulative dynamic operators.     

All (k;g)‐cages are k‐edge‐connected

A (k;g)‐cage is a k‐regular graph with girth g and with the least possible number of vertices. In this paper, we prove that (k;g)‐cages are k‐edge‐connected if g is even. Earlier, Wang, Xu, and Wang proved that (k;g)‐cages are k‐edge‐connected if g is odd. Combining our results, we conclude that the (k;g)‐cages are k‐edge‐connected. © 2005 Wiley Periodicals, Inc. J Graph Theory 48: 219–227, 2005     

Lorenz‐gauged vector potential formulations for the time‐harmonic eddy‐current problem with L∞‐regularity of material properties

In this paper, we consider some Lorenz‐gauged vector potential formulations of the eddy‐current problem for the time‐harmonic Maxwell equations with material properties having only L^∞‐regularity. We prove that there exists a unique solution of these problems, and we show the convergence of a suitable finite element approximation scheme. Moreover, we show that some previously proposed Lorenz‐gauged formulations are indeed formulations in terms of the modified magnetic vector potential, for which the electric scalar potential is vanishing. Copyright © 2007 John Wiley & Sons, Ltd.     

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.     

Fixed‐point theorem for a generalized almost Hardy‐Rogers‐type F contraction on metric‐like spaces

In this paper, we introduce some fixed‐point theorems for a generalized almost Hardy‐Rogers‐type F contraction in a metric‐like space and give an example to illustrate these main results. Moreover, we show the applications of electric circuit equations, second‐order differential equations, and fractional differential equations. Our results improve, generalize, and extend the corresponding results in literature.     

On generalized criss‐cross and near‐commutativity for n‐tuples

Here, we study multivariable versions of a generalization of Jacobson's lemma and give common spectral properties for n‐tuples that satisfy generalized criss‐cross or near commutativity.     

Literal‐paraconsistent and literal‐paracomplete matrices

We introduce a family of matrices that define logics in which paraconsistency and/or paracompleteness occurs only at the level of literals, that is, formulas that are propositional letters or their iterated negations. We give a sound and complete axiomatization for the logic defined by the class of all these matrices, we give conditions for the maximality of these logics and we study in detail several relevant examples. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Methods for the numerical solution of the Benjamin‐Bona‐Mahony‐Burgers equation

L^∞‐error estimates for finite element for Galerkin solutions for the Benjamin‐Bona‐Mahony‐Burgers (BBMB) equation are considered. A priori bound and the semidiscrete Galerkin scheme are studied using appropriate projections. For fully discrete Galerkin schemes, we consider the backward Euler method and analyze the corresponding error estimates. For a second order accuracy in time, we propose a three‐level backward method. © 2008 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Odd‐sized partitions of Russell‐sets

In the setting of ZF, i.e., Zermelo–Fraenkel set theory without the Axiom of Choice (AC), we study partitions of Russell‐sets into sets each with exactly n elements (called n ‐ary partitions), for some integer n. We show that if n is odd, then a Russell‐set X has an n ‐ary partition if and only if |X | is divisible by n. Furthermore, we establish that it is relative consistent with ZF that there exists a Russell‐set X such that |X | is not divisible by any finite cardinal n > 1 (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)