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">p</Emphasis>-Adic Brownian motion over ℚ<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

In this paper, we generalize the result of Bikulov and Volovich (1997) and construct a p-adic Brownian motion over ℚ _p . First, we construct directly a p-adic white noise over ℚ _p by using a specific complete orthonormal system of (ℚ _p ). A p-adic Brownian motion over ℚ _p is then constructed by the Paley-Wiener method. Finally, we introduce a p-adic random walk and prove a theorem on the approximation of a p-adic Brownian motion by a p-adic random walk.     

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

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

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.     

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.     

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

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.     

Interrelations between mixed moduli of smoothness in metrics of <Emphasis Type="Italic">L</Emphasis><Subscript>p</Subscript> and <Emphasis Type="Italic">L</Emphasis><Subscript>∞</Subscript>

Interrelations between mixed fractional moduli of smoothness considered in the metrics of L _p and L _∞ are studied on the paper.     

On the completeness of algebraic polynomials in the spaces <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(ℝ, <Emphasis Type="Italic">d</Emphasis>μ)

We prove that the theorem on the incompleteness of polynomials in the space C ₀ ^w established by de Branges in 1959 is not true for the space L _p (ℝ, dμ) if the support of the measure μ is sufficiently dense.     

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.     

On the regularity of scalar <Emphasis Type="Italic">p</Emphasis>-Harmonic functions in <Emphasis Type="Italic">n</Emphasis> dimensions with 2 ≤ <Emphasis Type="Italic">p</Emphasis> < <Emphasis Type="Italic">n</Emphasis>

Using Tilli’s technique [Cal Var 25(3):395–401, 2006], we shall give a new proof of the regularity of the local minima of the functional

$J\left( u\right) =\int\limits_{\Omega } \left\vert \partial u\right\vert^{p}\,dx$

with Ω a domain of class C ^{0, 1} in \({\mathbb{R}^{n}}\) and 2 ≤ p < n.

     

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.     

Difference sets with <Emphasis Type="Italic">n</Emphasis> = 5<Emphasis Type="Italic"> p</Emphasis><Superscript><Emphasis Type="Italic">r</Emphasis></Superscript>

Let D be a (v, k, λ)-difference set in an abelian group G, and (v, 31) = 1. If n = 5p ^r with p a prime not dividing v and r a positive integer, then p is a multiplier of D. In the case 31|v, we get restrictions on the parameters of such difference sets D for which p may not be a multiplier.      

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:

On the numerical index of real <Emphasis Type="Italic">L</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>(µ)-spaces

We give a lower bound for the numerical index of the real space L _p (µ) showing, in particular, that it is non-zero for p ≠ 2. In other words, it is shown that for every bounded linear operator T on the real space L _p (µ), one has

$\sup \left\{ {|\int {|x{|^{p - 1}}{\rm{sign}}(x)Tx d\mu |:x \in {L_p}\left( \mu \right), ||x|| = 1} } \right\} \ge {{{M_p}} \over {12{\rm{e}}}}||T||$

where \({M_p} = {\max _{t \in \left[ {0,1} \right]}}{{|{t^{p - 1}} - t|} \over {1 + {t^p}}} > 0\) for every p ≠ 2. It is also shown that for every bounded linear operator T on the real space L _p (µ), one has

$\sup \left\{ {\int {|x{|^{p - 1}}|Tx| d\mu :x \in {L_p}\left( \mu \right), ||x|| = 1} } \right\} \ge {1 \over {2{\rm{e}}}}||T||$

.

     

Algebraic independence over ℚ<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> of values of analytic functions at points from ℂ<Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>

General theorems on the algebraic independence over ℚ _p of the values of analytic functions at points from ℂ _p and their applications to particular examples are presented in the paper.     

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.