Generating quadrangulations of surfaces with minimum degree at least 3

In this article, we show that all quadrangulations of the sphere with minimum degree at least 3 can be constructed from the pseudo‐double wheels, preserving the minimum degree at least 3, by a sequence of two kinds of transformations called “vertex‐splitting” and “4‐cycle addition.” We also consider such generating theorems for other closed surfaces. These theorems can be translated into those of 4‐regular graphs on surfaces by taking duals. © 1999 John Wiley & Sons, In. J Graph Theory 30: 223–234, 1999     

Infinite loop space structure(s) on the stable mapping class group

Tillmann introduced two infinite loop space structures on the plus construction of the classifying space of the stable mapping class group, each with different computational advantages (Invent. Math. 130 (1997) 257; Math. Ann. 317 (2000) 613). The first one uses disjoint union on a suitable cobordism category, whereas the second uses an operad which extends the pair of pants multiplication (i.e. the double loop space structure introduced by Miller, J. Differential Geom. 24 (1986) 1). She conjectured that these two infinite loop space structures were equivalent, and managed to prove that the first delooping are the same. In this paper, we resolve the conjecture by proving that the two structures are indeed equivalent, exhibiting an explicit geometric map.     

Symmetries for the Ablowitz–Ladik Hierarchy: Part I. Four‐Potential Case

In the paper, we first investigate symmetries of isospectral and non‐isospectral four‐potential Ablowitz–Ladik hierarchies. We express these hierarchies in the form of u_n,t= L^mH⁽⁰⁾ , where m is an arbitrary integer (instead of a nature number) and L is the recursion operator. Then by means of the zero‐curvature representations of the isospectral and non‐isospectral flows, we construct symmetries for the isospectral equation hierarchy as well as non‐isospectral equation hierarchy, respectively. The symmetries, respectively, form two centerless Kac‐Moody‐Virasoro algebras. The recursion operator L is proved to be hereditary and a strong symmetry for this isospectral equation hierarchy. Besides, we make clear for the relation between four‐potential and two‐potential Ablowitz–Ladik hierarchies. The even order members in the four‐potential Ablowitz–Ladik hierarchies together with their symmetries and algebraic structures can be reduced to two‐potential case. The reduction keeps invariant for the algebraic structures and the recursion operator for two potential case becomes L² .     

Square function estimates on layer potentials for higher‐order elliptic equations

In this paper we establish square‐function estimates on the double and single layer potentials for divergence form elliptic operators, of arbitrary even order 2m , with variable t‐independent coefficients in the upper half‐space. This generalizes known results for variable‐coefficient second‐order operators, and also for constant‐coefficient higher‐order operators.     

Cycle‐Continuous Mappings—Order Structure

Given two graphs, a mapping between their edge‐sets is cycle‐continuous , if the preimage of every cycle is a cycle. The motivation for this definition is Jaeger's conjecture that for every bridgeless graph there is a cycle‐continuous mapping to the Petersen graph, which, if solved positively, would imply several other important conjectures (e.g., the Cycle double cover conjecture). Answering a question of DeVos, Ne?et?il, and Raspaud, we prove that there exists an infinite set of graphs with no cycle‐continuous mapping between them. Further extending this result, we show that every countable poset can be represented by graphs and the existence of cycle‐continuous mappings between them.     

On order‐reducible sinc discretizations and block‐diagonal preconditioning methods for linear third‐order ordinary differential equations

By introducing a variable substitution, we transform the two‐point boundary value problem of a third‐order ordinary differential equation into a system of two second‐order ordinary differential equations (ODEs). We discretize this order‐reduced system of ODEs by both sinc‐collocation and sinc‐Galerkin methods, and average these two discretized linear systems to obtain the target system of linear equations. We prove that the discrete solution resulting from the linear system converges exponentially to the true solution of the order‐reduced system of ODEs. The coefficient matrix of the linear system is of block two‐by‐two structure, and each of its blocks is a combination of Toeplitz and diagonal matrices. Because of its algebraic properties and matrix structures, the linear system can be effectively solved by Krylov subspace iteration methods such as GMRES preconditioned by block‐diagonal matrices. We demonstrate that the eigenvalues of certain approximation to the preconditioned matrix are uniformly bounded within a rectangle on the complex plane independent of the size of the discretized linear system, and we use numerical examples to illustrate the feasibility and effectiveness of this new approach. Copyright © 2013 John Wiley & Sons, Ltd.     

Nonlocal Tug‐of‐War and the Infinity Fractional Laplacian

