Upper domination and upper irredundance perfect graphs

Let β(G), Γ(G) and IR(G) be the independence number, the upper domination number and the upper irredundance number, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. A graph G is called IR-perfect if Γ(H) =IR(H), for every induced subgraph H of G. In this paper, we present a characterization of Γ-perfect graphs in terms of a family of forbidden induced subgraphs, and show that the class of Γ-perfect graphs is a subclass of IR-perfect graphs and that the class of absorbantly perfect graphs is a subclass of Γ-perfect graphs. These results imply a number of known theorems on Γ-perfect graphs and IR-perfect graphs. Moreover, we prove a sufficient condition for a graph to be Γ-perfect and IR-perfect which improves a known analogous result.     

On piecewise-polynomial approximation of functions with a bounded fractional derivative in an Lp-norm

We study the error in approximating functions with a bounded (r + α)th derivative in an L_p-norm. Here r is a nonnegative integer, α ε [0, 1), and ƒ^{(r + α)} is the classical fractional derivative, i.e., ƒ^{(r + α)}(y) = ∝₀¹, ^α d(ƒ^(r)(t)). We prove that, for any such function ƒ, there exists a piecewise-polynomial of degree s that interpolates ƒ at n equally spaced points and that approximates ƒ with an error (in sup-norm) ƒ^{(r + α)}_p O(n^{−(r+α−1/p}). We also prove that no algorithm based on n function and/or derivative values of ƒ has the error equal ƒ^{(r + α)}_p O(n^{−(r+α−1/p}) for any ƒ. This implies the optimality of piecewise-polynomial interpolation. These two results generalize well-known results on approximating functions with bounded rth derivative (α = 0). We stress that the piecewise-polynomial approximation does not depend on α nor on p. It does not depend on the exact value of r as well; what matters is an upper bound s on r, s r. Hence, even without knowing the actual regularity (r, α, and p) of ƒ, we can approximate the function ƒ with an error equal (modulo a constant) to the minimal worst case error when the regularity were known.     

Rado Numbers for the Equation ∑i = 1 xi + c = xm, for Negative Values of c

For every integer m ≥ 3 and every integer c, let r(m, c) be the least integer, if it exists, such that for every 2-coloring of the set {1, 2, …, r(m, c)} there exists a monochromatic solution to the equation The values of r(m, c) were previously known for all values of m and all nonnegative values of c. In this paper, exact values of r(m, c) are found for all values of m and all values of c such that − m + 2 < c < 0 or c < − (m − 1)(m − 2). Upper and lower bounds are given for the remaining values of c.     

An application of the Turán theorem to domination in graphs

A function f:V(G)→{+1,−1} defined on the vertices of a graph G is a signed dominating function if for any vertex v the sum of function values over its closed neighborhood is at least 1. The signed domination number γ_s(G) of G is the minimum weight of a signed dominating function on G. By simply changing “{+1,−1}” in the above definition to “{+1,0,−1}”, we can define the minus dominating function and the minus domination number of G. In this note, by applying the Turán theorem, we present sharp lower bounds on the signed domination number for a graph containing no (k+1)-cliques. As a result, we generalize a previous result due to Kang et al. on the minus domination number of k-partite graphs to graphs containing no (k+1)-cliques and characterize the extremal graphs.     

The multi‐color Ramsey number of an odd cycle

Let r_k(G) be the k‐color Ramsey number of a graph G. It is shown that for k?2 and that r_k(C_{2m+ 1})?(c^kk!)^1/m if the Ramsey graphs of r_k(C_{2m+ 1}) are not far away from being regular. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 324–328, 2009     

L∞-upper bound of L2-projections onto splines at a geometric mesh

For an integer k 1 and a geometric mesh (qⁱ)_−∞^∞ with q ε (0, ∞), let M_i,k(x): = k[q^{i + k}](· − x)₊^{k − 1}, N_i,k(x): = (q^{i + k} − qⁱM_i,k(x)/k, and let A_k(q) be the Gram matrix (∝M_i,kN_j,k)_i,jεz. It is known that A_k(q)⁻¹_∞ is bounded independently of q. In this paper it is shown that A_k(q)⁻¹_∞ is strictly decreasing for q in [1, ∞). In particular, the sharp upper bound and lower bound for A_k (q)⁻¹ are obtained: for all q ε (0, ∞).     

Graphs satisfying inequality θ(G)θ(G)

In this paper, we study the edge clique cover number of squares of graphs. More specifically, we study the inequality θ(G²)θ(G) where θ(G) is the edge clique cover number of a graph G. We show that any graph G with at most θ(G) vertices satisfies the inequality. Among the graphs with more than θ(G) vertices, we find some graphs violating the inequality and show that dually chordal graphs and power-chordal graphs satisfy the inequality. Especially, we give an exact formula computing θ(T²) for a tree T.     

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

Asymptotic expansions in the conditional central limit theorem

Let X_n, n , be i.i.d. with mean 0, variance 1, and E(¦X_n¦^r) < ∞ for some r 3. Assume that Cramér's condition is fulfilled. We prove that the conditional probabilities P(1/√n Σ_{i = 1}ⁿ X_i t¦B) can be approximated by a modified Edgeworth expansion up to order o(1/n^{(r − 2)/2)}), if the distances of the set B from the σ-fields σ(X₁, …, X_n) are of order O(1/n^{(r − 2)/2)}(lg n)^β), where β < −(r − 2)/2 for r and β < −r/2 for r . An example shows that if we replace β < −(r − 2)/2 by β = −(r − 2)/2 for r (β < −r/2 by β = −r/2 for r ) we can only obtain the approximation order O(1/n^{(r − 2)/2)}) for r (O(lg lgn/n^{(r − 2)/2)}) for r ).     

On the structure of biharmonic functions satisfying the clamped plate conditions on a right angle

Let u(r,θ) be biharmonic and bounded in the circular sector ¦θ¦ < π/4, 0 < r < ρ (ρ > 1) and vanish together with δu/δθ when ¦θ¦ = π/4. We consider the transform û(p,θ) = ∝₀¹r^{p − 1}u(r,θ)dr. We show that for any fixed θ₀ u(p,θ₀) is meromorphic with no real poles and cannot be entire unless u(r, θ₀) ≡ 0. It follows then from a theorem of Doetsch that u(r, θ₀) either vanishes identically or oscillates as r → 0.     

Polynomial Projections inC[−1, 1] andL(−1, 1) with Growthn, 0<γ1/2

Forγ(0, 1/2] we constructn-dimensional polynomial subspacesY_nofC[−1, 1] andL¹(−1, 1) such that the relative projection constantsλ(Y_n, C[−1, 1]) andλ(Y_n, L¹(−1, 1)) grow asn^γ. These subspaces are spanned by Chebyshev polynomials of the first and second kind, respectively. The spacesL¹_{w(α, β}wherew_{α, β}is the weight function of the Jacobi polynomials and (α, β){(−1/2, −1/2), (−1/2, 0), (0, −1/2)} are also studied.     

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

α-Stable characterization of Banach spaces (1 < α < 2)

This work characterizes some subclasses of α-stable (0 < α < 1) Banach spaces in terms of the extendibility to Radon laws of certain α-stable cylinder measures. These result extend the work of S. Chobanian and V. Tarieladze (J. Multivar. Anal.7, 183–203 (1977)). For these spaces it is shown that every Radon stable measure is the continuous image of a stable measure on a suitable L_β space with β = α(1 − α)⁻¹. The latter result extends some work of Garling (Ann. Probab.4, 600–611 (1976)) and Jain (Proceedings, Symposia in Pure Math. XXXI, p. 55–65, Amer. Math. Soc., Providence, R.I.).     

On Positive and Copositive Polynomial and Spline Approximation inLp[−1, 1], 0<p<∞

For a functionfL_p[−1, 1], 0<p<∞, with finitely many sign changes, we construct a sequence of polynomialsP_nΠ_nwhich are copositive withfand such that f−P_npCω(f, (n+1)⁻¹)_p, whereω(f, t)_pdenotes the Ditzian–Totik modulus of continuity inL_pmetric. It was shown by S. P. Zhou that this estimate is exact in the sense that if f has at least one sign change, thenωcannot be replaced byω²if 1<p<∞. In fact, we show that even for positive approximation and all 0<p<∞ the same conclusion is true. Also, some results for (co)positive spline approximation, exact in the same sense, are obtained.     

Trace cocharacters and the Kronecker products of Schur functions

It follows from the theory of trace identities developed by Procesi and Razmyslov that the trace cocharacters arising from the trace identities of the algebra M_r(F) of r×r matrices over a field F of characteristic zero are given by TC_r,n=∑_λΛr(n)χ^λχ^λ where χ^λχ^λ denotes the Kronecker product of the irreducible characters of the symmetric group associated with the partition λ with itself and Λ_r(n) denotes the set of partitions of n with r or fewer parts, i.e. the set of partitions λ=(λ₁λ_k) with kr. We study the behavior of the sequence of trace cocharacters TC_r,n. In particular, we study the behavior of the coefficient of χ^(ν,n−m) in TC_r,n as a function of n where ν=(ν₁ν_k) is some fixed partition of m and n−mν_k. Our main result shows that such coefficients always grow as a polynomial in n of degree r−1.     

On the L convergence of Lagrange interpolating entire functions of exponential type

Let f: be a continuous, 2π-periodic function and for each n ε let t_n(f; ·) denote the trigonometric polynomial of degree n interpolating f in the points 2kπ/(2n + 1) (k = 0, ±1, …, ±n). It was shown by J. Marcinkiewicz that lim_{n → ∞} ∝₀^2π¦f(θ) − t_n(f θ)¦^p dθ = 0 for every p > 0. We consider Lagrange interpolation of non-periodic functions by entire functions of exponential type τ > 0 in the points kπ/τ (k = 0, ± 1, ± 2, …) and obtain a result analogous to that of Marcinkiewicz.     

Zolotarevω-Polynomials inWH[0, 1]

The main result of this paper characterizes generalizationsof Zolotarev polynomials as extremal functions in the Kolmogorov–Landauproblem

Full-size image

whereω(t) is a concave modulus of continuity,r, m: 1mr,are integers, andBB₀(r, m, ω). We show that theextremal functionsZ_Bhaver+1 points of alternance andthe full modulus of continuity ofZ^(r)_B: ω(Z^(r)_B; t)=ω(t) for allt[0, 1]. This generalizesthe Karlin's result on the extremality of classical Zolotarevpolynomials in the problem () forω(t)=tand allBB_r.     

A generalization of the Weinstein-Moser theorems on periodic orbits of a Hamiltonian system near an equilibrium

We study the Hamiltonian system (HS) where H ε C² ( ^2N, ) satisfies H (0) = 0, H′ (0) = 0 and the quadratic form ) is non-degenerate. We fix τ₀ > 0 and assume that ²N E F decomposes into linear subspaces E and F which are invariant under the flow associated to the linearized system (LHS) = JH″ (0) x and such that each solution of (LHS) in E is τ₀-periodic whereas no solution of (LHS) in F − 0 is τ₀-periodic. We write σ(τ₀) = σ_Q(τ₀) for the signature of the quadratic form Q restricted to E. If σ(τ₀) ≠ 0 then there exist periodic solutions of (HS) arbitrarily close to 0. More precisely we show, either there exists a sequence x_k → 0 of τ_k-periodic orbits on the energy level H⁻¹ (0) with τ_k → τ₀; or for each λ close to 0 with λσ(τ₀) > 0 the energy level H⁻¹ (λ) contains at least distinct periodic orbits of (HS) near 0 with periods near τ₀. This generalizes a result of Weinstein and Moser who assumed QE to be positive definite.     

Complete on Average Boolean Satisfiability

We present in this paper a dynamic binary coding scheme α on CNF formulas ψ, and show that under a uniform distribution μ_α on binary string α(ψ), SAT is complete on average, where μ_α(ψ) is proportional to α(ψ)⁻²2^−α(ψ). We then show that there is k₀>2 such that for all kk₀, kSAT under μ_α is complete on average.