Approximation of signals of class Lip(α, p) by linear operators

Mittal, Rhoades [5], [6], [7] and [8] and Mittal et al. [9] and [10] have initiated a study of error estimates E_n(f) through trigonometric-Fourier approximation (tfa) for the situations in which the summability matrix T does not have monotone rows. In this paper we continue the work. Here we extend two theorems of Leindler [4], where he has weakened the conditions on {p_n} given by Chandra [2], to more general classes of triangular matrix methods. Our Theorem also partially generalizes Theorem 4 of Mittal et al. [11] by dropping the monotonicity on the elements of matrix rows, which in turn generalize the results of Quade [15].     

Characterizations of EP matrices and weighted-EP matrices

A square complex matrix A is said to be EP if A and its conjugate transpose A^∗ have the same range. In this paper, we first collect a group of known characterizations of EP matrix, and give some new characterizations of EP matrices. Then, we define weighted-EP matrix, and present a wealth of characterizations for weighted-EP matrix through various rank formulas for matrices and their generalized inverses.     

The scrambling index of symmetric primitive matrices

A nonnegative square matrix A is primitive if some power A^k>0 (that is, A^k is entrywise positive). The least such k is called the exponent of A. In [2], Akelbek and Kirkland defined the scrambling index of a primitive matrix A, which is the smallest positive integer k such that any two rows of A^k have at least one positive element in a coincident position. In this paper, we give a relation between the scrambling index and the exponent for symmetric primitive matrices, and determine the scrambling index set for the class of symmetric primitive matrices. We also characterize completely the symmetric primitive matrices in this class such that the scrambling index is equal to the maximum value.     

On zero-pattern invariant properties of structured matrices

It is interesting that inverse M-matrices are zero-pattern (power) invariant. The main contribution of the present work is that we characterize some structured matrices that are zero-pattern (power) invariant. Consequently, we provide necessary and sufficient conditions for these structured matrices to be inverse M-matrices. In particular, to check if a given circulant or symmetric Toeplitz matrix is an inverse M-matrix, we only need to consider its pattern structure and verify that one of its principal submatrices is an inverse M-matrix.     

Monotone versions of δ-normality

According to Mack a space is countably paracompact if and only if its product with [0,1] is δ-normal, i.e. any two disjoint closed sets, one of which is a regular Gδ-set, can be separated. In studying monotone versions of countable paracompactness, one is naturally led to consider various monotone versions of δ-normality. Such properties are the subject of this paper. We look at how these properties relate to each other and prove a number of results about them, in particular, we provide a factorization of monotone normality in terms of monotone δ-normality and a weak property that holds in monotonically normal spaces and in first countable Tychonoff spaces. We also discuss the productivity of these properties with a compact metrizable space.     

One-dimensional geometric random graphs with nonvanishing densities II: a very strong zero-one law for connectivity

We consider a collection of n independent points which are distributed on the unit interval [0,1] according to some probability distribution function F. Two nodes communicate with each other if their distance is less than some given threshold value. When F admits a density f which is strictly positive on [0,1], we give conditions on f under which the property of graph connectivity for the induced geometric random graph obeys a very strong zero–one law when the transmission range is scaled appropriately with n large. The very strong critical threshold is identified. This is done by applying a version of the method of first and second moments.     

On chaotic graphs and applications in physics and biology

El Naschie’s ε^∞ theory in Quantum space time is given and discussed geometrically and topologically as a category of fuzzy spaces, these fuzzy categories in which lines are fuzzy fractal lines. In this paper, we represent the chaotic graphs as many fuzzy fractal lines up to ∞. We will describe them by chaotic matrices. Many fuzzy systems (chaotic systems) are described and applied in [8], [9], [10], [11], [12]. This article introduces some operations on the chaotic graphs such as the union and the intersection; also both of the chaotic incidence matrices and the chaotic adjacency matrices representing the chaotic graphs induced from these operations will be studied. Theorems governing these studies are obtained. Some applications on chaotic graphs are given [18], [19], [20], [21].     

Double σ-multiplicative matrices

