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

We consider $N\times N$ random matrices of the form $H = W + V$ where $W$ is a real symmetric Wigner matrix and $V$ a random or deterministic, real, diagonal matrix whose entries are independent of $W$. We assume subexponential decay for…

The forbidden number $\mathrm{forb}(m,F)$, which denotes the maximum number of unique columns in an $m$-rowed $(0,1)$-matrix with no submatrix that is a row and column permutation of $F$, has been widely studied in extremal set theory.…

We prove that the principal pivot transform (also known as the partial inverse, sweep operator, or exchange operator in various contexts) maps matrices with positive imaginary part to matrices with positive imaginary part. We show that the…

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

Denote by $w(T)$ the numerical radius of a matrix $T$. An elementary proof is given to the fact that $w(AB) \leq w(A)w(B)$ for a pair of commuting matrices of order two, and characterization is given for the matrix pairs that attain the…

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…

We consider 1d random Hermitian $N\times N$ block band matrices consisting of $W\times W$ random Gaussian blocks (parametrized by $j,k \in\Lambda=[1,n]\cap \mathbb{Z}$, $N=nW$) with a fixed entry's variance…

Every element $w$ in the commutator subgroup of the free group $\mathbb{F}_2$ of rank 2 determines a closed curve in the grid $\mathbb{Z} \times \mathbb{R} \cup \mathbb{R} \times \mathbb{Z} \subseteq \mathbb{R}^2$. The winding numbers of…

We present the theorem which determines, by a permutation, the cardinal ordering of fixed points for any orbit of a period doubling cascade. The inverse permutation generates the orbit and the symbolic sequence of the orbit is obtained as a…

We propose a major index statistic on 01-fillings of moon polyominoes which, when specialized to certain shapes, reduces to the major index for permutations and set partitions. We consider the set F(M, s; A) of all 01-fillings of a moon…

For a permutation $\pi$ the major index of $\pi$ is the sum of all indices $i$ such that $\pi_i > \pi_{i+1}$. It is well known that the major index is equidistributed with the number of inversions over all permutations of length $n$. In…

Matrix reordering is a task to permute the rows and columns of a given observed matrix such that the resulting reordered matrix shows meaningful or interpretable structural patterns. Most existing matrix reordering techniques share the…

We study a new random matrix ensemble $X$ which is constructed by an application of a two dimensional linear filter to a matrix of iid random variables with infinite fourth moments. Our result gives asymptotic lower and upper bounds for the…

We study a graded vector space of polynomials associated to a square matrix, defined by a finite difference condition along the rows. We show this space coincides with one defined by directional derivatives, and prove it is…

The principal permanent rank characteristic sequence is a binary sequence $r_0 r_1 \ldots r_n$ where $r_k = 1$ if there exists a principal square submatrix of size $k$ with nonzero permanent and $r_k = 0$ otherwise, and $r_0 = 1$ if there…

An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to…

An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.

Let $A$ be a reciprocal matrix of order $n$ and $w$ be its Perron eigenvector. To infer the efficiency of $w$ for $A$, based on the principle of Pareto optimal decisions, we study the strong connectivity of a certain digraph associated with…

We investigate the structure of graphs of twin-width at most $1$, and obtain the following results: - Graphs of twin-width at most $1$ are permutation graphs. In particular they have an intersection model and a linear structure. - There is…

Preconditioning has long been a staple technique in optimization, often applied to reduce the condition number of a matrix and speed up the convergence of algorithms. Although there are many popular preconditioning techniques in practice,…