A note on the hardness of Skolem-type sequences

The purpose of this note is to give upper bounds (assuming different from ) on how far the generalizations of Skolem sequences can be taken while still hoping to resolve the existence question. We prove that the existence questions for both multi-Skolem sequences and generalized Skolem sequences are strongly -complete. These results are significant strengthenings and simplifications of the recent -completeness result for generalized multi-Skolem sequences.     

The polynomial dichotomy for three nonempty part sandwich problems

We classify into polynomial time or -complete all three nonempty part sandwich problems. This solves the polynomial dichotomy into polynomial time and -complete for this class of graph partition problems.     

Twisted first homology groups of the automorphism group of a free group

The automorphism group and outer automorphism group of a free group F_n of rank n act on the abelianized group H of F_n and the dual group H^* of H. The twisted first homology groups of and with coefficients in H and H^* are calculated.     

Game colouring of the square of graphs

This paper studies the game chromatic number and game colouring number of the square of graphs. In particular, we prove that if G is a forest of maximum degree Δ≥9, then , and there are forests G with . It is also proved that for an outerplanar graph G of maximum degree Δ, , and for a planar graph G of maximum degree Δ, .     

Equivalent formulations for Monge-Kantorovich equation

In this paper, we study some equivalent formulations in divergence form for the optimization problem where and k>0 in Ω. This is the so called dual equation of Monge-Kantorovich problem.     

Exact rates in log law for positively associated random variables

Let be a strictly stationary sequence of positively associated random variables with mean zero and finite variance. Set , Mn=maxk?n|Sk|, n?1. Suppose . In this paper, we study the exact convergence rates of a kind of weighted infinite series of , and as ε↘0, respectively.     

Majorization of regular measures and weights with finite and positive critical exponent

For the sets , 1?p<∞, of positive finite Borel measures μ on the real axis with the set of algebraic polynomials P dense in Lp(R,dμ), we establish a majorization principle of their “boundaries,” i.e. for every there exists such that dμ/dν?1. A corresponding principle holds for the sets , p>0, of non-negative upper semi-continuous on R functions (weights) w such that P is dense in the space : For every there exists such that w?ω.     

Irrationality proof of certain Lambert series using little q-Jacobi polynomials

We apply the Padé technique to find rational approximations to

     

Distance-two labelings of digraphs

For positive integers j?k, an L(j,k)-labeling of a digraph D is a function f from V(D) into the set of nonnegative integers such that |f(x)-f(y)|?j if x is adjacent to y in D and |f(x)-f(y)|?k if x is of distance two to y in D. Elements of the image of f are called labels. The L(j,k)-labeling problem is to determine the -number of a digraph D, which is the minimum of the maximum label used in an L(j,k)-labeling of D. This paper studies -numbers of digraphs. In particular, we determine -numbers of digraphs whose longest dipath is of length at most 2, and -numbers of ditrees having dipaths of length 4. We also give bounds for -numbers of bipartite digraphs whose longest dipath is of length 3. Finally, we present a linear-time algorithm for determining -numbers of ditrees whose longest dipath is of length 3.     

A one-to-one correspondence between colorings and stable sets

Given a graph G, we construct an auxiliary graph with vertices such that the set of all stable sets of is in one-to-one correspondence with the set of all colorings of G. Then, we show that the Max-Coloring problem in G reduces to the Maximum Weighted Stable set problem in .     

Lifting Bailey pairs to WP-Bailey pairs

A pair of sequences such that and