A chromatic partition polynomial

A polynomial in two variables is defined by C_n(x,t)=Σ_πΠnx(Gπ,x)t^|π|, where Π_n is the lattice of partitions of the set {1, 2, …, n}, G_π is a certain interval graph defined in terms of the partition gp, χ(G_π, x) is the chromatic polynomial of G_π and |π| is the number of blocks in π. It is shown that , where S(n, i) is the Stirling number of the second kind and (x)_i = x(x − 1) ··· (x − i + 1). As a special case, C_n(−1, −t) = A_n(t), where A_n(t) is the nth Eulerian polynomial. Moreover, A_n(t)=Σ_πΠna_πt^|π| where a_π is the number of acyclic orientations of G_π.     

On the degree of regularity of some equations

In this paper we investigate the behaviour of the solutions of equations Σ_I=1ⁿ a_ix_i = b, where Σ_i=1ⁿ, a_i = 0 and b ≠ 0, with respect to colorings of the set N of positive integers. It turns out that for any b ≠ 0 there exists an 8-coloring of N, admitting no monochromatic solution of x₃ − x₂ = x₂ − x₁ + b. For this equation, for b odd and 2-colorings, only an odd-even coloring prevents a monochromatic solution. For b even and 2-colorings, always monochromatic solutions can be found, and bounds for the corresponding Rado numbers are given. If one imposes the ordering x₁ < x₂ < x₃, then there exists already a 4-coloring of N, which prevents a monochromatic solution of x₃ − x₂ = x₂ − x₁ + b, where b ε N.     

First passage time for some stationary processes

For a 1-dependent stationary sequence {X_n} we first show that if u satisfies p₁=p₁(u)=P(X₁>u)0.025 and n>3 is such that 88np₁³1, then

P{max(X₁,…,X_n)u}=ν·μⁿ+O{p₁³(88n(1+124np₁³)+561)}, n>3,

where

ν=1−p₂+2p₃−3p₄+p₁²+6p₂²−6p₁p₂,μ=(1+p₁−p₂+p₃−p₄+2p₁²+3p₂²−5p₁p₂)⁻¹

with

p_k=p_k(u)=P{min(X₁,…,X_k)>u}, k1

and

|O(x)||x|.

From this result we deduce, for a stationary T-dependent process with a.s. continuous path {Y_s}, a similar, in terms of P{max_0skTY_s<u}, k=1,2 formula for P{max_0stY_su}, t>3T and apply this formula to the process Y_s=W(s+1)−W(s), s0, where {W(s)} is the Wiener process. We then obtain numerical estimations of the above probabilities.     

Almost perfect matchings in random uniform hypergraphs

We consider the following model H_r(n, p) of random r-uniform hypergraphs. The vertex set consists of two disjoint subsets V of size | V | = n and U of size | U | = (r − 1)n. Each r-subset of V × (_r−1^U) is chosen to be an edge of H ε H_r(n, p) with probability p = p(n), all choices being independent. It is shown that for every 0 < < 1 if P = (C ln n)/n^r−1 with C = C() sufficiently large, then almost surely every subset V₁ V of size | V₁ | = (1 − )n is matchable, that is, there exists a matching M in H such that every vertex of V₁ is contained in some edge of M.     

The growth of laguerre matrix polynomials on bounded intervals

Let A be a matrix in ^r×r such that Re(z) > −1/2 for all the eigenvalues of A and let {π_n^(A,1/2) (x)} be the normalized sequence of Laguerre matrix polynomials associated with A. In this paper, it is proved that π_n^(A,1/2) (x) = O(n^(A)/2ln^r−1(n)) and π_n+1^(A,1/2) (x) − π_n^(A,1/2) (x) = O(n^((A)−1)/2ln^r−1(n)) uniformly on bounded intervals, where (A) = max{Re(z); z eigenvalue of A}.     

Subsets of an interval whose product is a power

We form squares from the product of integers in a short interval [n, n + t_n], where we include n in the product. If p is prime, p|n, and (₂^p) > n, we prove that p is the minimum t_n. If no such prime exists, we prove t_n √5n when n> 32. If n = p(2p − 1) and both p and 2p − 1 are primes, then t_n = 3p> 3 √n/2. For n(n + u) a square > n², we conjecture that a and b exist where n < a < b < n + u and nab is a square (except n = 8 and N = 392). Let g₂(n) be minimal such that a square can be formed as the product of distinct integers from [n, g₂(n)] so that no pair of consecutive integers is omitted. We prove that g₂(n) 3n − 3, and list or conjecture the values of g₂(n) for all n. We describe the generalization to kth powers and conjecture the values for large n.     

On neighborhood condition for graphs to have [a,b]-factors

Let G be a graph of order n, and let a and b be integers such that 1a<b. Let δ(G) be the minimum degree of G. Then we prove that if δ(G)(k−1)a, n(a+b)(k(a+b)−2)/b, and |N_G(x₁)N_G(x₂)N_G(x_k)|an/(a+b) for any independent subset {x₁,x₂,…,x_k} of V(G), where k2, then G has an [a,b]-factor. This result is best possible in some sense.     

