(k,+)-distance-hereditary graphs

In this work we introduce, characterize, and provide algorithmic results for (k,+)-distance-hereditary graphs, k0. These graphs can be used to model interconnection networks with desirable connectivity properties; a network modeled as a (k,+)-distance-hereditary graph can be characterized as follows: if some nodes have failed, as long as two nodes remain connected, the distance between these nodes in the faulty graph is bounded by the distance in the non-faulty graph plus an integer constant k. The class of all these graphs is denoted by DH(k,+). By varying the parameter k, classes DH(k,+) include all graphs and form a hierarchy that represents a parametric extension of the well-known class of distance-hereditary graphs.     

On α-greedy expansions of numbers

We study a redundant binary number system that was recently introduced by Székely and Wang. For a natural number n, it is defined as follows: let k satisfy ; then 2^k is subtracted from n, and the expansion continues recursively. It stops, when a power of 2 is reached.For this and more general number systems, where the factor 2/3 is replaced by a general one, we find an explicit formula for the kth digit ε_k{0,1,2}. This allows us to compute the cumulative frequency of a given digit, among the first N integers. Delange's method produces not only the leading term of order NlogN, but also the fluctuating term of order N, and the Fourier coefficients of the periodic functions that are involved.Furthermore, we can compute the expansions from right to left, by translating the ordinary binary expansion using a (finite state) transducer, provided the factor (such as 2/3) is rational. In this case, we prove that the periodic function mentioned above is nowhere differentiable.     

On strongly α-preinvex functions

In this paper, by means of a series of counterexamples, we study in a systematic way the relationships among (pseudo, quasi) α-preinvexity, (strict, strong, pseudo, quasi) α-invexity and (strict, strong, pseudo, quasi) αη-monotonicity. Results obtained in this paper can be viewed as a refinement and improvement of the results of Noor and Noor [M.A. Noor, K.I. Noor, Some characterizations of strongly preinvex functions, J. Math. Anal. Appl. 316 (2006) 697–706].     

On L(d,1)-labelings of graphs

Given a graph G and a positive integer d, an L(d,1)-labeling of G is a function f that assigns to each vertex of G a non-negative integer such that if two vertices u and v are adjacent, then |f(u)−f(v)|d; if u and v are not adjacent but there is a two-edge path between them, then |f(u)−f(v)|1. The L(d,1)-number of G, λ_d(G), is defined as the minimum m such that there is an L(d,1)-labeling f of G with f(V){0,1,2,…,m}. Motivated by the channel assignment problem introduced by Hale (Proc. IEEE 68 (1980) 1497–1514), the L(2,1)-labeling and the L(1,1)-labeling (as d=2 and 1, respectively) have been studied extensively in the past decade. This article extends the study to all positive integers d. We prove that λ_d(G)Δ²+(d−1)Δ for any graph G with maximum degree Δ. Different lower and upper bounds of λ_d(G) for some families of graphs including trees and chordal graphs are presented. In particular, we show that the lower and the upper bounds for trees are both attainable, and the upper bound for chordal graphs can be improved for several subclasses of chordal graphs.     

Difference Families in Z2d+1⊕Z2d+1 and Infinite Translation Designs in Z⊕Z

We analyse 3-subset difference families of Z_2d+1⊕Z_2d+1 arising as reductions (mod 2d+1) of particular families of 3-subsets of Z⊕Z. The latter structures, namely perfect d-families, can be viewed as 2-dimensional analogues of difference triangle sets having the least scope. Indeed, every perfect d-family is a set of base blocks which, under the natural action of the translation group Z⊕Z, cover all edges {(x,y),(x′,y′)} such that |x−x′|, |y−y′|≤d. In particular, such a family realises a translation invariant (G,K₃)-design, where V(G)=Z⊕Z and the edges satisfy the above constraint. For that reason, we regard perfect families as part of the hereby defined translation designs, which comprise and slightly generalise many structures already existing in the literature. The geometric context allows some suggestive additional definitions. The main result of the paper is the construction of two infinite classes of d-families. Furthermore, we provide two sporadic examples and show that a d-family may exist only if d≡0,3,8,11 (mod 12).     

On the Function w( x)=|{1= s= k : x= a s (mod n s)}|

