Related papers: Weighted Shift Matrices: Unitary Equivalence, Redu…
We extend the author's formula (2011) of weighted counting of inversions on permutations to the one on alternating sign matrices. The proof is based on the sequential construction of alternating sign matrices from the unit matrix recently…
The linear codes with a few weights have been applied widely in combinatorial designs, secret sharing, association schemes, authentication codes and strongly regular graphs. In this paper, we first correct an erroneous result about the…
We generalise the result of Berger and Shaw the trace formula for Hardy Hilbert space to a larger class of rotation invariant Hilbert function spaces on the unit disk. We also demonstrate many meaningful examples of these Hilbert spaces by…
Weighted discrete Hilbert transforms $(a_n)_n \mapsto \big(\sum_n a_n v_n/(\lambda_j-\gamma_n)\big)_j$ from $\ell^2_v$ to $\ell^2_w$ are considered, where $\Gamma=(\gamma_n)$ and $\Lambda=(\lambda_j)$ are disjoint sequences of points in the…
We study real numbers defined by multidimensional automatic arrays weighted by multiplicatively independent bases. Let $a_1, \dots, a_r\geq 2$ be integers such that $\log a_1, \dots, \log a_r$ are $\mathbb Q$-linearly independent. Given…
The article is devoted to different aspects of the question "What can be done with a matrix by low rank perturbation?" It is proved that one can change a geometrically simple spectrum drastically by a rank 1 permutation, but the situation…
A uniform recursive tree on $n$ vertices is a random tree where each possible $(n-1)!$ labeled recursive rooted tree is selected with equal probability. In this paper we introduce and study weighted trees, a non-uniform recursive tree model…
We show that a perturbation of any fixed square matrix D by a random unitary matrix is well invertible with high probability. A similar result holds for perturbations by random orthogonal matrices; the only notable exception is when D is…
$ \newcommand{\schs}{\scriptstyle{\mathsf{S}}_1} $For all $n \ge 1$, we give an explicit construction of $m \times m$ matrices $A_1,\ldots,A_n$ with $m = 2^{\lfloor n/2 \rfloor}$ such that for any $d$ and $d \times d$ matrices…
Let $n,k$ be fixed natural numbers with $1\le k\le n$ and let $A_{n+1,k,2k,\dots,sk}$ denote an $(n+1)\times (n+1)$ complex multidiagonal matrix having $s=[n/k]$ sub- and superdiagonals at distances $k,2k,\dots,sk$ from the main diagonal.…
This article aims to initiate a study of bilateral weighted backward shift operators defined on the spaces $\ell^p_{a,b}(\Omega_{r,R})$ and $c_{0,a,b}(\Omega_{r,R})$ which are Banach spaces of analytic functions on a suitable annulus in the…
Two matrices $A$ and $B$ are called unitary (resp. orthogonal) equivalent if $AU=VB$ for two unitary (resp. orthogonal) matrices $U$ and $V$. Using trace identities, criteria are given for simultaneous unitary, orthogonal or complex…
This paper presents a framework based on matrices of monoids for the study of coupled cell networks. We formally prove within the proposed framework, that the set of results about invariant synchrony patterns for unweighted networks also…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
In this paper, we establish a bijection between the set of mutation classes of mutation-cyclic skew-symmetric integral 3x3-matrices and the set of triples of integers (a,b,c) which are all greater than 1 and where the product of the two…
In this paper we characterize the nonnegative irreducible tridiagonal matrices and their permutations, using certain entries in their primitive idempotents. Our main result is summarized as follows. Let $d$ denote a nonnegative integer. Let…
We derive weighted summation identities involving the second order recurrence sequence $\{w_n\} =\{ w_n(a,b; p, q)\}$ defined by $w_0 = a,\,w_1 = b;\,w_n = pw_{n - 1} - qw_{n - 2}\, (n \ge 2)$, where $a$, $b$, $p$ and $q$ are arbitrary…
A formal n-square is the set of positions in an square matrix of size n. A shuffle of a formal n-square consists of independent rotations of each row and of each column. A key result turns out to be valid at least for n <= 34 and n = 37:…
Low-rank matrix completion is an important problem with extensive real-world applications. When observations are uniformly sampled from the underlying matrix entries, existing methods all require the matrix to be incoherent. This paper…
We introduce the notion of a standard weighted graph and show that every weighted graph has an essentially unique standard model. Moreover we classify birational transformations between such models. Our central result shows that these are…