The class of σ-regular matrices was defined and characterized by Schaefer [P. Schaefer, Infinite matrices and invariant means, Proc. Amer. Math. Soc. 36 (1972) 104-110] and further studied by Mursaleen [Mursaleen, On some new invariant matrix methods of summability, Quart. J. Math. Oxford 34 (1983) 77-86], Ahmad and Mursaleen [Z.U. Ahmad, Mursaleen, An application of Banach limits, Proc. Amer. Math. Soc. 103 (1988) 244-246]. In this paper we characterize four-dimensional σ-multiplicative matrices, and establish a core theorem.     

An operator formula for the number of halved monotone triangles with prescribed bottom row

Monotone triangles are certain triangular arrays of integers, which correspond to n×n alternating sign matrices when prescribing (1,2,…,n) as bottom row of the monotone triangle. In this article we define halved monotone triangles, a specialization of which correspond to vertically symmetric alternating sign matrices. We derive an operator formula for the number of halved monotone triangles with prescribed bottom row which is analogous to our operator formula for the number of ordinary monotone triangles [I. Fischer, The number of monotone triangles with prescribed bottom row, Adv. in Appl. Math. 37 (2) (2006) 249-267].     

A kind of nonnegative matrices and its application on the stability of discrete dynamical systems

In this paper we introduce a new kind of nonnegative matrices which is called (sp) matrices. We show that the zero solutions of a class of linear discrete dynamical systems are asymptotically stable if and only if the coefficient matrices are (sp) matrices. To determine that a matrix is (sp) matrix or not is very simple, we need only to verify that some elements of the coefficient matrices are zero or not. According to the result above, we obtain the conditions for the stability of several classes of discrete dynamical systems.     

Exact Matrix Completion via Convex Optimization

We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at random from a matrix M. Can we complete the matrix and recover the entries that we have not seen? We show that one can perfectly recover most low-rank matrices from what appears to be an incomplete set of entries. We prove that if the number m of sampled entries obeys $m\ge C\,n^{1.2}r\log n$ for some positive numerical constant C, then with very high probability, most n×n matrices of rank r can be perfectly recovered by solving a simple convex optimization program. This program finds the matrix with minimum nuclear norm that fits the data. The condition above assumes that the rank is not too large. However, if one replaces the 1.2 exponent with 1.25, then the result holds for all values of the rank. Similar results hold for arbitrary rectangular matrices as well. Our results are connected with the recent literature on compressed sensing, and show that objects other than signals and images can be perfectly reconstructed from very limited information.     

Nowhere monotone functions and microscopic sets

We investigate how large a set can be on which a continuous nowhere monotone function is one-to-one. We consider the σ-ideal of microscopic sets, which is situated between the countable sets and the sets of Hausdorff dimension zero and prove that the typical function in C[0, 1] (in the sense of Baire) is nowhere monotone and one-to-one except on some microscopic set. We also give an example of a continuous nowhere monotone function of bounded variation on [0, 1], which is one-to-one except on some microscopic set, so it is not a typical function.      

A NEW ITERATIVE METHOD FOR FINDING COMMON SOLUTIONS OF GENERALIZED EQUILIBRIUM PROBLEM, FIXED POINT PROBLEM OF INFINITE k-STRICT PSEUDO-CONTRACTIVE MAPPINGS, AND QUASI-VARIATIONAL INCLUSION PROBLEM

In this article,we introduce a hybrid iterative scheme for finding a common element of the set of solutions for a generalized equilibrium problems,the set of common fixed point for a family of infinite...     

Circular representation problem on hypergraphs

A hypergraph J=(X,E) is said to be circular representable, if its vertices can be placed on a circle, in such way that every edge of H induces an interval. This concept is a translation into the vocabulary of hypergraphs of the circular one's property for the (0, 1) matrices [6] studied by Tucker [9, 10]. We give here a characterization of the hypergraphs which are circular representable. We study when the associated representation is unique, and we characterize the possible transformations of a representation into another, a kind of problem which has already been treated from the algorithmic point of view by Booth and Lueker [1] or Duchet [2] in the case of the interval representable hypergraphs.Finally, we establish a connection between circular graphs and circular representable hypergraphs of the type of the Fulkerson-Gross connection between interval graphs and matrices having the consecutive one's property [5], in some special cases.     

Clustering Methods in Microarrays

