Related papers: Guo's index for some classes of matrices
A method to generate new classes of random matrix ensembles is proposed. Random matrices from these ensembles are Lax matrices of classically integrable systems with a certain distribution of momenta and coordinates. The existence of an…
A random matrix with rows distributed as a function of their length is said to be isotropic. When these distributions are Gaussian, beta type I, or beta type II, previous work has, from the viewpoint of integral geometry, obtained the…
The spectral gap $\gamma$ of an ergodic and reversible Markov chain is an important parameter measuring the asymptotic rate of convergence. In applications, the transition matrix $P$ may be unknown, yet one sample of the chain up to a fixed…
For enumerative problems, i.e. computable functions f from N to Z, we define the notion of an effective (or closed) formula. It is an algorithm computing f(n) in the number of steps that is polynomial in the combined size of the input n and…
A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…
Determining the minimum genus of a graph is a fundamental optimisation problem in the study of network design and implementation as it gives a measure of non-planarity of graphs. In this paper, we are concerned with determining the smallest…
The behavior of fermionic systems depends on the geometry of the system and the symmetry class of the Hamiltonian and observables. Almost commuting matrices arise from band-projected position observables in such systems. One expects the…
A Hamiltonian embedding is an embedding of a graph $G$ such that the boundary of each face is a Hamiltonian cycle of $G$. It is shown that the hypercube graph $Q_n$ admits such an embedding on an orientable surface when $n$ is a power of 2.…
We define a random commuting $d$-tuple of $n$-by-$n$ matrices to be a random variable that takes values in the set of commuting $d$-tuples and has a distribution that is a rapidly decaying continuous weight on this algebraic set. In the…
Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…
We give a formula for the determinant of an $n\times n$ matrix with entries from a commutative ring with unit. The formula can be evaluated by a "straight-line program" performing only additions, subtractions and multiplications of ring…
We study the functions that count matrices of given rank over a finite field with specified positions equal to zero. We show that these matrices are $q$-analogues of permutations with certain restricted values. We obtain a simple closed…
In this note, we define a Gaussian probability distribution over matrices. We prove some useful properties of this distribution, namely, the fact that marginalization, conditioning, and affine transformations preserve the matrix Gaussian…
We classify all cyclotomic matrices over the Eisenstein and Gaussian integers, that is, all Hermitian matrices over the Eisenstein and Gaussian integers that have all their eigenvalues in the interval [-2, 2].
We consider the gauged free fermionic matrix model, for a single fermionic matrix. In the large $N$ limit this system describes a $c=1/2$ chiral fermion in $1+1$ dimensions. The Gauss' law constraint implies that to obtain a physical state,…
If every element of a matrix group is similar to a permutation matrix, then it is called a permutation-like matrix group. References [4], [5] and [6] showed that, if a permutation-like matrix group contains a maximal cycle such that the…
The Hultman numbers enumerate permutations whose cycle graph has a given number of alternating cycles (they are relevant to the Bafna-Pevzner approach to genome comparison and genome rearrangements). We give two new interpretations of the…
In this paper we completely describe the unital compressed commuting graph of the ring $\mathcal{M}_3(\mathrm{GF}(p))$ of $3 \times 3$ matrices over the finite prime field $\mathrm{GF}(p)$. To achieve this we combine methods from linear…
Given the complement of a hyperplane arrangement, let $\Gamma$ be the closure of the graph of the map inverting each of its defining linear forms. The characteristic polynomial manifests itself in the Hilbert series of $\Gamma$ in two…
Admissible chains of i-boxes are important combinatorial tools in the monoidal categorification of cluster algebras, as they provide seeds of the cluster algebra. In this paper, we explore the properties of maximal commuting families of…