A Lower Bound for {a+b:aA, bB, and P(a,b)≠0}

Let A and B be two finite subsets of a field . In this paper, we provide a non-trivial lower bound for {a+b:aA, bB, and P(a,b)≠0} where P(x,y) [x,y].     

Coloring of distance graphs with intervals as distance sets

Let D be a set of positive integers. The distance graph G(Z,D) with distance set D is the graph with vertex set Z in which two vertices x,y are adjacent if and only if |x−y|D. The fractional chromatic number, the chromatic number, and the circular chromatic number of G(Z,D) for various D have been extensively studied recently. In this paper, we investigate the fractional chromatic number, the chromatic number, and the circular chromatic number of the distance graphs with the distance sets of the form D_m,[k,k^′]={1,2,…,m}−{k,k+1,…,k^′}, where m, k, and k^′ are natural numbers with m≥k^′≥k. In particular, we completely determine the chromatic number of G(Z,D_m,[2,k^′]) for arbitrary m, and k^′.     

Approximations from Subspaces of C0(X)

We show among other things that if B is a linear space of continuous real-valued functions vanishing at infinity on a locally compact Hausdorff space X, for which there is a continuous function h defined in a neighbourhood of 0 in the real line which is non-affine in every neighbourhood of 0 and satisfies |h(t)|k |t| for all t, such that hb is in B whenever b is in B and the composite function is defined, then every function in C₀(X) which can be approximated on every pair of points in X by functions in B can be approximated uniformly by functions in B.     

On αrγs(k)-perfect graphs

For some integer k0 and two graph parameters π and τ, a graph G is called πτ(k)-perfect, if π(H)−τ(H)k for every induced subgraph H of G. For r1 let α_r and γ_r denote the r-(distance)-independence and r-(distance)-domination number, respectively. In (J. Graph Theory 32 (1999) 303–310), I. Zverovich gave an ingenious complete characterization of α₁γ₁(k)-perfect graphs in terms of forbidden induced subgraphs. In this paper we study α_rγ_s(k)-perfect graphs for r,s1. We prove several properties of minimal α_rγ_s(k)-imperfect graphs. Generalizing Zverovich's main result in (J. Graph Theory 32 (1999) 303–310), we completely characterize α_2r−1γ_r(k)-perfect graphs for r1. Furthermore, we characterize claw-free α₂γ₂(k)-perfect graphs.     

Existence of frame SOLS of type ab

An SOLS (self-orthogonal latin square) of order v with n_i missing sub-SOLS (holes) of order h_i (1ik), which are disjoint and spanning (i.e. ∑_i=1^k n_ih_i=v), is called a frame SOLS and denoted by FSOLS(h₁^n₁h₂^n₂ h_k^n_k). It has been proved that for b2 and n odd, an FSOLS(aⁿb¹) exists if and only if n4 and n1+2b/a. In this paper, we show the existence of FSOLS(aⁿb¹) for n even and FSOLS(aⁿ1¹) for n odd.     

On the evaluation of the Eigenvalues of a banded toeplitz block matrix

Let A = (a_ij) be an n × n Toeplitz matrix with bandwidth k + 1, K = r + s, that is, a_ij = a_j−i, i, J = 1,… ,n, a_i = 0 if i > s and if i < -r. We compute p(λ)= det(A - λI), as well as p(λ)/p′(λ), where p′(λ) is the first derivative of p(λ), by using O(k log k log n) arithmetic operations. Moreover, if a_i are m × m matrices, so that A is a banded Toeplitz block matrix, then we compute p(λ), as well as p(λ)/p′(λ), by using O(m³k(log² k + log n) + m²k log k log n) arithmetic operations. The algorithms can be extended to the computation of det(A − λB) and of its first derivative, where both A and B are banded Toeplitz matrices. The algorithms may be used as a basis for iterative solution of the eigenvalue problem for the matrix A and of the generalized eigenvalue problem for A and B.     

Inequalities and bounds for quasi-symmetric 3-designs

Quasi-symmetric 3-designs with block intersection numbers x and y(0x<y<k) are studied, several inequalities satisfied by the parameters of a quasi-symmetric 3-designs are obtained. Let D be a quasi-symmetric 3-design with the block size k and intersection numbers x, y; y>x1 and suppose D′ denote the complement of D with the block size k′ and intersection numbers x′ and y′. If k −1 x + y then it is proved that x′ + y′ k′. Using this it is shown that the quasi-symmetric 3-designs corresponding to y = x + 1, x + 2 are either extensions of symmetric designs or designs corresponding to the Witt-design (or trivial design, i.e., v = k + 2) or the complement of above designs.     

Some extensions of the Kantorovich inequality and statistical applications

