The influence function of the TCLUST robust clustering procedure

The TCLUST procedure performs robust clustering with the aim of finding clusters with different scatter structures and weights. An Eigenvalues Ratio constraint is considered by TCLUST in order to achieve a wide range of clustering alternatives depending on the allowed differences among cluster scatter matrices. Moreover, this constraint avoids finding uninteresting spurious clusters. In order to guarantee the robustness of the method against the presence of outliers and background noise, the method allows for trimming of a given proportion of observations self-determined by the data. Based on this “impartial trimming”, the procedure is assumed to have good robustness properties. As it was done for the trimmed k-means method, this article studies robustness properties of the TCLUST procedure in the univariate case with two clusters by means of the influence function. The conclusion is that the TCLUST has a robustness behavior close to that of the trimmed k-means in spite of the fact that it addresses a more general clustering approach.     

Automorphisms of higher‐dimensional Hadamard matrices

This article derives from first principles a definition of equivalence for higher‐dimensional Hadamard matrices and thereby a definition of the automorphism group for higher‐dimensional Hadamard matrices. Our procedure is quite general and could be applied to other kinds of designs for which there are no established definitions for equivalence or automorphism. Given a two‐dimensional Hadamard matrix H of order ν, there is a Product Construction which gives an order ν proper n‐dimensional Hadamard matrix P⁽ⁿ⁾(H). We apply our ideas to the matrices P⁽ⁿ⁾(H). We prove that there is a constant c > 1 such that any Hadamard matrix H of order ν > 2 gives rise via the Product Construction to cν inequivalent proper three‐dimensional Hadamard matrices of order ν. This corrects an erroneous assertion made in the literature that ”P⁽ⁿ⁾(H) is equivalent to “P⁽ⁿ⁾(H′) whenever H is equivalent to H′.” We also show how the automorphism group of P⁽ⁿ⁾(H) depends on the structure of the automorphism group of H. As an application of the above ideas, we determine the automorphism group of P⁽ⁿ⁾(Hk) when Hk is a Sylvester Hadamard matrix of order 2^k. For ν = 4, we exhibit three distinct families of inequivalent Product Construction matrices P⁽ⁿ⁾(H) where H is equivalent to H₂. These matrices each have large but non‐isomorphic automorphism groups. © 2008 Wiley Periodicals, Inc. J Combin Designs 16: 507–544, 2008     

On monomialk-Buchsbaum curves inP r

This paper is deveted to the study of projective monomialk-Buchsbaum curves C. First, using the theory of affine semigroup rings, we give a criterion forC to bek-Buchsbaum. Then we give some lower and upper bounds for the numberk _c such thatC is strictlyk _c-Buchsbaum. For some classes of monomial curves we can computek _C explicity.     

The number of infinite clusters in dynamical percolation

Summary. Dynamical percolation is a Markov process on the space of subgraphs of a given graph, that has the usual percolation measure as its stationary distribution. In previous work with O. H?ggstr?m, we found conditions for existence of infinite clusters at exceptional times. Here we show that for ℤ ^d , with p>p _c , a.s. simultaneously for all times there is a unique infinite cluster, and the density of this cluster is θ(p). For dynamical percolation on a general tree Γ, we show that for p>p _c , a.s. there are infinitely many infinite clusters at all times. At the critical value p=p _c , the number of infinite clusters may vary, and exhibits surprisingly rich behaviour. For spherically symmetric trees, we find the Hausdorff dimension of the set T ^k of times where the number of infinite clusters is k, and obtain sharp capacity criteria for a given time set to intersect T ^k . The proof of this capacity criterion is based on a new kernel truncation technique. Received: 5 May 1997 / In revised form: 24 November 1997     

The centro-invertible matrix: A new type of matrix arising in pseudo-random number generation

This paper defines a new type of matrix (which will be called a centro-invertible matrix) with the property that the inverse can be found by simply rotating all the elements of the matrix through 180 degrees about the mid-point of the matrix. Centro-invertible matrices have been demonstrated in a previous paper to arise in the analysis of a particular algorithm used for the generation of uniformly-distributed pseudo-random numbers.An involutory matrix is one for which the square of the matrix is equal to the identity. It is shown that there is a one-to-one correspondence between the centro-invertible matrices and the involutory matrices. When working in modular arithmetic this result allows all possible k by k centro-invertible matrices with integer entries modulo M to be enumerated by drawing on existing theoretical results for involutory matrices.Consider the k by k matrices over the integers modulo M. If M takes any specified finite integer value greater than or equal to two then there are only a finite number of such matrices and it is valid to consider the likelihood of such a matrix arising by chance. It is possible to derive both exact expressions and order-of-magnitude estimates for the number of k by k centro-invertible matrices that exist over the integers modulo M. It is shown that order (√N) of the N=M^(k2) different k by k matrices modulo M are centro-invertible, so that the proportion of these matrices that are centro-invertible is order (1/√N).     

