Borel equivalence relations between <Emphasis Type="Italic">ℓ</Emphasis><Subscript>1</Subscript> and <Emphasis Type="Italic">ℓ</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

In this paper, we show that, for each p 〉 1, there are continuum many Borel equivalence relations between Rω/l1 and Rω/p ordered by ≤B which are pairwise Borel incomparable.     

On verifiable sufficient conditions for sparse signal recovery via <Emphasis Type="Italic">ℓ</Emphasis><Subscript>1</Subscript> minimization

We discuss necessary and sufficient conditions for a sensing matrix to be “s-good”—to allow for exact ℓ ₁-recovery of sparse signals with s nonzero entries when no measurement noise is present. Then we express the error bounds for imperfect ℓ ₁-recovery (nonzero measurement noise, nearly s-sparse signal, near-optimal solution of the optimization problem yielding the ℓ ₁-recovery) in terms of the characteristics underlying these conditions. Further, we demonstrate (and this is the principal result of the paper) that these characteristics, although difficult to evaluate, lead to verifiable sufficient conditions for exact sparse ℓ ₁-recovery and to efficiently computable upper bounds on those s for which a given sensing matrix is s-good. We establish also instructive links between our approach and the basic concepts of the Compressed Sensing theory, like Restricted Isometry or Restricted Eigenvalue properties.     

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.     

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).     

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).     

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.     

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.     

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.     

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.     

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     

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.     

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.     

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.     

<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.     

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.     

Parabolic twists for the linear algebras <Emphasis Type="Italic">A</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis>−1</Subscript>

New solutions of twist equations for the universal enveloping algebras U (A_n−1) are found. These solutions can be represented as products of full chains of extended Jordanian twists Abelian factors (“rotations”) , and sets of quasi-Jordanian twists . The latter are generalizations of Jordanian twists (with carrier b²) for special deformed extensions of the Hopf algebra U (b²). The carrier subalgebra for the composition is a nonminimal parabolic subalgebra in A _n−1 such that . The parabolic twisting elements are obtained in an explicit form. Details of the construction are illustrated by considering the examples n = 4 and n = 11. Bibliography: 21 titles. Published in Zapiski Nauchnykh Seminarov POMI, Vol. 347, 2007, pp. 187–213.     

Distance-Regular Graph with <Emphasis Type="Italic">c</Emphasis><Subscript>2</Subscript> > 1 and <Emphasis Type="Italic">a</Emphasis><Subscript>1</Subscript> = 0 < <Emphasis Type="Italic">a</Emphasis><Subscript>2</Subscript>

Let Γ be a distance-regular graph of diameter d ≥ 3 with c ₂ > 1. Let m be an integer with 1 ≤ m ≤ d − 1. We consider the following conditions:

Topological recursion relation for <Emphasis Type="Italic">ψ</Emphasis><Subscript>1</Subscript><Emphasis Type="Italic">ψ</Emphasis><Subscript>2</Subscript> in

We give the definition of the full potential with descendants, which is a genus expansion of the Barannikov-Kontsevich solution of the WDVV equation. This potential satisfies the Getzler relation, which comes from the geometry of the moduli space of curves Open image in new window .     

Convergence Theorems for ℓ<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-Norm Minimizers with Respect to <Emphasis Type="Italic">p</Emphasis>

Let C be a fixed compact convex subset of and let x_p be the unique minimal _p-norm element in C for any . In this paper, we study the convergence of x_p as p or , respectively. We characterize also the limit point as the minimal element of C with respect to the lexical minimax order relation or the lexical minitotal order relation, respectively.Communicated by D. G. LuenbergerThe author thanks Professor H. Komiya for valuable advice and an anonymous referee for kind comments.     

Extension of the Weiszfeld procedure to a single facility minisum location model with mixed <Emphasis Type="Italic">ℓ</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> norms

This paper presents a general mixed-norm minisum problem for locating a single facility in continuous space. It is assumed that several transportation modes exist between the new facility and a given set of fixed points (the customers), each mode being represented by a different ? _p norm. A simple extension of Weiszfeld’s well known iterative procedure is proposed to solve the model. Convergence properties and optimality criteria are derived, and computational results are given.