相关论文: The Main Diagonal of a Permutation Matrix

We propose a graph theoretic approach to determine trace of product of two permutation matrices through a weighted digraph representation of the permutation matrices. Consequently, we derive trace-zero doubly stochastic (DS) matrices of…

Finite dimensional matrices having more columns than rows have no left inverses while those having more rows than columns have no right inverses. We give generalizations of these simple facts to bi--infinite matrices and use those to obtain…

The binomial interpolated transform of a sequence is a generalization of the well-known binomial transform. We examine a Pascal-like triangle, on which a binomial interpolated transform works between the left and right diagonals, focusing…

The Casselman basis of Iwahori fixed vectors in a principal series representation of a p-adic group G is dual to the standard intertwining operators. To compute it one must compute a matrix m(u,v) indexed by pairs of Weyl group elements.…

A permutation of size $n$ can be identified to its diagram in which there is exactly one point per row and column in the grid $[n]^2$. In this paper we consider multidimensional permutations (or $d$-permutations), which are identified to…

A well-known result in random matrix theory, proven by Kahn, Koml\'os and Szemer\'edi in 1995, states that a square random matrix with i.i.d. uniform $\{\pm 1\}$ entries is invertible with probability $1-\exp(-\Omega(n))$. As a natural…

We provide a doubly exponential upper bound in $p$ on the size of forbidden pivot-minors for symmetric or skew-symmetric matrices over a fixed finite field $\mathbb{F}$ of linear rank-width at most $p$. As a corollary, we obtain a doubly…

The paper is devoted to multidimensional $(0,1)$-matrices extremal with respect to containing a polydiagonal (a fractional generalization of a diagonal). Every extremal matrix is a threshold matrix, i.e., an entry belongs to its support…

The investigation of width parameters in both graph and algebraic contexts has attracted considerable interest. Among these parameters, the linear branch width has emerged as a crucial measure. In this concise paper, we explore the concept…

We consider some random band matrices with band-width $N^\mu$ whose entries are independent random variables with distribution tail in $x^{-\alpha}$. We consider the largest eigenvalues and the associated eigenvectors and prove the…

For a division ring D, finite dimensional over its center F, we give a condiction for the connectedness of the commuting graph of a matrix ring over $D$. Furthermore, we prove that if the commuting graph is connected, then its diameter is…

Given a graph drawn in the plane, the degenerate crossing number of the drawing is the number of points in the plane which are contained in the relative interior of at least two edges, where each edge is required to be drawn as a simple…

The infinite upper triangular Pascal matrix is $T = [\binom{j}{i}]$ for $0\leq i,j$. It is easy to see that any leading principle square submatrix is triangular with determinant $1$, hence invertible. In this paper, we investigate the…

In this paper transformations for matrix orthogonal polynomials in the real line are studied. The orthogonality is understood in a broad sense, and is given in terms of a nondegenerate continuous sesquilinear form, which in turn is…

This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…

The main goal of the paper is to establish the existence of tensor product decompositions for those prime ideals P of the generic algebra A of quantum n by n matrices which are invariant under winding automorphisms of A. More specifically,…

Dantzig-Wolfe decomposition (DWD) is a classical algorithm for solving large-scale linear programs whose constraint matrix involves a set of independent blocks coupled with a set of linking rows. The algorithm decomposes such a model into a…

We consider the convergence of the ESD for non-Hermitian random band matrices with independent entries to the circular law, which is the uniform measure on the unit disk in the center of the complex plane. We assume that the bandwidth of…

We study largest singular values of large random matrices, each with mean of a fixed rank $K$. Our main result is a limit theorem as the number of rows and columns approach infinity, while their ratio approaches a positive constant. It…

Any associative bilinear multiplication on the set of n-by-n matrices over some field of characteristic not two, that makes the same vectors orthogonal and has the same trace as ordinary matrix multiplication, must be ordinary matrix…