Related papers: The Magic of Permutation Matrices: Categorizing, C…
The paper discusses progress in understanding statistical properties of complex eigenvalues (and corresponding eigenvectors) of weakly non-unitary and non-Hermitian random matrices. Ensembles of this type emerge in various physical…
In the paper, we consider the class of so-called endo-commutative algebras. From the identity imposed to specify this class, one can easily see that the product in this class preserves the square of elements. We give a complete…
We characterize real and complex functions which, when applied entrywise to square matrices, yield a positive definite matrix if and only if the original matrix is positive definite. We refer to these transformations as sign preservers.…
Permutation polynomials have been a subject of study for a long time and have applications in many areas of science and engineering. However, only a small number of specific classes of permutation polynomials are described in the literature…
The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…
Let $(\Gamma,+)$ be an Abelian group of order $n^2$ and MS$_{\Gamma}(n)$ be an $n\times n$ array whose entries are all elements of $\Gamma$. Then MS$_{\Gamma}(n)$ is a $\Gamma$-magic square if all row, column, main and backward main…
Idempotent elements play a fundamental role in ring theory, as they encode significant information about the underlying algebraic structure. In this paper, we study idempotent matrices from two perspectives. First, we analyze the partially…
We introduce the notion of a weighted inversion statistic on the symmetric group, and examine its distribution on each conjugacy class. Our work generalizes the study of several common permutation statistics, including the number of…
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…
Geometric grid classes of permutations have proven to be key in investigations of classical permutation pattern classes. By considering the representation of gridded permutations as words in a trace monoid, we prove that every geometric…
We prove refined enumeration results on several symmetry classes as well as related classes of alternating sign matrices with respect to classical boundary statistics, using the six-vertex model of statistical physics. More precisely, we…
Discrete (family) symmetries might play an important role in models of elementary particle physics. We discuss the origin of such symmetries in the framework of consistent ultraviolet completions of the standard model in field and string…
This paper investigates a novel connection between reductions of companion matrices associated with a symmetric family of certain binomial ideals in the coordinate ring of affine n-space and permutation matrices. Specifically, for fixed…
We find by applying MacMahon's partition analysis that all magic labellings of the cube are of eight types, each generated by six basis elements. A combinatorial proof of this fact is given. The number of magic labellings of the cube is…
We consider spectra of $n$-by-$n$ irreducible tridiagonal matrices over a field and of their $n-1$-by-$n-1$ trailing principal submatrices. The real symmetric and complex Hermitian cases have been fully understood: it is necessary and…
Diagonalization, or eigenvalue decomposition, is very useful in many areas of applied mathematics, including signal processing and quantum physics. Matrix decomposition is also a useful tool for approximating matrices as the product of a…
The structured pseudospectra of a matrix A are sets of complex numbers that are eigenvalues of matrices X which are near to A and have the same entries as A at a fixed set of places. The sum of multiplicities of the eigenvalues of X inside…
A magic square of order $n$ with all subsquares of possible orders (ASMS$(n)$) is a magic square which contains a general magic square of each order $k\in\{3, 4, \cdots, n-2\}$. Since the conjecture on the existence of an ASMS was proposed…
In this paper we have established relations of the genetic tables with magic and bimagic squares. Connections with Hamming distances, binomial coefficients are established. The idea of Gray code is applied. Shannon entropy of magic squares…
Alternating sign matrices and totally symmetric self-complementary plane partitions are equinumerous sets of objects for which no explicit bijection is known. In this paper, we identify a subset of totally symmetric self-complementary plane…