Motivated by the “tug‐of‐war” game studied by Peres et al. in 2009, we consider a nonlocal version of the game that goes as follows: at every step two players pick, respectively, a direction and then, instead of flipping a coin in order to decide which direction to choose and then moving a fixed amount ϵ > 0 (as is done in the classical case), it is an s‐stable Levy process that chooses at the same time both the direction and the distance to travel. Starting from this game, we heuristically derive a deterministic nonlocal integrodifferential equation that we call the “infinity fractional Laplacian.” We study existence, uniqueness, and regularity, both for the Dirichlet problem and for a double‐obstacle problem, both problems having a natural interpretation as tug‐of‐war games. © 2011 Wiley Periodicals, Inc.     

Bilinear Form and N‐Shock‐Wave Solutions for a (2+1)‐Dimensional Breaking Soliton Equation in Certain Fluids with the Bell Polynomials and Auxiliary Function

In this paper, we will investigate a (2+1)‐dimensional breaking soliton (BS) equation for the (2+1)‐dimensional collision of a Riemann wave with a long wave in certain fluids. Using the Bell polynomials and an auxiliary function, we derive a new bilinear form for the (2+1)‐dimensional BS equation, which is different from those in the previous literatures. One‐, two‐ and N‐shock‐wave solutions are obtained with the Hirota method and symbolic computation. One shock wave is found to be able to stably propagate. Two shock waves are observed to have the parallel collision, oblique collision, and stable propagation of the V‐type structure. In addition, we present the collision between one shock wave and V‐type structure, and the collision between two V‐type structures.     

On the exact solutions,lie symmetry analysis,and conservation laws of Schamel–Korteweg–de Vries equation

In this work, we study the integrability aspects of the Schamel–Korteweg–de Vries equation that play an important role in studying the effect of electron trapping on the nonlinear interaction of ion‐acoustic waves by including a quasi‐potential. Lie symmetry analysis together with the simplest equation method and Kudryashov method is used to obtain exact traveling wave solutions for this equation. In addition, conservation laws are constructed using two different techniques, namely, the multiplier method and the new conservation theorem. Using the conservation laws and symmetries of the underlying equation, double reduction and exact solution were also constructed. Copyright © 2017 John Wiley & Sons, Ltd.     

A finite difference scheme for solving parabolic two‐step micro‐heat transport equations in a double‐layered micro‐sphere heated by ultrashort‐pulsed lasers

Ultrashort‐pulsed lasers with pulse durations of the order of sub‐picosecond to femtosecond domain possess exclusive capabilities in limiting the undesirable spread of the thermal process zone in the heated sample. Parabolic two‐step micro heat transport equations have been widely applied for thermal analysis of thin metal films exposed to picosecond thermal pulses. In this study, we develop a three‐level finite difference scheme for solving the micro heat transport equations in a double‐layered micro sphere. It is shown by the discrete energy method that the scheme is unconditionally stable. Numerical results for thermal analysis of a gold layer coated on a chromium padding layer are obtained. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2006     

Solutions of Nonlocal Equations Reduced from the AKNS Hierarchy

In this paper, nonlocal reductions of the Ablowitz–Kaup–Newell–Suger (AKNS) hierarchy are collected, including the nonlocal nonlinear Schrödinger hierarchy, nonlocal modified Korteweg‐de Vries hierarchy, and nonlocal versions of the sine‐Gordon equation in nonpotential form. A reduction technique for solutions is employed, by which exact solutions in double Wronskian form are obtained for these reduced equations from those double Wronskian solutions of the AKNS hierarchy. As examples of dynamics, we illustrate new interaction of two‐soliton solutions of the reverse‐t nonlinear Schrödinger equation. Although as a single soliton, it is stationary that two solitons travel along completely symmetric trajectories in plane and their amplitudes are affected by phase parameters. Asymptotic analysis is given as demonstration. The approach and relation described in this paper are systematic and general and can be used to other nonlocal equations.     

Contract design and supply chain coordination in the electricity industry

In this article we propose a model of the supply chain in electricity markets with multiple generators and retailers and considering several market structures. We analyze how market design interacts with the different types of contract and market structure to affect the coordination between the different firms and the performance of the supply chain as a whole. We compare the implications on supply chain coordination and on the players’ profitability of two different market structures: a pool based market vs. bilateral contracts, taking into consideration the relationship between futures and spot markets. Furthermore, we analyze the use of contracts for differences and two-part-tariffs as tools for supply chain coordination. We have concluded that there are multiple equilibria in the supply chain contracts and structure and that the two-part tariff is the best contract to reduce double marginalization and increase efficiency in the management of the supply chain.     

