Optimal channel assignment and <Emphasis Type="Italic">L</Emphasis>(<Emphasis Type="Italic">p</Emphasis>, 1)-labeling

The optimal channel assignment is an important optimization problem with applications in optical networks. This problem was formulated to the L(p, 1)-labeling of graphs by Griggs and Yeh (SIAM J Discrete Math 5:586–595, 1992). A k-L(p, 1)-labeling of a graph G is a function \(f:V(G)\rightarrow \{0,1,2,\ldots ,k\}\) such that \(|f(u)-f(v)|\ge p\) if \(d(u,v)=1\) and \(|f(u)-f(v)|\ge 1\) if \(d(u,v)=2\), where d(u, v) is the distance between the two vertices u and v in the graph. Denote \(\lambda _{p,1}^l(G)= \min \{k \mid G\) has a list k-L(p, 1)-labeling\(\}\). In this paper we show upper bounds \(\lambda _{1,1}^l(G)\le \Delta +9\) and \(\lambda _{2,1}^l(G)\le \max \{\Delta +15,29\}\) for planar graphs G without 4- and 6-cycles, where \(\Delta \) is the maximum vertex degree of G. Our proofs are constructive, which can be turned to a labeling (channel assignment) method to reach the upper bounds.     

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.     

<Emphasis Type="Italic">L</Emphasis><Superscript>1</Superscript>(<Emphasis Type="Italic">μ</Emphasis>) for vector-valued measure <Emphasis Type="Italic">μ</Emphasis>

Let μ be a measure from a σ-algebra of subsets of a set T into a sequentially complete Hausdorff topological vector space X. Assume that μ is convexly bounded, i.e., the convex hull of its range is bounded in X, and denote by L ¹(μ) the space of scalar valued functions on T which are integrable with respect to the vector measure μ. We study the inheritance of some properties from X to L ¹(μ). We show that the bounded multiplier property passes from X to L ¹(μ). Answering a 1972 problem of Erik Thomas, we show that for a rather large class of F-spaces X the non-containment of c ₀ passes from X to L ¹(μ).     

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.     

A closed-form expression for the Drinfeld modular polynomial Φ<Subscript><Emphasis Type="Italic">T</Emphasis></Subscript>(<Emphasis Type="Italic">X</Emphasis>, <Emphasis Type="Italic">Y</Emphasis>)

In this paper we give a closed-form expression for the Drinfeld modular polynomial \({\Phi_T(X,Y) \in \mathbb{F}_q(T)[X,Y]}\) for arbitrary q and prove a conjecture of Schweizer. A new identity involving the Catalan numbers plays a central role.     

On the divergence of trigonometric Fourier series in classes <Emphasis Type="Italic">ϕ</Emphasis>(<Emphasis Type="Italic">L</Emphasis>) close to <Emphasis Type="Italic">L</Emphasis>

We show the unimprovability of a theorem on sufficient convergence conditions for the trigonometric Fourier series of a function in classes ?(L) in the case when the class ?(L) is “close” to L.     

On nonregular ideals and <Emphasis Type="Italic">z</Emphasis>°-ideals in <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">X</Emphasis>)

The spaces X in which every prime z°-ideal of C(X) is either minimal or maximal are characterized. By this characterization, it turns out that for a large class of topological spaces X, such as metric spaces, basically disconnected spaces and one-point compactifications of discrete spaces, every prime z°-ideal in C(X) is either minimal or maximal. We will also answer the following questions: When is every nonregular prime ideal in C(X) a z°-ideal? When is every nonregular (prime) z-ideal in C(X) a z°-ideal? For instance, we show that every nonregular prime ideal of C(X) is a z°-ideal if and only if X is a ?-space (a space in which the boundary of any zeroset is contained in a zeroset with empty interior).     

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.     

The sixth moment of the family of Γ<Subscript>1</Subscript>(<Emphasis Type="Italic">q</Emphasis>)-automorphic <Emphasis Type="Italic">L</Emphasis>-functions

In this paper we investigate the sixth moment of the family of L-functions associated to holomorphic modular forms on GL ₂ with respect to a congruence subgroup Γ₁(q). The bound for central values averaged over the family, consistent with the Lindelöf hypothesis, is obtained for prime levels q.     

