Measurable groups of low dimension

We consider low‐dimensional groups and group‐actions that are definable in a supersimple theory of finite rank. We show that any rank 1 unimodular group is (finite‐by‐Abelian)‐by‐finite, and that any 2‐dimensional asymptotic group is soluble‐by‐finite. We obtain a field‐interpretation theorem for certain measurable groups, and give an analysis of minimal normal subgroups and socles in groups definable in a supersimple theory of finite rank where infinity is definable. We prove a primitivity theorem for measurable group actions. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Well‐conditioned boundary integral formulations for high‐frequency elastic scattering problems in three dimensions

We construct and analyze a family of well‐conditioned boundary integral equations for the Krylov iterative solution of three‐dimensional elastic scattering problems by a bounded rigid obstacle. We develop a new potential theory using a rewriting of the Somigliana integral representation formula. From these results, we generalize to linear elasticity the well‐known Brakhage–Werner and combined field integral equation formulations. We use a suitable approximation of the Dirichlet‐to‐Neumann map as a regularizing operator in the proposed boundary integral equations. The construction of the approximate Dirichlet‐to‐Neumann map is inspired by the on‐surface radiation conditions method. We prove that the associated integral equations are uniquely solvable and possess very interesting spectral properties. Promising analytical and numerical investigations, in terms of spherical harmonics, with the elastic sphere are provided. Copyright © 2014 John Wiley & Sons, Ltd.     

Evolutes of fronts in the Minkowski plane

We consider the differential geometry of evolutes of singular curves and give the definitions of spacelike fronts and timelike fronts in the Minkowski plane. We also give the notions of moving frames along the non‐lightlike fronts in the Minkowski plane. By using the moving frames, we define the evolutes of non‐lightlike fronts and investigate the geometric properties of these evolutes. We obtain that the evolute of a spacelike front is a timelike front and the evolute of a timelike front is a spacelike front. Since the evolute of a non‐lightlike front is also a non‐lightlike front, we can take evolute again. We study the Minkowski Zigzag number of non‐lightlike fronts and give the n‐th evolute of the non‐lightlike front. Finally, we give an example to illustrate our results.     

Completion of the mixed unit interval graphs hierarchy

We describe the missing class of the hierarchy of mixed unit interval graphs. This class is generated by the intersection graphs of families of unit intervals that are allowed to be closed, open, and left‐closed‐right‐open. (By symmetry, considering closed, open, and right‐closed‐left‐open unit intervals generates the same class.) We show that this class lies strictly between unit interval graphs and mixed unit interval graphs. We give a complete characterization of this new class, as well as quadratic‐time algorithms that recognize graphs from this class and produce a corresponding interval representation if one exists. We also show that the algorithm from Shuchat et al. [8] directly extends to provide a quadratic‐time algorithm to recognize the class of mixed unit interval graphs.     

Semi‐invariant solutions of the Navier‐Stokes equations

We present new exact solutions and reduced differential systems of the Navier‐Stokes equations of incompressible viscous fluid flow. We apply the method of semi‐invariant manifolds, introduced earlier as a modification of the Lie invariance method. We show that many known solutions of the Navier‐Stokes equations are, in fact, semi‐invariant and that the reduced differential systems we derive using semi‐invariant manifolds generalize previously obtained results that used ad hoc methods. Many of our semi‐invariant solutions solve decoupled systems in triangular form that are effectively linear. We also obtain several new reductions of Navier‐Stokes to a single nonlinear partial differential equation. In some cases, we can solve reduced systems and generate new analytic solutions of the Navier‐Stokes equations or find their approximations, and physical interpretation.     

Quantum logics with the Riesz Interpolation Property

We study the quantum logics which satisfy the Riesz Interpolation Property. We call them the RIP logics. We observe that the class of RIP logics is considerable large—it contains all lattice quantum logics and, also, many (infinite) non‐lattice ones. We then find out that each RIP logic can be enlarged to an RIP logic with a preassigned centre. We continue, showing that the “nearly” Boolean RIP logics must be Boolean algebras. In a somewhat surprising contrast to this, we finally show that the attempt for the σ‐complete formulation of this result fails: We show by constructing an example that there is a non‐Boolean nearly Boolean σ‐RIP logic. As a result, there are interesting σ‐RIP logics which are intrinsically close to Boolean σ‐algebras. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Two‐dimensional adaptive Fourier decomposition