Oscillation theorems for second-order half-linear differential equations

Oscillation criteria for the second-order half-linear differential equation

[r(t)|ξ′(t)|⁻¹ ξ′(t)]′ + p(t)|ξ(t)|⁻¹ξ(t)=0, t t₀

are established, where > 0 is a constant and exists for t [t₀, ∞). We apply these results to the following equation:

where , D = (D₁,…, D_N), Ω_a = x ^N : |x| ≥ a} is an exterior domain, and c C([a, ∞), ), n > 1 and N ≥ 2 are integers. Here, a > 0 is a given constant.     

Stable limits of empirical processes of moving averages with infinite variance

The paper obtains a functional limit theorem for the empirical process of a stationary moving average process X_t with i.i.d. innovations belonging to the domain of attraction of a symmetric -stable law, 1<<2, with weights b_j decaying as j^−β, 1<β<2/. We show that the empirical process (normalized by N^1/β) weakly converges, as the sample size N increases, to the process c_x⁺L⁺+c_x⁻L⁻, where L⁺,L⁻ are independent totally skewed β-stable random variables, and c_x⁺,c_x⁻ are some deterministic functions. We also show that, for any bounded function H, the weak limit of suitably normalized partial sums of H(X_s) is an β-stable Lévy process with independent increments. This limiting behavior is quite different from the behavior of the corresponding empirical processes in the parameter regions 1/<β<1 and 2/<β studied in Koul and Surgailis (Stochastic Process. Appl. 91 (2001) 309) and Hsing (Ann. Probab. 27 (1999) 1579), respectively.     

The W-convexity and normal structure in banach spaces

Let X be a Banach space, S(X) - x ε X : #x02016; = 1 be the unit sphere of X.The parameter, modulus of W^*-convexity, W^*(ε) = inf <(x − y)/2, f_x> : x, y S(X), x − y ≥ ε, f_x Δ_x , where 0 ≤ ε ≤ 2 and Δ_x S(X^*) be the set of norm 1 supporting functionals of S(X) at x, is investigated_ The relationship among uniform nonsquareness, uniform normal structure and the parameter W^*(ε) are studied, and a known result is improved. The main result is that for a Banach space X, if there is ε, where 0 < ε < 1/2, such that W^*(1 + ε) > ε/2 where W^*(1 + ε) = lim_→ε W^* (1 + ), then X has normal structure.     

Numerical simulation of blow-up of a 2D generalized Ginzburg-Landau equation

We study the Cauchy problem for the following generalized Ginzburg-Landau equation u_t = (ν+i)Δu − (κ+iβ)|u|^2qu + γu in two spatial dimensions for q > 1 (here , β, γ are real parameters and ν,κ > 0). A blow-up of solutions is found via numerical simulation in several cases for q > 1.     

Full quadrature sums for pth powers of polynomials with Freud weights

In this paper, we provide a solution of the quadrature sum problem of R. Askey for a class of Freud weights. Let r> 0, b (− ∞, 2]. We establish a full quadrature sum estimate

1 p < ∞, for every polynomial P of degree at most n + rn^1/3, where W² is a Freud weight such as exp(−¦x¦), > 1, λ_jn are the Christoffel numbers, x_jn are the zeros of the orthonormal polynomials for the weight W², and C is independent of n and P. We also prove a generalisation, and that such an estimate is not possible for polynomials P of degree M = m(n) if m(n) = n + ξ_nn^1/3, where ξ_n → ∞ as n → ∞. Previous estimates could sum only over those x_jn with ¦x_jn¦ σx_1n, some fixed 0 < σ < 1.     

Individual behaviors of oriented walks

Given an infinite sequence t=(_k)_k of −1 and +1, we consider the oriented walk defined by S_n(t)=∑_k=1ⁿ₁₂…_k. The set of t's whose behaviors satisfy S_n(t)bn^τ is considered ( and 0<τ1 being fixed) and its Hausdorff dimension is calculated. A two-dimensional model is also studied. A three-dimensional model is described, but the problem remains open.     

Strong approximation for cross-covariances of linear variables with long-range dependence

Suppose {_k, −∞ < k < ∞} is an independent, not necessarily identically distributed sequence of random variables, and {c_j}^∞_j=0, {d_j}^∞_j=0 are sequences of real numbers such that Σ_jc²_j < ∞, Σ_jd²_j < ∞. Then, under appropriate moment conditions on {_k, −∞ < k < ∞}, y_k Σ^∞_j=0c_jk-j, z_k Σ^∞_j=0d_jk-j exist almost surely and in ⁴ and the question of Gaussian approximation to S_[t]Σ^[t]_k=1 (y_k z_k − E{y_k z_k}) becomes of interest. Prior to this work several related central limit theorems and a weak invariance principle were proven under stationary assumptions. In this note, we demonstrate that an almost sure invariance principle for S_[t], with error bound sharp enough to imply a weak invariance principle, a functional law of the iterated logarithm, and even upper and lower class results, also exists. Moreover, we remove virtually all constraints on _k for “time” k ≤ 0, weaken the stationarity assumptions on {_k, −∞ < k < ∞}, and improve the summability conditions on {c_j}^∞_j=0, {d_j}^∞_j=0 as compared to the existing weak invariance principle. Applications relevant to this work include normal approximation and almost sure fluctuation results in sample covariances (let d_j = c_j-m for j ≥ m and otherwise 0), quadratic forms, Whittle's and Hosoya's estimates, adaptive filtering and stochastic approximation.     

