In this study, we give a characterization of all torsion units which are in the unit group of ZS3 integral group ring of symmetric group S3, and classify conjugate classes of these units. We used the group of all doubly stochastic matrices in GL(3,Z) in this classification. The investigation of torsion units is not restricted with this study, and the classification of torsion units of bigger or...

A conditional spatial autoregression (CAR) specifies dependence via a weight matrix. Employing a doubly stochastic weight matrix allows users to interpret the CAR prediction rule as a semiparametric prediction rule and as BLUP with smoothing in addition to other benefits. We examine standard and doubly stochastic weight matrices in the context of an illustrative data set to demonstrate feasibil...

Some special subsets of the set of uniformly tapered doubly stochastic matrices are considered. It is proved that each such subset is a convex polytope and its extreme points are determined. A minimality result for the whole set of uniformly tapered doubly stochastic matrices is also given. It is well known that if x and y are nonnegative vectors of R and x is weakly majorized by y, there exist...

This paper defines Structured Markovian Arrival Processes (SMAPs). An SMAP consists of several blocks each being represented by a random variable specifying the duration of staying in that block. Leaving a block indicates an arrival event of the SMAP. The routing between blocks is governed by a stochastic matrix Q. It is shown that the joint moments of the SMAP can be directly determined from t...

Design matrices are sparse matrices in which the supports of different columns intersect in a few positions. Such matrices come up naturally when studying problems involving point sets with many collinear triples. In this work we consider design matrices with block (or matrix) entries. Our main result is a lower bound on the rank of such matrices, extending the bounds proven in [BDWY12, DSW14] ...

We generalize in various directions a result of Friedland and Karlin on a lower bound for the spectral radius of a matrix that is positively diagonally equivalent to a • The research of these authors was supported by their joint grant No. 90-00434 from the United States-Israel Binational Science Foundation, Jerusalem, Israel. t The research of this author was supported in part by NSF Grant DMS-...

We give an algorithm for learning a permutation on-line. The algorithm maintains its uncertainty about the target permutation as a doubly stochastic matrix. This matrix is updated by multiplying the current matrix entries by exponential factors which destroy the doubly stochastic property of the matrix, and an iterative procedure is needed to renormalize the rows and columns. Even though the re...