One‐dimensional adaptive Fourier decomposition, abbreviated as 1‐D AFD, or AFD, is an adaptive representation of a physically realizable signal into a linear combination of parameterized Szegö and higher‐order Szegö kernels of the context. In the present paper, we study multi‐dimensional AFDs based on multivariate complex Hardy spaces theory. We proceed with two approaches of which one uses Product‐TM Systems; and the other uses Product‐Szegö Dictionaries. With the Product‐TM Systems approach, we prove that at each selection of a pair of parameters, the maximal energy may be attained, and, accordingly, we prove the convergence. With the Product‐Szegö dictionary approach, we show that pure greedy algorithm is applicable. We next introduce a new type of greedy algorithm, called Pre‐orthogonal Greedy Algorithm (P‐OGA). We prove its convergence and convergence rate estimation, allowing a weak‐type version of P‐OGA as well. The convergence rate estimation of the proposed P‐OGA evidences its advantage over orthogonal greedy algorithm (OGA). In the last part, we analyze P‐OGA in depth and introduce the concept P‐OGA‐Induced Complete Dictionary, abbreviated as Complete Dictionary. We show that with the Complete Dictionary P‐OGA is applicable to the Hardy H² space on 2‐torus. Copyright © 2016 John Wiley & Sons, Ltd.     

Universal mappings for certain classes of operators and polynomials between Banach spaces

A well‐known result of J. Lindenstrauss and A. Pełczyński (1968) gives the existence of a universal non‐weakly compact operator between Banach spaces. We show the existence of universal non‐Rosenthal, non‐limited, and non‐Grothendieck operators. We also prove that there does not exist a universal non‐Dunford–Pettis operator, but there is a universal class of non‐Dunford–Pettis operators. Moreover, we show that, for several classes of polynomials between Banach spaces, including the non‐weakly compact polynomials, there does not exist a universal polynomial.     

A second‐order finite difference approximation for a mathematical model of erythropoiesis

We present a second‐order finite difference scheme for approximating solutions of a mathematical model of erythropoiesis, which consists of two nonlinear partial differential equations and one nonlinear ordinary differential equation. We show that the scheme achieves second‐order accuracy for smooth solutions. We compare this scheme to a previously developed first‐order method and show that the first order method requires significantly more computational time to provide solutions with similar accuracy. We also compare this numerical scheme with other well‐known second‐order methods and show that it has better capability in approximating discontinuous solutions. Finally, we present an application to recovery after blood loss. © 2013 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2013     

Interaction of faults under slip‐dependent friction. Non‐linear eigenvalue analysis

We analyse the evolution of a system of finite faults by considering the non‐linear eigenvalue problems associated to static and dynamic solutions on unbounded domains. We restrict our investigation to the first eigenvalue (Rayleigh quotient). We point out its physical significance through a stability analysis and we give an efficient numerical algorithm able to compute it together with the corresponding eigenfunction. We consider the anti‐plane shearing on a system of finite faults under a slip‐dependent friction in a linear elastic domain, not necessarily bounded. The static problem is formulated in terms of local minima of the energy functional. We introduce the non‐linear (static) eigenvalue problem and we prove the existence of a first eigenvalue/eigenfunction characterizing the isolated local minima. For the dynamic problem, we discuss the existence of solutions with an exponential growth, to deduce a (dynamic) non‐linear eigenvalue problem. We prove the existence of a first dynamic eigenvalue and we analyse its behaviour with respect to the friction parameter. We deduce a mixed finite element discretization of the non‐linear spectral problem and we give a numerical algorithm to approach the first eigenvalue/eigenfunction. Finally we give some numerical results which include convergence tests, on a single fault and a two‐faults system, and a comparison between the non‐linear spectral results and the time evolution results. Copyright © 2004 John Wiley & Sons, Ltd.     

Within‐host and synaptic transmissions: contributions to the spread of HIV infection

We study the contributions of within‐host (virus‐to‐cell) and synaptic (cell‐to‐cell) transmissions in a mathematical model for human immunodeficiency virus epidemics. The model also includes drug resistance. We prove the local and global stability of the disease‐free equilibrium and the local stability of the endemic equilibrium. We analyse the effect of the cell‐to‐cell transmission rate on the value of the reproduction number, R₀. Moreover, we show evidence of a qualitative change in the models' dynamics, subjected to the value of the drug efficacy. In the end, important inferences are drawn. Copyright © 2016 John Wiley & Sons, Ltd.     

On the category of hyper MV‐algebras

In this paper we study the category of hyper MV‐algebras and we prove that it has a terminal object and a coequalizer. We show that Jia's construction can be modified to provide a free hyper MV‐algebra by a set. We use this to show that in the category of hyper MV‐algebras the monomorphisms are exactly the one‐to‐one homomorphisms. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Stability of general virus dynamics models with both cellular and viral infections and delays

We consider general virus dynamics model with virus‐to‐target and infected‐to‐target infections. The model is incorporated by intracellular discrete or distributed time delays. We assume that the virus‐target and infected‐target incidences, the production, and clearance rates of all compartments are modeled by general nonlinear functions that satisfy a set of reasonable conditions. The non‐negativity and boundedness of the solutions are studied. The existence and stability of the equilibria are determined by a threshold parameter. We use suitable Lyapunov functionals and apply LaSalle's invariance principle to prove the global asymptotic stability of the all equilibria of the model. We confirm the theoretical results by numerical simulations. Copyright © 2017 John Wiley & Sons, Ltd.     