Vector-valued interval functions and the Dedekind completion of <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">X</Emphasis>, <Emphasis Type="Italic">E</Emphasis>)

We consider interval valued functions with values in a Banach lattice E. Certain notions of continuity introduced earlier for real interval valued functions are generalised to the more general case considered here. As an application, we characterise the Dedekind completion of the space of continuous, E-valued functions on a paracompact \(T_{1}\)-space, extending a result of Anguelov.     

Bishop’s theorem and differentiability of a subspace of <Emphasis Type="Italic">C</Emphasis><Subscript><Emphasis Type="Italic">b</Emphasis></Subscript>(<Emphasis Type="Italic">K</Emphasis>)

Let K be a Hausdorff space and C _b (K) be the Banach algebra of all complex bounded continuous functions on K. We study the Gateaux and Fréchet differentiability of subspaces of C _b (K). Using this, we show that the set of all strong peak functions in a nontrivial separating separable subspace H of C _b (K) is a dense G _δ subset of H, if K is compact. This gives a generalized Bishop’s theorem, which says that the closure of the set of all strong peak points for H is the smallest closed norming subset of H. The classical Bishop’s theorem was proved for a separating subalgebra H and a metrizable compact space K.     

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.     

On common values of <Emphasis Type="Italic">φ</Emphasis>(<Emphasis Type="Italic">n</Emphasis>) and <Emphasis Type="Italic">σ</Emphasis>(<Emphasis Type="Italic">m</Emphasis>). I

We show, conditional on a uniform version of the prime k-tuples conjecture, that there are x/(log x)^1+o(1) numbers not exceeding x common to the ranges of φ and σ. Here φ is Euler’s totient function and σ is the sum-of-divisors function.     

On the equation Δ<Emphasis Type="Italic">u</Emphasis> + <Emphasis Type="Italic">q</Emphasis>(<Emphasis Type="Italic">x</Emphasis>)<Emphasis Type="Italic">u</Emphasis> = 0

Sufficient conditions for the blow-up of nontrivial generalized solutions of the interior Dirichlet problem with homogeneous boundary condition for the homogeneous elliptic-type equation Δu + q(x)u = 0, where either q(x) ≠ const or q(x) = const= λ > 0, are obtained. A priori upper bounds (Theorem 4 and Remark 6) for the exact constants in the well-known Sobolev and Steklov inequalities are established.     

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

Relative <Emphasis Type="Italic">t</Emphasis>-designs in binary Hamming association scheme <Emphasis Type="Italic">H</Emphasis>(<Emphasis Type="Italic">n</Emphasis>, 2)

A relative t-design in the binary Hamming association schemes H(n, 2) is equivalent to a weighted regular t-wise balanced design, i.e., certain combinatorial t-design which allows different sizes of blocks and a weight function on blocks. In this paper, we study relative t-designs in H(n, 2), putting emphasis on Fisher type inequalities and the existence of tight relative t-designs. We mostly consider relative t-designs on two shells. We prove that if the weight function is constant on each shell of a relative t-design on two shells then the subset in each shell must be a combinatorial \((t-1)\)-design. This is a generalization of the result of Kageyama who proved this under the stronger assumption that the weight function is constant on the whole block set. Using this, we define tight relative t-designs for odd t, and a strong restriction on the possible parameters of tight relative t-designs in H(n, 2). We obtain a new family of such tight relative t-designs, which were unnoticed before. We will give a list of feasible parameters of such relative 3-designs with \(n \le 100\), and then we discuss the existence and/or the non-existence of such tight relative 3-designs. We also discuss feasible parameters of tight relative 4-designs on two shells in H(n, 2) with \(n \le 50\). In this study we come up with the connection on the topics of classical design theory, such as symmetric 2-designs (in particular 2-\((4u-1,2u-1,u-1)\) Hadamard designs) and Driessen’s result on the non-existence of certain 3-designs. We believe Problems 1 and 2 presented in Sect. 5.2 open a new way to study relative t-designs in H(n, 2). We conclude our paper listing several open problems.     

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

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     

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.