Kantorovich gave an upper bound to the product of two quadratic forms, (X′AX) (X′A⁻¹X), where X is an n-vector of unit length and A is a positive definite matrix. Bloomfield, Watson and Knott found the bound for the product of determinants |X′AX| |X′A⁻¹X| where X is n × k matrix such that X′X = I_k. In this paper we determine the bounds for the traces and determinants of matrices of the type X′AYY′A⁻¹X, X′B²X(X′BCX)⁻¹ X′C²X(X′BCX)⁻¹ where X and Y are n × k matrices such that X′X = Y′Y = I_k and A, B, C are given matrices satisfying some conditions. The results are applied to the least squares theory of estimation.     

On the structure of the sumsets

Let A be a set of nonnegative integers. For h≥2, denote by hA the set of all the integers representable by a sum of h elements from A. In this paper, we prove that, if k≥3, and A={a₀,a₁,…,a_k−1} is a finite set of integers such that 0=a₀<a₁<?<a_k−1 and (a₁,…,a_k−1)=1, then there exist integers c and d and sets C⊆[0,c−2] and D⊆[0,d−2] such that hA=C∪[c,ha_k−1−d]∪(ha_k−1−D) for all . The result is optimal. This improves Nathanson’s result: h≥max{1,(k−2)(a_k−1−1)a_k−1}.     

Extremal Regular Graphs with Prescribed Odd Girth

The odd girth of a graph G gives the length of a shortest odd cycle in G. Let ƒ(k, g) denote the smallest n such that there exists a k-regular graph of order n and odd girth g. It is known that ƒ(k, g) ≥ kg/2 and that ƒ(k, g) = kg/2 if k is even. The exact values of ƒ(k, g) are also known if k = 3 or g = 5. Let x_e denote the smallest even integer no less than x, δ(g) = (−1)^{g − 1}/2, and s(k) = min {p + q | k = pq, where p and q are both positive integers}. It is proved that if k ≥ 5 and g ≥ 7 are both odd, then [formula] with the exception that ƒ(5, 7) = 20.     

An Asymptotic Property of Schachermayer's Space under Renorming

Let X be a Banach space with closed unit ball B. Given k , X is said to be k-β, respectively, (k + 1)-nearly uniformly convex ((k + 1)-NUC), if for every ε > 0 there exists δ, 0 < δ < 1, so that for every x B and every ε-separated sequence (x_n) B there are indices (n_i)^k_{i = 1}, respectively, (n_i)^{k + 1}_{i = 1}, such that (1/(k + 1))||x + ∑^k_{i = 1} x_ni|| ≤ 1 − δ, respectively, (1/(k + 1))||∑^{k + 1}_{i = 1} x_ni|| ≤ 1 − δ. It is shown that a Banach space constructed by Schachermayer is 2-β, but is not isomorphic to any 2-NUC Banach space. Modifying this example, we also show that there is a 2-NUC Banach space which cannot be equivalently renormed to be 1-β.     

Distribution of exponential functions with k-full exponent modulo a prime

For a real x -1 we denote by S_k[X] the set of k-full integers n x, that is, the set of positive integers n x such that ℓ^k|n for any prime divisor ℓ|n. We estimate exponential sums of the form where is a fixed integer with gcd (, p) = 1, and apply them to studying the distribution of the powers ⁿ, n S_k[x], in the residue ring modulo p 1.     

Reflection sieve obstructions in finite groups of type dn

In [4] we constructed certain homology representations of a finite group G of type A_n, B_n or C_n, and showed that these representations can be used to sift out the reflection compound characters of G. In the present note, we show that for a group G of type D_n, each reflection compound character π^(k), 2 k n − 2, determines a unique “obstruction” character θ^(k), which occurs with positive multiplicity in every homology representation containing π^(k).     

Weak convergence to the matrix stochastic integral ∫0 B dB′

The asymptotic theory of regression with integrated processes of the ARIMA type frequently involves weak convergence to stochastic integrals of the form ∫₀¹ W dW, where W(r) is standard Brownian motion. In multiple regressions and vector autoregressions with vector ARIMA processes, the theory involves weak convergence to matrix stochastic integrals of the form ∫₀¹ B dB′, where B(r) is vector Brownian motion with a non-scalar covariance matrix. This paper studies the weak convergence of sample covariance matrices to ∫₀¹ B dB′ under quite general conditions. The theory is applied to vector autoregressions with integrated processes.     

Edge intersection graphs of systems of paths on a grid with a bounded number of bends

