On k -diameter of k -connected graphs

Let G be a k-connected simple graph with order n. The k-diameter, combining connectivity with diameter, of G is the minimum integer d _k (G) for which between any two vertices in G there are at least k internally vertex-disjoint paths of length at most d _k (G). For a fixed positive integer d, some conditions to insure d _k (G)⩽d are given in this paper. In particular, if d⩾3 and the sum of degrees of any s (s=2 or 3) nonadjacent vertices is at least n+(s−1)k+1−d, then d _k (G)⩽d. Furthermore, these conditions are sharp and the upper bound d of k-diameter is best possible. Supported by NNSF of China (19971086).     

(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 the largest kth eigenvalues of trees with n≡0 (mod k)

We consider the only remaining unsolved case n≡0 (mod k) for the largest kth eigenvalue of trees with n vertices. In 1995, Jia-yu Shao gave complete solutions for the cases k=2,3,4,5,6 and provided some necessary conditions for extremal trees in general cases (cf. [Linear Algebra Appl. 221 (1995) 131]). We further improve Shao's necessary condition in this paper, which can be seen as the continuation of [Linear Algebra Appl. 221 (1995) 131].     

Existence of solutions to (k, n − k − 2) discrete boundary value problems

We provide general existence criteria to solutions for a class of higher-order discrete boundary value problems. Our results supplement as well as improve several recent results established in the literature.     

Point Sets with Many k -Sets

For any n , k , n\geq 2k>0 , we construct a set of n points in the plane with k -sets. This improves the bounds of Erdős, Lovász, et al. As a consequence, we also improve the lower bound for the number of halving hyperplanes in higher dimensions. Received September 10, 1999, and in revised form January 27, 2000.     

On uniform k-partition problems

We study various uniform k-partition problems which consist in partitioning m sets, each of cardinality k, into k sets of cardinality m such that each of these sets contains exactly one element from every original set. The problems differ according to the particular measure of “set uniformity” to be optimized. Most problems are polynomial and corresponding solution algorithms are provided. A few of them are proved to be NP-hard. Examples of applications to scheduling and routing problems are also discussed.     

On the Fibonacci k-numbers

We introduce a general Fibonacci sequence that generalizes, between others, both the classic Fibonacci sequence and the Pell sequence. These general kth Fibonacci numbers were found by studying the recursive application of two geometrical transformations used in the well-known four-triangle longest-edge (4TLE) partition. Many properties of these numbers are deduce directly from elementary matrix algebra.     

From Rectangular Bands to k -Primal Algebras

\noindent We begin by giving a new proof that every finite rectangular band is naturally dualisable. Motivated by the dualising structure arising from this proof, we call an algebra k-primal if it is (isomorphic to) a product of k independent primal algebras. For each k \geq 2 we exhibit a strong duality between the quasi-variety generated by a k -primal algebra and the topological quasi-variety \lilcat D _k of Boolean topological k -dimensional diagonal algebras. The category \lilcat D ₂ is the category of compact, totally disconnected rectangular bands. This duality extends Hu's duality for varieties generated by a primal algebra to the k -dimensional case. We find that Hu's ``uniqueness principle' for such varieties also extends to the k -dimensional case, namely, we show that a quasi-variety is equivalent as a category to the quasi-variety generated by a k -primal algebra if and only if it is itself generated by a k -primal algebra. June 18, 1999     

Size of k-uniform hypergraph with diameter d

In this paper, we estimate the size of k-uniform hypergraph with diameter d, and give its minimum and maximum.     

Maximum planar sets that determine k distances

Maximum planar sets that determine k distances are identified for k 5. Evidence is presented for the conjecture that all maximum sets for k 7 are subsets of the triangular lattice.     

Order restricted inference for sequential k-out-of-n systems

Sequential order statistics have been introduced to model sequential k-out-of-n systems which, as an extension of k-out-of-n systems, allow the failure of some components of the system to influence the remaining ones. Based on an independent sample of vectors of sequential order statistics, the maximum likelihood estimators of the model parameters of a sequential k-out-of-n system are derived under order restrictions. Special attention is paid to the simultaneous maximum likelihood estimation of the model parameters and the distribution parameters for a flexible location-scale family. Furthermore, order restricted hypothesis tests are considered for making the decision whether the usual k-out-of-n model or the general sequential k-out-of-n model is appropriate for a given data.     

Faster algorithms for string matching with k mismatches

The string matching with mismatches problem is that of finding the number of mismatches between a pattern P of length m and every length m substring of the text T. Currently, the fastest algorithms for this problem are the following. The Galil–Giancarlo algorithm finds all locations where the pattern has at most k errors (where k is part of the input) in time O(nk). The Abrahamson algorithm finds the number of mismatches at every location in time . We present an algorithm that is faster than both. Our algorithm finds all locations where the pattern has at most k errors in time . We also show an algorithm that solves the above problem in time O((n+(nk³)/m)logk).     

The k Most Frequent Distances in the Plane

Abstract. A new upper bound is shown for the number of incidences between n points and n families of concentric circles in the plane. As a consequence, it is shown that the number of the k most frequent distances among n points in the plane is f _n (k)=O(n ^1.4571 k ^.6286 ) improving on an earlier bound of Akutsu, Tamaki, and Tokuyama.     

On minimum k-modal partitions of permutations

Partitioning a permutation into a minimum number of monotone subsequences is -hard. We extend this complexity result to minimum partitioning into k-modal subsequences; here unimodal is the special case k=1. Based on a network flow interpretation we formulate both, the monotone and the k-modal version, as mixed integer programs. This is the first proposal to obtain provably optimal partitions of permutations. LP rounding gives a 2-approximation for minimum monotone partitions and a (k+1)-approximation for minimum (upper) k-modal partitions. For the online problem, in which the permutation becomes known to an algorithm sequentially, we derive a logarithmic lower bound on the competitive ratio for minimum monotone partitions, and we analyze two (bin packing) online algorithms. These immediately apply to online cocoloring of permutation graphs.     

Covering vertices of a graph by k disjoint cycles

Let d, k and n be three integers with k3, d4k−1 and n3k. We show that if d(x)+d(y)d for each pair of nonadjacent vertices x and y of a graph G of order n, then G contains k vertex-disjoint cycles converting at least min{d,n} vertices of G.     

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.     

On the k-error linear complexity of sequences with period 2pn over GF(q)

In this paper, we first optimize the structure of the Wei–Xiao–Chen algorithm for the linear complexity of sequences over GF(q) with period N =  2p ⁿ , where p and q are odd primes, and q is a primitive root modulo p ². The second, an union cost is proposed, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2p ⁿ over GF(q) is derived, where p and q are odd primes, and q is a primitive root modulo p ². The third, we give a validity of the proposed algorithm, and also prove that there exists an error sequence e ^N , where the Hamming weight of e ^N is not greater than k, such that the linear complexity of (s + e) ^N reaches the k-error linear complexity c. We also present a numerical example to illustrate the algorithm. Finally, we present the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.     

On k-primitivity of two classes of digraphs

In this paper, we study two classes of primitive digraphs, and show that there are k-colorings that are k-primitive.     

Sperner systems containing at most k sets of every cardinality

We prove using a direct construction that one can choose n − 2 subsets of an n-element set with different cardinality such that none of them contains any other. As a generalization, we prove that if for any j we can have at most k subsets containing exactly j elements (k> 1), then for n 5 we can choose at most k(n − 3) subsets from an n-element set such that they form a Sperner system. Moreover, we prove that this can be achieved if n is large enough, and give a construction for n 8k − 4.