Heuristic Algorithms and Scatter Search for the Cardinality Constrained P||Cmax Problem

We consider the generalization of the classical P||C_max problem (assign n jobs to m identical parallel processors by minimizing the makespan) arising when the number of jobs that can be assigned to each processor cannot exceed a given integer k. The problem is strongly NP-hard for any fixed k > 2. We briefly survey lower and upper bounds from the literature. We introduce greedy heuristics, local search and a scatter search approach. The effectiveness of these approaches is evaluated through extensive computational comparison with a depth-first branch-and-bound algorithm that includes new lower bounds and dominance criteria.     

A. translation of J. X. Lu's “an existence theory for resolvable balanced incomplete block designs”

In 1984, J. X. Lu proved the following statement. Given any k and λ, there exists a constant c(k, λ) such that an RB[v,k,λ] exists for all v > c(k,λ) satisfying the usual necessary conditions. Lu's paper was written in Chinese and, unfortunately, its accessibility is limited. We have translated Lu's paper into English and have also given a new interpretation of his constructions for resolvable block designs. © 1995 John Wiley & Sons, Inc.     

<Emphasis Type="Italic">k</Emphasis>-Idempotency of linear combinations of an idempotent matrix and a tripotent matrix that commute

A complete solution is established to the problem of characterizing all situations in which a linear combination C = c ₁ A+c ₂ B of an idempotent matrix A and a tripotent matrix B is k-idempotent. As a special case of this, a set of necessary and sufficient conditions for a linear combination C = c ₁ A+c ₂ B to be k-idempotent when A and B are idempotent matrices, is also studied in this paper.     

A Global Optimization RLT-based Approach for Solving the Hard Clustering Problem

The field of cluster analysis is primarily concerned with the sorting of data points into different clusters so as to optimize a certain criterion. Rapid advances in technology have made it possible to address clustering problems via optimization theory. In this paper, we present a global optimization algorithm to solve the hard clustering problem, where each data point is to be assigned to exactly one cluster. The hard clustering problem is formulated as a nonlinear program, for which a tight linear programming relaxation is constructed via the Reformulation-Linearization Technique (RLT) in concert with additional valid inequalities that serve to defeat the inherent symmetry in the problem. This construct is embedded within a specialized branch-and-bound algorithm to solve the problem to global optimality. Pertinent implementation issues that can enhance the efficiency of the branch-and-bound algorithm are also discussed. Computational experience is reported using several standard data sets found in the literature as well as using synthetically generated larger problem instances. The results validate the robustness of the proposed algorithmic procedure and exhibit its dominance over the popular k-means clustering technique. Finally, a heuristic procedure to obtain a good quality solution at a relative ease of computational effort is also described.     

On the uniform approximation property in Banach spaces

We derive a criterion for a Banach space to fail the uniform approximation property (UAP). This criterion is applied to prove thatc _p spaces of matrices fail UAP ifp>80.     

Nonsingularity and group invertibility of linear combinations of two k-potent matrices

An n × n complex matrix A is said to be k-potent if A ^k = A. Let T ₁ and T ₂ be k-potent and c ₁ and c ₂ be two nonzero complex numbers. We study the range space, null space, nonsingularity and group invertibility of linear combinations T = c ₁ T ₁ + c ₂ T ₂ of two k-potent matrices T ₁ and T ₂.     

A sign test for detecting the equivalence of Sylvester Hadamard matrices

In this paper we show that every matrix in the class of Sylvester Hadamard matrices of order 2 ^k under H-equivalence can have full row and column sign spectrum, meaning that tabulating the numbers of sign interchanges along any row (or column) gives all integers 0,1,...,2 ^k  − 1 in some order. The construction and properties of Yates Hadamard matrices are presented and is established their equivalence with the Sylvester Hadamard matrices of the same order. Finally, is proved that every normalized Hadamard matrix has full column or row sign spectrum if and only if is H-equivalent to a Sylvester Hadamard matrix. This provides us with an efficient criterion identifying the equivalence of Sylvester Hadamard matrices.     

Ramsey theory for graph connectivity