We answer some of the questions raised by Golumbic, Lipshteyn and Stern and obtain some other results about edge intersection graphs of paths on a grid (EPG graphs). We show that for any d≥4, in order to represent every n vertex graph with maximum degree d as an edge intersection graph of n paths on a grid, a grid of area Θ(n²) is needed. We also show several results related to the classes B_k-EPG, where B_k-EPG denotes the class of graphs that have an EPG representation such that each path has at most k bends. In particular, we prove: For a fixed k and a sufficiently large n, the complete bipartite graph K_m,n does not belong to B_2m−3-EPG (it is known that this graph belongs to B_2m−2-EPG); for any odd integer k we have B_k-EPG B_k+1-EPG; there is no number k such that all graphs belong to B_k-EPG; only 2^O(knlog(kn)) out of all the labeled graphs with n vertices are in B_k-EPG.     

Almost Kenmotsu manifolds with a condition of η-parallelism

We consider almost Kenmotsu manifolds (M²ⁿ⁺¹,φ,ξ,η,g) with η-parallel tensor h^′=h○φ, 2h being the Lie derivative of the structure tensor φ with respect to the Reeb vector field ξ. We describe the Riemannian geometry of an integral submanifold of the distribution orthogonal to ξ, characterizing the CR-integrability of the structure. Under the additional condition _ξh^′=0, the almost Kenmotsu manifold is locally a warped product. Finally, some lightlike structures on M²ⁿ⁺¹ are introduced and studied.     

NON-EMPTY CROSS-2-INTERSECTING FAMILIES OF SUBSETS

Let Cdenote the set of all k-subests of an n-set.Assume Alohtain in Ca,and A lohtain in (A,B) is called a cross-2-intersecting family if |A B≥2 for and A∈A,B∈B.In this paper,the best upper bounds of the cardinalities for non-empty cross-2-intersecting familles of a-and b-subsets are obtained for some a and b,A new proof for a Frankl-Tokushige theorem[6] is also given.     

Positive Bernstein-Sheffer Operators

Let h(t) = Σ_{n ≥ 1}h_nt_n, h₁ > 0, and exp(xh(t)) = Σ_{n ≥ 0}P_n(x) tⁿ/n!. For f C[0,1], the associated Bernstein-Sheffer operator of degree n is defined by B^h_nf(x) = P_n^{− 1} Σⁿ_{k = 0}f(k/n)(ⁿ_k) P_k(x) P_{n − k}(1 − x) where p_n = p_n(1). We characterize functions h for which B^h_n is a positive operator for all n ≥ 0. Then we give a necessary and sufficient condition insuring the uniform convergence of B^h_nf to f. When h is a polynomial, we give an upper bound for the error f − B^h_nf _∞. We also discuss the behavior of B^h_nf when h is a series with a finite or infinite radius of convergence.     

Entire functions that share a polynomial with their derivatives

Let f be a nonconstant entire function, k and q be positive integers satisfying k>q, and let Q be a polynomial of degree q. This paper studies the uniqueness problem on entire functions that share a polynomial with their derivatives and proves that if the polynomial Q is shared by f and f^′ CM, and if f^(k)(z)−Q(z)=0 whenever f(z)−Q(z)=0, then f≡f^′. We give two examples to show that the hypothesis k>q is necessary.     

About equivalent interval colorings of weighted graphs

Given a graph G=(V,E) with strictly positive integer weights ω_i on the vertices iV, a k-interval coloring of G is a function I that assigns an interval I(i){1,…,k} of ω_i consecutive integers (called colors) to each vertex iV. If two adjacent vertices x and y have common colors, i.e. I(i)∩I(j)≠0/ for an edge [i,j] in G, then the edge [i,j] is said conflicting. A k-interval coloring without conflicting edges is said legal. The interval coloring problem (ICP) is to determine the smallest integer k, called interval chromatic number of G and denoted χ_int(G), such that there exists a legal k-interval coloring of G. For a fixed integer k, the k-interval graph coloring problem (k-ICP) is to determine a k-interval coloring of G with a minimum number of conflicting edges. The ICP and k-ICP generalize classical vertex coloring problems where a single color has to be assigned to each vertex (i.e., ω_i=1 for all vertices iV).Two k-interval colorings I₁ and I₂ are said equivalent if there is a permutation π of the integers 1,…,k such that ℓI₁(i) if and only if π(ℓ)I₂(i) for all vertices iV. As for classical vertex coloring, the efficiency of algorithms that solve the ICP or the k-ICP can be increased by avoiding considering equivalent k-interval colorings, assuming that they can be identified very quickly. To this purpose, we define and prove a necessary and sufficient condition for the equivalence of two k-interval colorings. We then show how a simple tabu search algorithm for the k-ICP can possibly be improved by forbidding the visit of equivalent solutions.