Structural and functional growth in self‐reproducing cellular automata

In this article, we analyze the dynamics of change in two‐dimensional self‐reproducers, identifying the processes that drive their evolution. We show that changes in self‐reproducers structure and behavior depend on their genetic memory. This consists of distinct yet interlinked components determining their form and function. In some cases these components degrade gracefully, changing only slightly; in others the changes destroy the original structure and function of the self‐reproducer. We sketch these processes at the genotype and the phenotype level—showing that they follow distinct trajectories within mutation space and quantifying the degree of change produced by different trajectories. We show that changes in structure and behavior depend on the interplay between the genotype and the phenotype. This determines universal structures, from which it is possible to construct a great number of self‐reproducing systems, as we observe in biology. Creative processes of change produce divergent and/or convergent methods for the generation of self‐reproducers. Divergence involves the creation of completely new information convergence involves local change and specialization of the structures concerned. © 2006 Wiley Periodicals, Inc. Complexity 11: 12–29, 2006     

双目标规划问题的像集与求解

经济管理的决策目标往往与成本、收益相关,双目标规划在经济管理中具有广泛应用.然而,尚缺乏成熟的算法确定双目标规划问题的全部解.给出双目标规划问题像集的一般性确定法,以求其解,为研究目的所在.具体而言,构造一个带等式约束的单目标规划问题,以确定双目标规划问题像集之部分边界,并借助拉格朗日乘子符号判断其单调性,据此确定原问题的帕累托解与弱帕累托解.这相当于提供了一个求解双目标规划问题的一般性框架.     

Constructing regular self‐complementary uniform hypergraphs

In this article, we examine the possible orders of t‐subset‐regular self‐complementary k‐uniform hypergraphs, which form examples of large sets of two isomorphic t‐designs. We reformulate Khosrovshahi and Tayfeh–Rezaie's necessary conditions on the order of these structures in terms of the binary representation of the rank k, and these conditions simplify to a more transparent relation between the order n and rank k in the case where k is a sum of consecutive powers of 2. Moreover, we present new constructions for 1‐subset‐regular self‐complementary uniform hypergraphs, and prove that these necessary conditions are sufficient for all k, in the case where t = 1. © 2011 Wiley Periodicals, Inc. J Combin Designs 19: 439‐454, 2011     

On preconditioners for the Laplace double‐layer in 2D

The discretization of the double‐layer potential integral equation for the interior Dirichlet–Laplace problem in a domain with smooth boundary results in a linear system that has a bounded condition number. Thus, the number of iterations required for the convergence of a Krylov method is, asymptotically, independent of the discretization size N. Using the fast multipole method to accelerate the matrix–vector products, we obtain an optimal solver. In practice, however, when the geometry is complicated, the number of Krylov iterations can be quite large—to the extend that necessitates the use of preconditioning. We summarize the different methodologies that have appeared in the literature (single‐grid, multigrid, approximate sparse inverses), and we propose a new class of preconditioners based on a fast multipole method‐based spatial decomposition of the double‐layer operator. We present an experimental study in which we compare the different approaches, and we discuss the merits and shortcomings of our approach. Our method can be easily extended to other second‐kind integral equations with non‐oscillatory kernels in two and three dimensions. Copyright © 2014 John Wiley & Sons, Ltd.     

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.     

Cycle Double Covers in Cubic Graphs having Special Structures

In the first part of this article, we employ Thomason's Lollipop Lemma 25 to prove that bridgeless cubic graphs containing a spanning lollipop admit a cycle double cover (CDC) containing the circuit in the lollipop; this implies, in particular, that bridgeless cubic graphs with a 2‐factor F having two components admit CDCs containing any of the components in the 2‐factor, although it need not have a CDC containing all of F. As another example consider a cubic bridgeless graph containing a 2‐factor with three components, all induced circuits. In this case, two of the components may separately be used to start a CDC although it is uncertain whether the third component may be part of some CDC. Numerous other corollaries shall be given as well. In the second part of the article, we consider special types of bridgeless cubic graphs for which a prominent circuit can be shown to be included in a CDC. The interest here is the proof technique and therefore we only give the simplest case of the theorem. Notably, we show that a cubic graph that consists of an induced 2k‐circuit C together with an induced 4k‐circuit T and an independent set of 2k vertices, each joined by one edge to C and two edges to T, has a CDC starting with T.