For a finite system of arithmetic sequences the covering function is w(x) = |{1 s k : x a_s (mod n_s)}|. Using equalities involving roots of unity we characterize those systems with a fixed covering function w(x). From the characterization we reveal some connections between a period n₀ of w(x) and the moduli n₁, . . . , n_k in such a system A. Here are three central results: (a) For each r=0,1, . . .,n_k/(n₀,n_k)–1 there exists a Jc{1, . . . , k–1} such that . (b) If n₁ ···n_k–l <n_k–l+1 =···=n_k (0 < l < k), then for any positive integer r < n_k/n_k–l with r 0 (mod n_k/(n₀,n_k)), the binomial coefficient can be written as the sum of some (not necessarily distinct) prime divisors of n_k. (c) max_(xw(x) can be written in the form where m₁, . . .,m_k are positive integers.The research is supported by the Teaching and Research Award Fund for Outstanding Young Teachers in Higher Education Institutions of MOE, and the National Natural Science Foundation of P. R. China.     

Euler-type transformations for the generalized hypergeometric function r+2Fr+1(x)

We provide generalizations of two of Euler’s classical transformation formulas for the Gauss hypergeometric function extended to the case of the generalized hypergeometric function _r+2 F _r+1(x) when there are additional numeratorial and denominatorial parameters differing by unity. The method employed to deduce the latter is also implemented to obtain a Kummer-type transformation formula for _r+1 F _r+1 (x) that was recently derived in a different way.     

A nonterminating 8φ7 summation for the root system Cr

Using multiple q-integrals and a determinant evaluation, we establish a nonterminating ₈φ₇ summation for the root system C_r. We also give some important specializations explicitly.     

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.     

On the completeness of the system of function {e sin λnx}n = 1

In this paper, the biorthogonal system corresponding to the system {e^−αnx sin nx}_{n = 1}^∞ is represented in an appropriate form so that it is possible to obtain sufficiently good estimates of its norm. Then, by the stability of a completeness property we prove that the system of functions {e^−αλ_nx sin λ_nx}_{n = 1}^∞ is complete.     

Computational analysis of supersonic turbulent boundary layers over rough surfaces using the k–ω and the stress–ω models

The influence of surface roughness in the prediction of the mean flow and turbulent properties of a high-speed supersonic (M = 2.7, Re/m = 2 × 10⁷) turbulent boundary layer flow over a flat plate is numerically investigated. In particular, the performance of the k–ω and stress–ω turbulence models is evaluated against the available experimental data. Even though the performance of these models have been proven satisfactory in the computation of incompressible boundary layer flow over rough surfaces, their validity for high-speed compressible has not been investigated yet. It is observed from this study that, for smooth surface, both k–ω and stress–ω models perform very well in predicting the mean flow and turbulence quantities in supersonic flow. For rough surfaces, both models matched the experimental data fairly well for lower roughness heights but performed unsatisfactorily for higher roughness conditions. Overall the performance of the k–ω model is better than the stress–ω model. The stress–ω model does not show any strong advantages to make up for the extra computational cost associated with it. The predictions indicate that the ω boundary conditions at the wall in both models, especially the stress–ω model, need to be refined and reconsidered to include the geometric factor for supersonic flow over surfaces with large roughness values.     

Monomial realization of crystal graphs for Uq(An(1))

We give a new realization of crystal graphs for irreducible highest weight modules over U_q(A_n⁽¹⁾) in terms of the monomials introduced by H. Nakajima. We also discuss the natural connection between the monomial realization and other known realizations, path realization and Young wall realization.This research was supported by KOSEF Grant # 98-0701-01-5-L and BK21 Mathematical Sciences Division, Seoul National University.     

On the distributions of the form ∑i (δpi−δni)

We present some properties of the distributions T of the form ∑_i (δ_pi−δ_ni), with ∑_i d(p_i,n_i)<∞, which arise in the study of the 3-d Ginzburg–Landau problem; see Bourgain et al. (C. R. Acad. Sci. Paris, Ser. I 331 (2000) 119–124). We show that there always exists an irreducible representation of T. We also extend a result of Smets (C. R. Acad. Sci. Paris, Ser. I 334 (2002) 371–374) which says that T is a measure iff T can be written as a finite sum of dipoles.     

Rate of Convergence for the Absolutely (C, α) Summable Fourier Series of Functions of Bounded Variation

A theorem of Bosanquet states that the Fourier series of a 2π-periodic function of bounded variation is absolutely (C, α) summable. In this paper we give a quantitative version of Bosanquet's result.     

Removable Singularities for Lu=Ψ(u) and Orlicz Capacities

Suppose L is a second order elliptic differential operator in ^d and let α>1. Baras and Pierre have proved in 1984 that Γ is removable for Lu=u^α if and only if its Bessel capacity Cap_2, α′(Γ)=0. We extend this result to a general equation Lu=Ψ(u) where Ψ(u) is an increasing convex function subject to Δ₂ and ₂ conditions. Namely, we prove that Γ is removable for Lu=Ψ(u) if and only if its Orlicz capacity is zero, that is, the integral ∫_B dx Ψ(∫_Γ |x−y|^2−d ν(dy)) is equal to 0 or ∞ for every measure ν concentrated on Γ, where B stands for any ball containing Γ.     

Some group actions on K(x 1 , x 2 , x 3 )

LetK be any field which may not be algebraically closed,K(x ₁ ,x ₂ ,x ₃ ) be the rational function field of three variables overK, and σ:K(x ₁ ,x ₂ ,x ₃ ) → K(x ₁ ,x ₂ ,x ₃ ) be aK-automorphism defined by wherea _i ,b _i ,c _i ,d _i ∈K anda _i d _i −b _i c _i ≠0. Let ,f _i (T)=T ² −(a _i +d _i )T+(a _i d _i −b _i c _i )∈K[T] be the “characteristic polynomial” of σ _i . Theorem:Assume that charK≠2.Then the fixed field K(x ₁ ,x ₂ ,x ₃ ) ^<σ> is not rational (=purely transcendental) over K if and only if (i) for each 1≤i≤3, f _i (T) is irreducible; (ii) the Galois group of f ₁ (T)f ₂ (T)f ₃ (T) over K is of order 8; and (iii) for each 1≤i≤3,ord (σ _[itn] )is an even integer.     

Circulant graphs with det(−A(G))=−deg(G): codeterminants with Kn

Circulant graphs satisfying det(−A(G))=−deg(G) are used to construct arbitrarily large families of graphs with determinant equal to that of the complete graph K_n.     

On Two-Graphs of Ovoids inO2n+ 1(q)

Moorhouse and Gunawardena [1] have shown that if the avoids in finite orthogonal spaces of typeO_{2n + 1}(q),qodd, exist then their two-graphs are regular. In this note, we present a new geometrical proof for the regularity of those two-graphs.