r_c(k) Denotes the smallest integer such that any c-edge-coloring of the r_c(k) vertex complete graph has a monochromatic k-connected subgraph. For any c, k ≧ 2, we show 2c(k – 1) + 1 ≦ r_c(k) < 10/3 c(k – 1) + 1, and further that 4(k – 1) + 1 ≧ r₂(k) < (3 + √ (k – 1) + 1. Some exact values for various Ramsey connectivity numbers are also computed.     

The Hardness of 3-Uniform Hypergraph Coloring

We prove that coloring a 3-uniform 2-colorable hypergraph with c colors is NP-hard for any constant c. The best known algorithm [20] colors such a graph using O(n^1/5) colors. Our result immediately implies that for any constants k ≥ 3 and c₂ > c₁ > 1, coloring a k-uniform c₁-colorable hypergraph with c₂ colors is NP-hard; the case k = 2, however, remains wide open. This is the first hardness result for approximately-coloring a 3-uniform hypergraph that is colorable with a constant number of colors. For k ≥ 4 such a result has been shown by [14], who also discussed the inherent difference between the k = 3 case and k ≥ 4. Our proof presents a new connection between the Long-Code and the Kneser graph, and relies on the high chromatic numbers of the Kneser graph [19,22] and the Schrijver graph [26]. We prove a certain maximization variant of the Kneser conjecture, namely that any coloring of the Kneser graph by fewer colors than its chromatic number, has ‘many’ non-monochromatic edges. * Research supported by NSF grant CCR-9987845. † Supported by an Alon Fellowship and by NSF grant CCR-9987845. ‡ Work supported in part by NSF grants CCF-9988526 and DMS 9729992, and the State of New Jersery.     

On the representability of totally unimodular matrices on bidirected graphs

We present a polynomial time algorithm to construct a bidirected graph for any totally unimodular matrix B by finding node-edge incidence matrices Q and S such that QB=S. Seymour’s famous decomposition theorem for regular matroids states that any totally unimodular (TU) matrix can be constructed through a series of composition operations called k-sums starting from network matrices and their transposes and two compact representation matrices B₁,B₂ of a certain ten element matroid. Given that B₁,B₂ are binet matrices we examine the k-sums of network and binet matrices. It is shown that thek-sum of a network and a binet matrix is a binet matrix, but binet matrices are not closed under this operation for k=2,3. A new class of matrices is introduced, the so-called tour matrices, which generalise network, binet and totally unimodular matrices. For any such matrix there exists a bidirected graph such that the columns represent a collection of closed tours in the graph. It is shown that tour matrices are closed under k-sums, as well as under pivoting and other elementary operations on their rows and columns. Given the constructive proofs of the above results regarding the k-sum operation and existing recognition algorithms for network and binet matrices, an algorithm is presented which constructs a bidirected graph for any TU matrix.     

Alternating Hamiltonian cycles

Colour the edges of a complete graph withn vertices in such a way that no vertex is on more thank edges of the same colour. We prove that for everyk there is a constantc _ksuch that ifn>c _kthen there is a Hamiltonian cycle with adjacent edges having different colours. We prove a number of other results in the same vein and mention some unsolved problems.     

H-矩阵和S-双对角占优矩阵

In this paper, the concept of the s-doubly diagonally dominant matrices is introduced and the properties of these matrices are discussed. With the properties of the s-doubly diagonally dominant matrices and the properties of comparison matrices, some equivalent conditions for H-matrices are presented. These conditions generalize and improve existing results about the equivalent conditions for H-matrices. Applications and examples using these new equivalent conditions are also presented, and a new inclusion region of k-multiple eigenvalues of matrices is obtained.     

Clustering of contingency table and mixture model

Basing cluster analysis on mixture models has become a classical and powerful approach. It enables some classical criteria such as the well-known k-means criterion to be explained. To classify the rows or the columns of a contingency table, an adapted version of k-means known as Mndki2, which uses the chi-square distance, can be used. Unfortunately, this simple, effective method which can be used jointly with correspondence analysis based on the same representation of the data, cannot be associated with a mixture model in the same way as the classical k-means algorithm. In this paper we show that the Mndki2 algorithm can be viewed as an approximation of a classifying version of the EM algorithm for a mixture of multinomial distributions. A comparison of the algorithms belonging in this context are experimentally investigated using Monte Carlo simulations.     

The Minimum Rank of a 3 × 3 Partial Block Matrix

After recalling the definition and some basic properties of finite hypergroups—a notion introduced in a recent paper by one of the authors—several non-trivial examples of such hypergroups are constructed. The examples typically consist of n n×n matrices, each of which is an appropriate polynomial in a certain tri-diagonal matrix. The crucial result required in the construction is the following: ‘let A be the matrix with ones on the super-and sub-diagonals, and with main diagonal given by a ₁…a _n which are non-negative integers that form either a non-decreasing or a symmetric unimodal sequence; then A_k =P_k (A) is a non-negative matrix, where p_k denotes the characteristic polynomial of the top k× k principal submatrix of A, for k=1,…,n. The matrices A_k as well as the eigenvalues of A, are explicitly described in some special cases, such as (i) a_i =0 for all ior (ii) a_i =0 for i<n and a_n =1. Characters ot finite abelian hypergroups are defined, and that naturally leads to harmonic analysis on such hypergroups.