Weighted a priori estimates for solution of (−Δ)<Superscript><Emphasis Type="Italic">m</Emphasis></Superscript><Emphasis Type="Italic">u</Emphasis> = <Emphasis Type="Italic">f</Emphasis> with homogeneous dirichlet conditions

Let u be a weak solution of (-△)mu = f with Dirichlet boundary conditions in a smooth bounded domain Ω  Rn. Then, the main goal of this paper is to prove the following a priori estimate:‖u‖ Wω2 m,p(Ω) ≤ C ‖f‖ Lωp (Ω),where ω is a weight in the Muckenhoupt class Ap.     

Equitable total coloring of <Emphasis Type="Italic">F</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> ⋁ <Emphasis Type="Italic">W</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

The minimum number of total independent partition sets of V ∪ E of graph G(V,E) is called the total chromatic number of G denoted by χ _t (G). If the difference of the numbers of any two total independent partition sets of V ∪ E is no more than one, then the minimum number of total independent partition sets of V ∪ E is called the equitable total chromatic number of G, denoted by χ _et (G). In this paper, we obtain the equitable total chromatic number of the join graph of fan and wheel with the same order. Supported by the National Natural Science Foundation of China (No. 10771091).     

The critical group of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> × <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

In this paper, the structure of the critical group of the graph K _m × C _n is determined, where m, n ≥ 3.     

On the Crossing Number of <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> □ <Emphasis Type="Italic">P</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>

Crossing numbers of graphs are in general very difficult to compute. There are several known exact results on the crossing number of the Cartesian products of paths, cycles or stars with small graphs. In this paper we study cr(K_m □ P_n), the crossing number of the Cartesian product K_m □ P_n. We prove that for m ≥ 3,n ≥ 1 and cr(K_m □ P_n)≥ (n − 1)cr(K_m+2 − e) + 2cr(K_m+1). For m≤ 5, according to Klešč, Jendrol and Ščerbová, the equality holds. In this paper, we also prove that the equality holds for m = 6, i.e., cr(K₆ □ P_n) = 15n + 3. Research supported by NFSC (60373096, 60573022).     

<Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis></Superscript>-Poincaré inequality for general symmetric forms

Lp Poincare inequalities for general symmetric forms are established by new Cheeger＇s isoperimetric constants. Lp super-Poincare inequalities are introduced to describe the equivalent conditions for the Lp compact embedding, and the criteria via the new Cheeger＇s constants for those inequalities are presented. Finally, the concentration or the volume growth of measures for these inequalities are studied.     

An <Emphasis Type="Italic">L</Emphasis>-approach for packing (<Emphasis Type="Italic">ℓ</Emphasis>, <Emphasis Type="Italic">w</Emphasis>)-rectangles into rectangular and <Emphasis Type="Italic">L</Emphasis>-shaped pieces

This paper presents an approach using a recursive algorithm for packing (?, w)-rectangles into larger rectangular and L-shaped pieces. Such a problem has actual applications for non-guillotine cutting and pallet/container loading. Our motivation for developing the L-approach is based on the fact that it can solve difficult pallet loading instances. Indeed, it is able to solve all testing problems (more than 20 000 representatives of infinite equivalence classes of the literature), including the 18 hard instances unresolved by other heuristics. We conjecture that the L-approach always finds optimum packings of (?, w)-rectangles into rectangular pieces. Moreover, the approach may also be useful when dealing with cutting and packing problems involving L-shaped pieces.     

Weak-Polynomial Convergence on Spaces ℓ<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> and <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

This paper is concerned with the study of the set P ^-1(0), when P varies over all orthogonally additive polynomials on _p and L _p spaces. We apply our results to obtain characterizations of the weak-polynomial topologies associated to this class of polynomials.     

The crossing number of <Emphasis Type="Italic">G</Emphasis> ▭ <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript> for the graph <Emphasis Type="Italic">G</Emphasis> on six vertices

The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. The crossing numbers of G□C _n for some graphs G on five and six vertices and the cycle C _n are also given. In this paper, we extend these results by determining the crossing number of the Cartesian product G □ C _n , where G is a specific graph on six vertices.     

SOR- and Jacobi-type iterative methods for solving <Emphasis Type="Italic">ℓ</Emphasis><Subscript>1</Subscript> − <Emphasis Type="Italic">ℓ</Emphasis><Subscript>2</Subscript> problems by way of Fenchel duality

We present an SOR-type algorithm and a Jacobi-type algorithm that can effectively be applied to the ℓ ₁ − ℓ ₂ problem by exploiting its special structure. The algorithms are globally convergent and can be implemented in a particularly simple manner. Relations with coordinate minimization methods are discussed.     

Finite-dimensional <Emphasis Type="Italic">ℓ</Emphasis>-simple lattice-ordered algebras with a <Emphasis Type="Italic">d</Emphasis>-basis

It is shown that a unital finite-dimensional ℓ-simple ℓ-algebra with a distributive basis is isomorphic to a lattice-ordered matrix algebra with the entrywise lattice order over a lattice-ordered twisted group algebra of a finite group with the coordinatewise lattice order. It is also shown that the isomorphism is unique.     

<Emphasis Type="Italic">c</Emphasis><Subscript>0</Subscript>-Singular and <Emphasis Type="Italic">ℓ</Emphasis><Subscript>1</Subscript>-singular operators between vector-valued Banach lattices

