Related papers: On Self-Descriptive Squares
Two square matrices of (arbitrary) order N are introduced. They are defined in terms of N arbitrary numbers z_{n}, and of an arbitrary additional parameter (a respectively q), and provide finite-dimensional representations of the two…
The higher rank numerical ranges of generic matrices are described in terms of the components of their Kippenhahn curves. Cases of tridiagonal (in particular, reciprocal) 2-periodic matrices are treated in more detail.
We show that the averaged characteristic polynomial and the averaged inverse characteristic polynomial, associated with Hermitian matrices whose elements perform a random walk in the space of complex numbers, satisfy certain partial…
Random matrix theory is a well-developed area of probability theory that has numerous connections with other areas of mathematics and its applications. Much of the literature in this area is concerned with matrices that possess many exact…
Random matrices arise in many mathematical contexts, and it is natural to ask about the properties that such matrices satisfy. If we choose a matrix with integer entries at random, for example, what is the probability that it will have a…
Dirichlet integrals and the associated Dirichlet statistical densities are widely used in various areas. Generalizations of Dirichlet integrals and Dirichlet models to matrix-variate cases, when the matrices are real symmetric positive…
We develop several methods, based on the geometric relationship between the eigenspaces of a matrix and its adjoint, for determining whether a square matrix having distinct eigenvalues is unitarily equivalent to a complex symmetric matrix.…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…
Graph matrices are a type of matrix which has played a crucial role in analyzing the sum of squares hierarchy on average case problems. However, except for rough norm bounds, little is known about graph matrices. In this paper, we take a…
A recurrence equation is a discrete integrable equation whose solutions are all periodic and the period is fixed. We show that infinitely many recurrence equations can be derived from the information about invariant varieties of periodic…
We consider nonnormal matrix-valued dynamical systems with discrete time. For an eigenvalue of matrix, the number of times it appears as a root of the characteristic polynomial is called the algebraic multiplicity. On the other hand, the…
For given k distinct complex conjugate pairs, l distinct real numbers, and a given graph G on 2k+l vertices with a matching of size at least k, we will show that there is a real matrix whose eigenvalues are the given numbers and its graph…
A map of a set to itself admits a representation by a graph with vertices being the elements of the set and an edge between every vertex and its image. Communities defined as the maximal connected components are uni-cyclic. The…
A natural family of quantized matrix algebras is introduced. It includes the two best studied such. Located inside ${\s U}_q(A_{2n-1})$, it consists of quadratic algebras with the same Hilbert series as polynomials in $n^2$ variables. We…
We bring in some new notions associated with $2\times 2$ block positive semidefinite matrices. These notions concern the inequalities between the singular values of the off diagonal blocks and the eigenvalues of the arithmetic mean or…
A classical approach for surface classification is to find a compact algebraic representation for each surface that would be similar for objects within the same class and preserve dissimilarities between classes. We introduce Self…
In the present work, we exhibit a class of self-descriptive sequences that can be explicitly computed and whose frequencies are known. In particular, as a corollary of our main result, we prove that the sequence introduced in \citeBJM23 has…
Some eigenvalue matrix models possess an interesting property: one can manifestly define the basis where all averages can be explicitly calculated. For example, in the Gaussian Hermitian and rectangular complex models, averages of the Schur…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
An iterative square root of a function $f$ is a function $g$ such that $g(g(\cdot))=f(\cdot)$. We obtain new characterizations for detecting the non-existence of such square roots for self-maps on arbitrary sets. This is used to prove that…