Summary DCT Given a finite set of points in an Euclidean space the \emph{spanning tree} is a tree of minimal length having the given points as vertices. The length of the tree is the sum of the distances of all connected point pairs of the tree. The clustering tree with a given length of a given finite set of points is the spanning tree of an appropriately chosen other set of points approximating the given set of points with minimal sum of square distances among all spanning trees with the given length. DCM A matrix of real numbers is said to be column monotone orderable if there exists an ordering of columns of the matrix such that all rows of the matrix become monotone after ordering. The {\emph{monotone sum of squares of a matrix}} is the minimum of sum of squares of differences of the elements of the matrix and a column monotone orderable matrix where the minimum is taken on the set of all column monotone orderable matrices. Decomposition clusters of monotone orderings of a matrix is a clustering ofthe rows of the matrix into given number of clusters such that thesum of monotone sum of squares of the matrices formed by the rowsof the same cluster is minimal.DCP A matrix of real numbers is said to be column partitionable if there exists a partition of the columns such that the elements belonging to the same subset of the partition are equal in each row. Given a partition of the columns of a matrix the partition sum of squares of the matrix is the minimum of the sum of square of differences of the elements of the matrix and a column partitionable matrix where the minimum is taken on the set of all column partitionable matrices. Decomposition of the rows of a matrix into clusters of partitions is the minimization of the corresponding partition sum of squares given the number of clusters and the sizes of the subsets of the partitions.     

A note on properties of splittings of singular symmetric positive semidefinite matrices

Summary. Recently, Benzi and Szyld have published an important paper [1] concerning the existence and uniqueness of splittings for singular matrices. However, the assertion in Theorem 3.9 on the inheriting property of P-regular splitting for singular symmetric positive semidefinite matrices seems to be incorrect. As a complement of paper [1], in this short note we point out that if a matrix T is resulted from a P-regular splitting of a symmetric positive semidefinite matrix A, then splittings induced by T are not all P-regular. Received January 7, 1999 / Published online December 19, 2000     

On some sets of permutation matrices

In [5], a class Σ of p×p circulant matrices was studied where p is a prime, and necessary and sufficient conditions were presented for the matrices in Σ to be commutative and to be closed with respect to matrix multiplication. Here we show that these properties also hold for n×n circulant matrices, where n is a positive integer, with an additional condition, namely, Σ contains an n-cycle.     

A metric variant of Frobenius's theorem and some other remarks on positive matrices

The theory of positive (=nonnegative) finite square matrices continues, three quarters of a century after the pioneering and well-known papers of Perron and Frobenius [4], to present a multitude of different aspects. This is evidenced, for example, by the recent papers [1] and [2], as well as by the vast literature concerned with extensions to operators on infinite dimensional spaces (see [5]). Supposing A to be a positive n × n matrix with spectral radius r(A) = 1, the main purpose of this note is to display the role of λ = 1 as a root of the minimal polynomial of A (or equivalently, of certain norm conditions on A, for the lattice structure of the space M spanned by the unimodular eigenvectors of A as well as for the permutational character of A on M. Proposition 1 can thus be viewed as a variant of Frobenius's theorem on the peripheral spectrum of indecomposable square matrices, and we hope that the proof of Proposition 2 will clarify to what extent indecomposability is responsible for the main results available in that special case. The remaining remarks (Propositions 3 and 4) are concerned with the spectral characterization of permutation matrices and with finite groups of positive matrices. Some of that material is undoubtedly known, but we give simple, transparent proofs.     

On cone orderings and the linear complementarity problem

This paper first generalizes a characterization of polyhedral sets having least elements, which is obtained by Cottle and Veinott [6], to the situation in which Euclidean space is partially ordered by some general cone ordering (rather than the usual ordering). We then use this generalization to establish the following characterization of the class $\text{C}$ of matrices ($\text{C}$ arises as a generalization of the class of Z-matrices; see [4], [13], [14]): M∈$\text{C}$ if and only if for every vector q for which the linear complementarity problem (q,M) is feasible, the problem (q,M) has a solution which is the least element of the feasible set of (q,M) with respect to a cone ordering induced by some simplicial cone. This latter result generalizes the characterizations of K-and Z-matrices obtained by Cottle and Veinott [6] and Tamir [21], respectively.