Weakly o‐Minimal Expansions of Boolean Algebras

We propose a definition of weak o‐minimality for structures expanding a Boolean algebra. We study this notion, in particular we show that there exist weakly o‐minimal non o‐minimal examples in this setting.     

A Jacobi–Davidson method for two‐real‐parameter nonlinear eigenvalue problems arising from delay‐differential equations

The critical delays of a delay‐differential equation can be computed by solving a nonlinear two‐parameter eigenvalue problem. The solution of this two‐parameter problem can be translated to solving a quadratic eigenvalue problem of squared dimension. We present a structure preserving QR‐type method for solving such quadratic eigenvalue problem that only computes real‐valued critical delays; that is, complex critical delays, which have no physical meaning, are discarded. For large‐scale problems, we propose new correction equations for a Newton‐type or Jacobi–Davidson style method, which also forces real‐valued critical delays. We present three different equations: one real‐valued equation using a direct linear system solver, one complex valued equation using a direct linear system solver, and one Jacobi–Davidson style correction equation that is suitable for an iterative linear system solver. We show numerical examples for large‐scale problems arising from PDEs. Copyright © 2012 John Wiley & Sons, Ltd.     

Memory and a priori best strategy in complex adaptive systems

We employ an agent‐based model to show that memory and the absence of an a priori best strategy are sufficient for self‐segregation and clustering to emerge in a complex adaptive system with discrete agents that do not compete over a limited resource nor contend in a winner‐take‐all scenario. An agent starts from a corner of a two‐dimensional lattice and aims to reach a randomly selected site in the opposite side within the shortest possible time. The agent is isolated during the course of its journey and does not interact with other agents. Time‐bound obstacles appear at random lattice locations and the agent must decide whether to challenge or evade any obstacle blocking its path. The agent is capable of adapting a strategy in dealing with an obstacle. We analyze the dependence of strategy‐retention time with strategy for both memory‐based and memory‐less agents. We derive the equality spectrum to establish the environmental conditions that favor the existence of an a priori best strategy. We found that memory‐less agents do not polarize into two opposite strategy‐retention time distributions nor cluster toward a center distribution. © 2004 Wiley Periodicals, Inc. Complexity 9: 41–46, 2004     

On the average‐case complexity of Shellsort

We prove a lower bound expressed in the increment sequence on the average‐case complexity of the number of inversions of Shellsort. This lower bound is sharp in every case where it could be checked. A special case of this lower bound yields the general Jiang‐Li‐Vitányi lower bound. We obtain new results, for example, determining the average‐case complexity precisely in the Yao‐Janson‐Knuth 3‐pass case.     

On the asymptotics of fault probability in least‐recently‐used caching with Zipf‐type request distribution

We consider the least‐recently‐used cache replacement rule with a Zipf‐type page request distribution and investigate an asymptotic property of the fault probability with respect to an increase of cache size. We first derive the asymptotics of the fault probability for the independent‐request model and then extend this derivation to a general dependent‐request model, where our result shows that under some weak assumptions the fault probability is asymptotically invariant with regard to dependence in the page request process. In a previous study, a similar result was derived by applying a Poisson embedding technique, where a continuous‐time proof was given through some assumptions based on a continuous‐time modeling. The Poisson embedding, however, is just a technique used for the proof and the problem is essentially on a discrete‐time basis; thus, it is preferable to make assumptions, if any, directly in the discrete‐time setting. We consider a general dependent‐request model and give a direct discrete‐time proof under different assumptions. A key to the proof is that the numbers of requests for respective pages represent conditionally negatively associated random variables. © 2005 Wiley Periodicals, Inc. Random Struct. Alg., 2006     

On the stabilizing effect of convection in three‐dimensional incompressible flows

We investigate the stabilizing effect of convection in three‐dimensional incompressible Euler and Navier‐Stokes equations. The convection term is the main source of nonlinearity for these equations. It is often considered destabilizing although it conserves energy due to the incompressibility condition. In this paper, we show that the convection term together with the incompressibility condition actually has a surprising stabilizing effect. We demonstrate this by constructing a new three‐dimensional model that is derived for axisymmetric flows with swirl using a set of new variables. This model preserves almost all the properties of the full three‐dimensional Euler or Navier‐Stokes equations except for the convection term, which is neglected in our model. If we added the convection term back to our model, we would recover the full Navier‐Stokes equations. We will present numerical evidence that seems to support that the three‐dimensional model may develop a potential finite time singularity. We will also analyze the mechanism that leads to these singular events in the new three‐dimensional model and how the convection term in the full Euler and Navier‐Stokes equations destroys such a mechanism, thus preventing the singularity from forming in a finite time. © 2008 Wiley Periodicals, Inc.     

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)