Polynomial Approximation in Ep(D) with 0 < p < 1

In this paper, we construct approximants by means of interpolation polynomialsto prove Jackson′s theorem and the Bernstein inequality in E^p(D) with 0 < p < 1.     

Norm behaviour of solutions to a parabolic–elliptic system modelling chemotaxis in a domain of ℝ3

In this paper, we study a parabolic–elliptic system defined on a bounded domain of ?³, which comes from a chemotactic model. We first prove the existence and uniqueness of local in time solution to this problem in the Sobolev spaces framework, then we study the norm behaviour of solution, which may help us to determine the blow‐up norm of the maximal solution. Copyright © 2004 John Wiley & Sons, Ltd.     

ω‐saturated quasi‐minimal models of Th(ℚω, +, σ, 0)

We show that (ℚ^ω, +, σ, 0) is a quasi-minimal torsion-free divisible abelian group. After discussing the axiomatization of the theory of this structure, we present its ω-saturated quasi-minimal model. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Solvability of an initial boundary value problem for the euler equations in twodimensional domain with corners

The aim of this paper is to prove the existence and uniqueness of local solutions of some initial boundary value problems for the Euler equations of an incompressible fluid in a bounded domain Ω ? R ² with corners. We consider two cases of a nonvanishing normal component of velocity on the boundary. In three-dimensional case such problems have been considered in papers [12], [13], [14]. Similar problems in domains without corners have been considered in [2]–[6], [11]. In this paper the relation between the maximal corner angle of the boundary and the smoothness of the solutions is shown. The paper consists of four sections. In section 1 two initial boundary value problems for the Euler equations are formulated. In section 2 the existence and uniqueness of solutions of the Laplace equation in twodimensional domain with corners for the Dirichlet and Neumann problems is proved in the Sobolev spaces. In sections 3 and 4 we prove the existence and uniqueness of solutions of problems formulated in section 1, using the method of successive approximations.     

Re, k and π : a conversation on some aspects of mathematical modelling

Re and k discuss π's approach to what we understand by a mathematical model; how it may have certain generic properties and how hierarchies of related models arise in connexion with a given physical situation. Joined at this point by π, they continue to talk about the way in which models are formulated and prepared for solution. This preparation involves such things as the choice of the most suitable dimensionless variables, reduction to the smallest number of equations, proving uniqueness and discovering the shape of the solution. In conclusion, some aspects of the presentation of the results are discussed. The abbreviated names of Reynolds, Boltzmann and Pythagoras have been used only to denote the engineer, natural scientist and mathematician taking part in the discussion; there is no allusion to the points of view of the historic figures.     

On Positive and Copositive Polynomial and Spline Approximation inLp[−1, 1], 0<p<∞

For a functionfL_p[−1, 1], 0<p<∞, with finitely many sign changes, we construct a sequence of polynomialsP_nΠ_nwhich are copositive withfand such that f−P_npCω(f, (n+1)⁻¹)_p, whereω(f, t)_pdenotes the Ditzian–Totik modulus of continuity inL_pmetric. It was shown by S. P. Zhou that this estimate is exact in the sense that if f has at least one sign change, thenωcannot be replaced byω²if 1<p<∞. In fact, we show that even for positive approximation and all 0<p<∞ the same conclusion is true. Also, some results for (co)positive spline approximation, exact in the same sense, are obtained.     

On some sets of dictionaries whose ω ‐powers have a given

A dictionary is a set of finite words over some finite alphabet X. The ω ‐power of a dictionary V is the set of infinite words obtained by infinite concatenation of words in V. Lecomte studied in [10] the complexity of the set of dictionaries whose associated ω ‐powers have a given complexity. In particular, he considered the sets ??( Σ ⁰k) (respectively, ??( Π ⁰_k), ??( Δ ¹₁)) of dictionaries V ? 2* whose ω ‐powers are Σ ⁰_k‐sets (respectively, Π ⁰_k‐sets, Borel sets). In this paper we first establish a new relation between the sets ??( Σ ⁰₂) and ??( Δ ¹₁), showing that the set ??( Δ ¹₁) is “more complex” than the set ??( Σ ⁰₂). As an application we improve the lower bound on the complexity of ??( Δ ¹₁) given by Lecomte, showing that ??( Δ ¹₁) is in Σ ¹ ₂(2^2*)\ Π ⁰₂. Then we prove that, for every integer k ≥ 2 (respectively, k ≥ 3), the set of dictionaries ??( Π ⁰_k+1) (respectively, ??( Σ ⁰_{k +1})) is “more complex” than the set of dictionaries ??( Π ⁰_k) (respectively, ??( Σ ⁰_k)) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Van Kampen theorem for π2

If the path connected topological space X has a countable open cover $\text{U}$ with path connected elements, then π₂(X,1) is computed as a colimit determined by the second homotopy groups of the intersection of elements of $\text{U}$ and the indices of the fundamental group injections of these intersections into the fundamental group of X. Aside from assuming that the inclusions induce such monomorphisms, certain other inclusions are also required to induce monomorphisms of fundamental groups and restrictions are placed on the arrangement of the elements of $\text{U}$.     

Multi‐term π‐institutions and their equivalence

The notion of a multi‐term π‐institution is introduced and a criterion for the equivalence of two multi‐term π‐institutions in terms of their categories of theories is proved. Moreover, a counterexample that shows that this criterion is false for arbitrary π‐institutions is given. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Finding Δ(Σ) for a surface σ of characteristic χ(Σ) = −5

For each surface Σ, we define Δ(Σ) = max{Δ(G)|Gis a class two graph of maximum degree Δ(G) that can be embedded in Σ}. Hence, Vizing's Planar Graph Conjecture can be restated as Δ(Σ) = 5 if Σ is a plane. In this paper, we show that Δ(Σ) = 9 if Σ is a surface of characteristic χ(Σ) = ?5. © 2010 Wiley Periodicals, Inc. J Graph Theory 68:148‐168, 2011     

The 8π‐problem for radially symmetric solutions of a chemotaxis model in the plane

The existence, uniqueness and large time behaviour of radially symmetric solutions to a chemotaxis system in the plane ?² are studied either for the critical value of the mass equal to 8π or in the subcritical case. Copyright © 2006 John Wiley & Sons, Ltd.     

L（Ω, μ） CANNOT ISOMETRICALLY CONTAIN SOME THREE-DIMENSIONAL SUBSPACES OF AM-SPACES

This article presents a novel method to prove that: let E be an AM-space and if dim E≥3, then there does not exist any odd subtractive isometric mapping from the unit sphere S(E) into S[L(Ω,μ)]. In particular, there does not exist any real linear isometry from E into L(Ω,μ).     

On σ-equivalence and χ-equivalence of graphs

We define a partial ordering on the set of σ-polynomials as well as a vertex splitting operation on the set of graphs, and introduce the notions of σ-equivalence and σ-uniqueness of graphs. Let σ(G) be the σ-polynomial of a graph G and (OVERBAR)σ(G) = σ(G^c). Let H = (G, v, A, B) be a vertex splitting graph of G. We prove that (OVERBAR)σ(G) ≤ (OVERBAR)σ(H) and the equality holds if and only if every vertex of A is adjacent to every vertex of B. This gives us an effective means to find σ-equivalent and χ-equivalent graphs. A necessary and sufficient condition for a graph to be χ-unique but not σ-unique is also obtained. © 1996 John Wiley & Sons, Inc.