Given an operator T : X → Y between Banach spaces, and a Banach lattice E consisting of measurable functions, we consider the point-wise extension of the operator to the vector-valued Banach lattices T _E : E(X) → E(Y) given by T _E (f)(ω) = T(f(ω)). It is proved that for any Banach lattice E which does not contain c ₀, the operator T is an isomorphism on a subspace isomorphic to c ₀ if and only if so is T _E . An analogous result for invertible operators on subspaces isomorphic to ℓ ₁ is also given.     

Ramanujan complexes of type<Emphasis Type="Italic">Ã</Emphasis><Subscript><Emphasis Type="Italic">d</Emphasis></Subscript>

We define and construct Ramanujan complexes. These are simplicial complexes which are higher dimensional analogues of Ramanujan graphs (constructed in [LPS]). They are obtained as quotients of the buildings of typeà _d?1 associated with PGL _d (F) whereF is a local field of positive characteristic.     

Some properties of <Emphasis Type="Italic">B</Emphasis><Subscript><Emphasis Type="Italic">φ</Emphasis></Subscript>-splines

A general approach to the construction of asymptotics of coordinate (not necessarily polynomial) B _φ -splines of an arbitrary order is proposed. Asymptotic representations for Lagrange type third order B _φ -splines are obtained. Bibliography: 4 titles. Translated from Problemy Matematicheskogo Analiza, No. 38, December 2008, pp. 11–21.     

Free completely <Emphasis Type="Italic">J</Emphasis><Superscript>(<Emphasis Type="Italic">ℓ</Emphasis>)</Superscript>-simple Semigroups

A semigroup is called completely J^(ι)-simple if it is isomorphic to some Rees matrix semigroup over a left cancellative monoid and each entry of whose sandwich matrix is in the group of units of the left cancellative monoid. It is proved that completely J^(ι)-simple semigroups form a quasivarity. Moreover, the construction of free completely J^(ι)-simple semigroups is given. It is found that a free completely J^(ι)-simple semigroup is just a free completely J ^*-simple semigroup and also a full subsemigroup of some completely simple semigroups.     

A Characterization of <Emphasis Type="Italic">PSU</Emphasis><Subscript>3</Subscript>(<Emphasis Type="Italic">q</Emphasis>) for <Emphasis Type="Italic">q</Emphasis> ≥ 5

Based on the prime graph of a finite simple group, its order is the product of its order components (see [4]). We prove that the simple groups PSU₃(q) are uniquely determined by their order components. Our result immediately implies that the Thompsons conjecture and the Wujie Shis conjecture [16] are valid for these groups.AMS Subject Classification: 20D05, 20D60     

On blocks with <Emphasis Type="Italic">K</Emphasis>(<Emphasis Type="Italic">B</Emphasis>)−<Emphasis Type="Italic">L</Emphasis>(<Emphasis Type="Italic">B</Emphasis>)=1

We use the method of local representation and original method of Brauer to study the block with K(B)−L(B)=1, and get some properties on the defect group and the structure of this kind of blocks. Then, we show that K(B) conjecture holds for this kind of blocks.     

Bilocal automorphisms of <Emphasis Type="Italic">T</Emphasis><Subscript>∞</Subscript>(<Emphasis Type="Italic">F</Emphasis>)

We prove that if F is a field such that |F| > 2, then every bilocal automorphism of T _∞(F) - the algebra of ? × ? upper triangular matrices over F, is an automorphism.     

Potentially <Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">m</Emphasis></Subscript> — <Emphasis Type="Italic">G</Emphasis>-graphical sequences: A survey

The set of all non-increasing nonnegative integer sequences π = (d(v ₁), d(v ₂), …, d(v _n )) is denoted by NS _n . A sequence π ∈ NS _n is said to be graphic if it is the degree sequence of a simple graph G on n vertices, and such a graph G is called a realization of π. The set of all graphic sequences in NS _n is denoted by GS _n . A graphical sequence π is potentially H-graphical if there is a realization of π containing H as a subgraph, while π is forcibly H-graphical if every realization of π contains H as a subgraph. Let K _k denote a complete graph on k vertices. Let K _m −H be the graph obtained from Km by removing the edges set E(H) of the graph H (H is a subgraph of K _m ). This paper summarizes briefly some recent results on potentially K _m −G-graphic sequences and give a useful classification for determining σ (H, n).     

On Analytic Campanato and <Emphasis Type="Italic">F</Emphasis>(<Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">q</Emphasis>, <Emphasis Type="Italic">s</Emphasis>) Spaces

We investigate the relation between analytic Campanato spaces \(\mathcal {AL}_{p,s}\) and the spaces F(p, q, s), characterize the bounded and compact Riemann–Stieltjes operators from \(\mathcal {AL}_{p,s}\) to \(F(p,p-s-1,s)\). We also describe the corona theorem and the interpolating sequences for the class \(F(p,p-2,s)\), which is the Möbius invariant subspace of the analytic Besov type spaces \(B_p(s)\).     

Convergence in <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>([0, <Emphasis Type="Italic">T</Emphasis>]) of Wavelet Expansions of <Emphasis Type="Italic">φ</Emphasis>-Sub-Gaussian Random Processes

The article presents new results on convergence in L _p ([0,T]) of wavelet expansions of φ-sub-Gaussian random processes. The convergence rate of the expansions is obtained. Specifications of the obtained results are discussed.