Flawless 0-sequences and Hilbert functions of Cohen-Macaulay integral domains

Let A = A₀A₁ be a commutative graded ring such that (i) A₀ = k a field, (ii) A = k[A₁] and (iii) dim_k A₁ < ∞. It is well known that the formal power series ∑^∞_{n = 0} (dim_kA_n)λ ⁿ is of the form (h₀ + h₁λ + + h_sλ^s)/(1 − λ)^dimA with each h_iε . We are interested in the sequence (h₀, h₁,…,h_s), called the h-vector of A, when A is a Cohen–Macaulay integral domain. In this paper, after summarizing fundamental results (Section 1), we study h-vectors of certain Gorenstein domains (Section 2) and find some examples of h-vectors arising from integrally closed level domains (Sections 3 and 4).     

New constructions of divisible designs

A construction is given for a (p^2a(p+1),p²,p^2a+1(p+1),p^2a+1,p^2a(p+1)) (p a prime) divisible difference set in the group H×Z²_pa+1 where H is any abelian group of order p+1. This can be used to generate a symmetric semi-regular divisible design; this is a new set of parameters for λ₁≠0, and those are fairly rare. We also give a construction for a (p^a−1+p^a−2+…+p+2,p^a+2, p^a(p^a+p^a−1+…+p+1), p^a(p^a−1+…+p+1), p^a−1(p^a+…+p²+2)) divisible difference set in the group H×Z_p2×Z^a_p. This is another new set of parameters, and it corresponds to a symmetric regular divisible design. For p=2, these parameters have λ₁=λ₂, and this corresponds to the parameters for the ordinary Menon difference sets.     

More limit theory for the sample correlation function of moving averages

Let X_t = Σ^∞_j=-∞ c_jZ_{t - j} be a moving average process where {Z_t} is iid with common distribution in the domain of attraction of a stable law with index , 0 < < 2. If 0 < < 2, E|Z₁| < ∞ and the distribution of |Z₁|and |Z₁Z₂| are tail equivalent then the sample correlation function of {X₁} suitably normalized converges in distribution to the ratio of two dependent stable random variables with indices and /2. This is in sharp contrast to the case E|Z₁| ^{= ∞} where the limit distribution is that of the ratio of two independent stable variables. Proofs rely heavily on point process techniques. We also consider the case when the sample correlations are asymptotically normal and extend slightly the classical result.     

Intersections of nest algebras in finite dimensions

If are maximal nests on a finite-dimensional Hilbert space H, the dimension of the intersection of the corresponding nest algebras is at least dim H. On the other hand, there are three maximal nests whose nest algebras intersect in the scalar operators. The dimension of the intersection of two nest algebras (corresponding to maximal nests) can be of any integer value from n to n(n+1)/2, where n=dim H. For any two maximal nests there exists a basis {f₁,f₂,…,f_n} of H and a permutation π such that and where M_i=  span{f₁,f₂,…,f_i} and N_i= span{f_π(1),f_π(2),…,f_π(i)}. The intersection of the corresponding nest algebras has minimum dimension, namely dim H, precisely when π(j)=n−j+1,1jn. Those algebras which are upper-triangular matrix incidence algebras, relative to some basis, can be characterised as intersections of certain nest algebras.     

An efficient algorithm for the parametric resource allocation problem

The parametric resource allocation problem asks to minimize the sum of separable single-variable convex functions containing a parameter λ, Σ_{i = 1}ⁿ (ƒ_i(x_i + λg_i(x_i)), under simple constraints Σ_{i = 1}ⁿ x_i = M, l_i≤x_i≤u_i and x_i: nonnegative integers for i = 1, 2, …, n, where M is a given positive integer, and l_i and u_i are given lower and upper bounds on x_i. This paper presents an efficient algorithm for computing the sequence of all optimal solutions when λ is continuously changed from 0 to ∞. The required time is O(G√Mlog² n + n log n + n log(M/n)), where G = Σ_{i = 1}ⁿ u_i − Σ_{i = 1n} l_i and an evaluation of ƒ_i(·) or g_i(·) is assumed to be done in constant time.     

A special k-coloring for a connected k-chromatic graph

For each positive integer k we consider the smallest positive integer f(k) (dependent only on k) such that the following holds: Each connected graph G with chromatic number χ(G) = k can be properly vertex colored by k colors so that for each pair of vertices x_o and x_p in any color class there exist vertices x₁, x₂, …, x_p-1 of the same class with dist(x_i, x_i+1) f(k) for each i, 0 i p − 1. Thus, the graph is k-colorable with the vertices of each color class placed throughout the graph so that no subset of the class is at a distance > f(k) from the remainder of the class.

We prove that f(k) < 12k when the order of the graph is k(k − 2) + 1.