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)     

On Vapnik‐Chervonenkis density over indiscernible sequences

In this paper, we study Vapnik‐Chervonenkis density (VC‐density) over indiscernible sequences (denoted VC_ind‐density). We answer an open question in [1], showing that VC_ind‐density is always integer valued. We also show that VC_ind‐density and dp‐rank coincide in the natural way.     

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.     

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)     

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.     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

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)     

Bound and anti‐bound states for coupled‐channel scattering

We discuss bound and anti‐bound states for 2×2 matrix Schrödinger operator. We analyze the Fredholm determinant for Hamiltonians that can be represented in a multi‐channel framework. Our analysis covers the whole and the half‐line problems. We obtain some results on counting anti‐bound states between successive bound states. Copyright © 2017 John Wiley & Sons, Ltd.     

I‐graphs and the corresponding configurations

We consider the class of I‐graphs I(n,j,k), which is a generalization over the class of the generalized Petersen graphs. We study different properties of I‐graphs, such as connectedness, girth, and whether they are bipartite or vertex‐transitive. We give an efficient test for isomorphism of I‐graphs and characterize the automorphism groups of I‐graphs. Regular bipartite graphs with girth at least 6 can be considered as Levi graphs of some symmetric combinatorial configurations. We consider configurations that arise from bipartite I‐graphs. Some of them can be realized in the plane as cyclic astral configurations, i.e., as geometric configurations with maximal isometric symmetry. © 2005 Wiley Periodicals, Inc.     

A regularity criterion for two‐and‐half‐dimensional magnetohydrodynamic equations with horizontal dissipation and horizontal magnetic diffusion

We study the global regularity of classical solution to two‐and‐half‐dimensional magnetohydrodynamic equations with horizontal dissipation and horizontal magnetic diffusion. We prove that any possible finite time blow‐up can be controlled by the L^∞‐norm of the vertical components. Copyright © 2016 John Wiley & Sons, Ltd.     

Restricted b‐factors in bipartite graphs and t‐designs

We present a new equivalence result between restricted b‐factors in bipartite graphs and combinatorial t‐designs. This result is useful in the construction of t‐designs by polyhedral methods. We propose a novel linear integer programming formulation, which we call GDP, for the problem of finding t‐designs that has a noteworthy advantage compared to the traditional set‐covering formulation. We analyze some polyhedral properties of GPD, implement a branch‐and‐cut algorithm using it and solve several instances of small designs to compare with another point‐block formulation found in the literature. © 2006 Wiley Periodicals, Inc. J Combin Designs 14: 169–182, 2006     

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     

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     

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     

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.     

The two‐variable fragment with counting and equivalence

We consider the two‐variable fragment of first‐order logic with counting, subject to the stipulation that a single distinguished binary predicate be interpreted as an equivalence. We show that the satisfiability and finite satisfiability problems for this logic are both NExpTime ‐complete. We further show that the corresponding problems for two‐variable first‐order logic with counting and two equivalences are both undecidable.     

Einstein almost cokähler manifolds

We study an odd‐dimensional analogue of the Goldberg conjecture for compact Einstein almost Kähler manifolds. We give an explicit non‐compact example of an Einstein almost cokähler manifold that is not cokähler. We prove that compact Einstein almost cokähler manifolds with nonnegative *‐scalar curvature are cokähler (indeed, transversely Calabi–Yau); more generally, we give a lower and upper bound for the *‐scalar curvature in the case that the structure is not cokähler. We prove similar bounds for almost Kähler Einstein manifolds that are not Kähler.     

Non‐compactness of the solution operator to $ \bar \partial $ on the Fock‐space in several dimensions

We consider the canonical solution operator to restricted to (0, 1)‐forms with coefficients in the generalized Fock‐spaces (1) We will show that the canonical solution operator restricted to (0, 1)‐forms with ‐coefficients can be interpreted as a Hankel‐operator. Furthermore we will show that the canonical solution operator is not compact for m ≥ 2. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Sperner spaces and first‐order logic

We study the class of Sperner spaces, a generalized version of affine spaces, as defined in the language of pointline incidence and line parallelity. We show that, although the class of Sperner spaces is a pseudo‐elementary class, it is not elementary nor even ??_∞ω‐axiomatizable. We also axiomatize the first‐order theory of this class.