In this article, we present an elementary proof of the Cartan decomposition theorem for the group $ \mathrm {Sp}(1, n) $. As an application, we determine the largest regular domain for discrete quaternionic hyperbolic groups acting on $ \mathbb {HP}^n $. Furthermore, we demonstrate that Bers’ simultaneous uniformization and Köebe’s retrosection theorem fail to hold for higher-dimensional quaternionic Kleinian groups.

Vertically symmetric alternating sign matrices (VSASMs) of order $2n+1$ are known to be equinumerous with lozenge tilings of a hexagon with side lengths $2n+2,2n,2n+2,2n,2n+2,2n$ and a central triangular hole of size $2$ that exhibit a cyclical as well as a vertical symmetry, but finding an explicit bijection proving this belongs to the most difficult problems in bijective combinatorics. Towards constructing such a bijection, we generalize the result by introducing certain natural extensions for both objects along with $n+3$ parameters and show that the multivariate generating functions with respect to these parameters coincide. This is a significant step from a constant number of equidistributed statistics to a linear number of statistics in n. The equinumeracy of VSASMs and the lozenge tilings is then an easy consequence of this result, which is obtained by specializing the generating functions to signed enumerations for both types of objects and then applying certain sign-reversing involutions. Another main result concerns the expansion of the multivariate generating function into symplectic characters as a sum over totally symmetric self-complementary plane partitions, which is in perfect analogy to the situation for ordinary ASMs where the Schur expansion can be written as a sum over totally symmetric plane partitions. This is exciting as it is reminiscent of the well-known Cauchy identity, and the Cauchy identity does have a bijective proof using the Robinson-Schensted-Knuth correspondence, and thus the result raises the question of whether there is a variation of the Robinson–Schensted–Knuth correspondence that does eventually lead to a bijective proof.

The aim of this paper is to illustrate both analytically and numerically the interplay of two fundamentally distinct non-Hermitian mechanisms in the deep subwavelength regime. Considering a parity-time symmetric system of one-dimensional subwavelength resonators equipped with two kinds of non-Hermiticity – an imaginary gauge potential and on-site gain and loss – we prove that all but two eigenmodes of the system pass through exceptional points and decouple. By tuning the gain-to-loss ratio, the system changes from a phase with unbroken parity-time symmetry to a phase with broken parity-time symmetry. At the macroscopic level, this is observed as a transition from symmetrical eigenmodes to condensated eigenmodes at one edge of the structure. Mathematically, it arises from a topological state change. The results of this paper open the door to the justification of a variety of phenomena arising from the interplay between non-Hermitian reciprocal and nonreciprocal mechanisms not only in subwavelength wave physics but also in quantum mechanics, where the tight-binding model coupled with the nearest neighbour approximation can be analysed with the same tools as those developed here.

Normal matrices, or matrices which commute with their adjoints, are of fundamental importance in pure and applied mathematics. In this paper, we study a natural functional on the space of square complex matrices whose global minimizers are normal matrices. We show that this functional, which we refer to as the non-normal energy, has incredibly well-behaved gradient descent dynamics: despite it being nonconvex, we show that the only critical points of the non-normal energy are the normal matrices, and that its gradient descent trajectories fix matrix spectra and preserve the subset of real matrices. We also show that, even when restricted to the subset of unit Frobenius norm matrices, the gradient flow of the non-normal energy retains many of these useful properties. This is applied to prove that low-dimensional homotopy groups of spaces of unit norm normal matrices vanish; for example, we show that the space of $d \times d$ complex unit norm normal matrices is simply connected for all $d \geq 2$. Finally, we consider the related problem of balancing a weighted directed graph – that is, readjusting its edge weights so that the weighted in-degree and out-degree are the same at each node. We adapt the non-normal energy to define another natural functional whose global minima are balanced graphs and show that gradient descent of this functional always converges to a balanced graph, while preserving graph spectra and realness of the weights. Our results were inspired by concepts from symplectic geometry and Geometric Invariant Theory, but we mostly avoid invoking this machinery and our proofs are generally self-contained.

The partial transposition from quantum information theory provides a new source to distill the so-called asymptotic freeness without the assumption of classical independence between random matrices. Indeed, a recent paper [10] established asymptotic freeness between partial transposes in the bipartite situation. In this paper, we prove almost sure asymptotic freeness in the general multipartite situation and establish a central limit theorem for the partial transposes.

For any integers x and y, let $(x, y)$ and $[x, y]$ stand for the greatest common divisor and the least common multiple of x and y, respectively. Let $a,b$ and n be positive integers, and let $S=\{x_1, \ldots , x_n\}$ be a set of n distinct positive integers. We denote by $(S^a)$ and $[S^a]$ the $n\times n$ matrices having the ath power of $(x_i,x_j)$ and $[x_i,x_j]$, respectively, as the $(i,j)$-entry. Bourque and Ligh [‘On GCD and LCM matrices’, Linear Algebra Appl. 174 (1992), 65–74] showed that if S is factor closed (that is, S contains all positive divisors of any element of S), then the GCD matrix $(S)$ divides the LCM matrix $[S]$ (written as $(S)\mid [S]$) in the ring $M_n({\mathbb Z})$ of $n\times n$ matrices over the integers. Hong [‘Divisibility properties of power GCD matrices and power LCM matrices’, Linear Algebra Appl. 428 (2008), 1001–1008] proved that $(S^a)\mid (S^b)$, $(S^a)\mid [S^b]$ and $[S^a]\mid [S^b]$ in the ring $M_{n}({\mathbb Z})$ when $a\mid b$ and S is a divisor chain (namely, there is a permutation $\sigma $ of order n such that $x_{\sigma (1)}\mid \cdots \mid x_{\sigma (n)}$). In this paper, we show that if $a\mid b$ and S is factor closed, then $(S^a)\mid (S^b)$, $(S^a)\mid [S^b]$ and $[S^a]\mid [S^b]$ in the ring $M_{n}({\mathbb Z})$. The proof is algebraic and p-adic. Our result extends the Bourque–Ligh theorem. Finally, several interesting conjectures are proposed.

We introduce a family of polynomials, which arise in three distinct ways: in the large N expansion of a matrix integral, as a weighted enumeration of factorizations of permutations, and via the topological recursion. More explicitly, we interpret the complex Grassmannian $\mathrm {Gr}(M,N)$ as the space of $N \times N$ idempotent Hermitian matrices of rank M and develop a Weingarten calculus to integrate products of matrix elements over it. In the regime of large N and fixed ratio $\frac {M}{N}$, such integrals have expansions whose coefficients count factorizations of permutations into monotone sequences of transpositions, with each sequence weighted by a monomial in $t = 1 - \frac {N}{M}$. This gives rise to the desired polynomials, which specialise to the monotone Hurwitz numbers when $t = 1$. These so-called deformed monotone Hurwitz numbers satisfy a cut-and-join recursion, a one-point recursion, and the topological recursion. Furthermore, we conjecture on the basis of overwhelming empirical evidence that the deformed monotone Hurwitz numbers are real-rooted polynomials whose roots satisfy remarkable interlacing phenomena. An outcome of our work is the viewpoint that the topological recursion can be used to “topologise” sequences of polynomials, and we claim that the resulting families of polynomials may possess interesting properties.

We compute the large size limit of the moment formula derived in [14] for the Hermitian Jacobi process at fixed time. Our computations rely on the polynomial division algorithm which allows to obtain cancellations similar to those obtained in [3, Lemma 3]. In particular, we identify the terms contributing to the limit and show they satisfy a double recurrence relation. We also determine explicitly some of them and revisit a special case relying on Carlitz summation identity for terminating $1$-balanced ${}_4F_3$ functions taken at unity.

We prove new statistical results about the distribution of the cokernel of a random integral matrix with a concentrated residue. Given a prime p and a positive integer n, consider a random $n \times n$ matrix $X_n$ over the ring $\mathbb{Z}_p$ of p-adic integers whose entries are independent. Previously, Wood showed that as long as each entry of $X_n$ is not too concentrated on a single residue modulo p, regardless of its distribution, the distribution of the cokernel $\mathrm{cok}(X_n)$ of $X_n$, up to isomorphism, weakly converges to the Cohen–Lenstra distribution, as $n \rightarrow \infty$. Here on the contrary, we consider the case when $X_n$ has a concentrated residue $A_n$ so that $X_n = A_n + pB_n$. When $B_n$ is a Haar-random $n \times n$ matrix over $\mathbb{Z}_p$, we explicitly compute the distribution of $\mathrm{cok}(P(X_n))$ for every fixed n and a non-constant monic polynomial $P(t) \in \mathbb{Z}_p[t]$. We deduce our result from an interesting equidistribution result for matrices over $\mathbb{Z}_p[t]/(P(t))$, which we prove by establishing a version of the Weierstrass preparation theorem for the noncommutative ring $\mathrm{M}_n(\mathbb{Z}_p)$ of $n \times n$ matrices over $\mathbb{Z}_p$. We also show through cases the subtlety of the “universality” behavior when $B_n$ is not Haar-random.

We obtain a system of identities relating boundary coefficients and spectral data for the one-dimensional Schrödinger equation with boundary conditions containing rational Herglotz–Nevanlinna functions of the eigenvalue parameter. These identities can be thought of as a kind of mini version of the Gelfand–Levitan integral equation for boundary coefficients only.

An element of a group is called reversible if it is conjugate to its own inverse. Reversible elements are closely related to strongly reversible elements, which can be expressed as a product of two involutions. In this paper, we classify the reversible and strongly reversible elements in the quaternionic special linear group $ \mathrm {SL}(n,\mathbb {H})$ and quaternionic projective linear group $ \mathrm {PSL}(n,\mathbb {H})$. We prove that an element of $ \mathrm {SL}(n,\mathbb {H})$ (resp. $ \mathrm {PSL}(n,\mathbb {H})$) is reversible if and only if it is a product of two skew-involutions (resp. involutions).

Fix $\alpha >0$. Then by Fejér's theorem $(\alpha (\log n)^{A}\,\mathrm {mod}\,1)_{n\geq 1}$ is uniformly distributed if and only if $A>1$. We sharpen this by showing that all correlation functions, and hence the gap distribution, are Poissonian provided $A>1$. This is the first example of a deterministic sequence modulo $1$ whose gap distribution and all of whose correlations are proven to be Poissonian. The range of $A$ is optimal and complements a result of Marklof and Strömbergsson who found the limiting gap distribution of $(\log (n)\, \mathrm {mod}\,1)$, which is necessarily not Poissonian.

For a partially specified stochastic matrix, we consider the problem of completing it so as to minimize Kemeny’s constant. We prove that for any partially specified stochastic matrix for which the problem is well defined, there is a minimizing completion that is as sparse as possible. We also find the minimum value of Kemeny’s constant in two special cases: when the diagonal has been specified and when all specified entries lie in a common row.

The walk matrix associated to an $n\times n$ integer matrix $\mathbf{X}$ and an integer vector $b$ is defined by ${\mathbf{W}} \,:\!=\, (b,{\mathbf{X}} b,\ldots, {\mathbf{X}}^{n-1}b)$. We study limiting laws for the cokernel of $\mathbf{W}$ in the scenario where $\mathbf{X}$ is a random matrix with independent entries and $b$ is deterministic. Our first main result provides a formula for the distribution of the $p^m$-torsion part of the cokernel, as a group, when $\mathbf{X}$ has independent entries from a specific distribution. The second main result relaxes the distributional assumption and concerns the ${\mathbb{Z}}[x]$-module structure.

The motivation for this work arises from an open problem in spectral graph theory, which asks to show that random graphs are often determined up to isomorphism by their (generalised) spectrum. Sufficient conditions for generalised spectral determinacy can, namely, be stated in terms of the cokernel of a walk matrix. Extensions of our results could potentially be used to determine how often those conditions are satisfied. Some remaining challenges for such extensions are outlined in the paper.

We derive a sufficient condition for a sparse random matrix with given numbers of non-zero entries in the rows and columns having full row rank. The result covers both matrices over finite fields with independent non-zero entries and $\{0,1\}$-matrices over the rationals. The sufficient condition is generally necessary as well.

We determine the characteristic polynomials of the matrices $[q^{\,j-k}+t]_{1\le \,j,k\le n}$ and $[q^{\,j+k}+t]_{1\le \,j,k\le n}$ for any complex number $q\not =0,1$. As an application, for complex numbers $a,b,c$ with $b\not =0$ and $a^2\not =4b$, and the sequence $(w_m)_{m\in \mathbb Z}$ with $w_{m+1}=aw_m-bw_{m-1}$ for all $m\in \mathbb Z$, we determine the exact value of $\det [w_{\,j-k}+c\delta _{jk}]_{1\le \,j,k\le n}$.

We obtain asymptotic formulas for the number of matrices in the congruence subgroup

$$\begin{align*}\Gamma_0(Q) = \left\{ A\in\operatorname{SL}_2({\mathbb Z}):~c \equiv 0 \quad\pmod Q\right\}, \end{align*}$$

Motivated by the work initiated by Chapman [‘Determinants of Legendre symbol matrices’, Acta Arith. 115 (2004), 231–244], we investigate some arithmetical properties of generalised Legendre matrices over finite fields. For example, letting $a_1,\ldots ,a_{(q-1)/2}$ be all the nonzero squares in the finite field $\mathbb {F}_q$ containing q elements with $2\nmid q$, we give the explicit value of the determinant $D_{(q-1)/2}=\det [(a_i+a_j)^{(q-3)/2}]_{1\le i,j\le (q-1)/2}$. In particular, if $q=p$ is a prime greater than $3$, then

$$ \begin{align*}\bigg(\frac{\det D_{(p-1)/2}}{p}\bigg)= \begin{cases} 1 & \mbox{if}\ p\equiv1\pmod4,\\ (-1)^{(h(-p)+1)/2} & \mbox{if}\ p\equiv 3\pmod4\ \text{and}\ p>3, \end{cases}\end{align*} $$

where $(\frac {\cdot }{p})$ is the Legendre symbol and $h(-p)$ is the class number of $\mathbb {Q}(\sqrt {-p})$.

We establish the asymptotic expansion in $\beta $ matrix models with a confining, off-critical potential in the regime where the support of the equilibrium measure is a finite union of segments. We first address the case where the filling fractions of these segments are fixed and show the existence of a $\frac {1}{N}$ expansion. We then study the asymptotics of the sum over the filling fractions to obtain the full asymptotic expansion for the initial problem in the multi-cut regime. In particular, we identify the fluctuations of the linear statistics and show that they are approximated in law by the sum of a Gaussian random variable and an independent Gaussian discrete random variable with oscillating center. Fluctuations of filling fractions are also described by an oscillating discrete Gaussian random variable. We apply our results to study the all-order small dispersion asymptotics of solutions of the Toda chain associated with the one Hermitian matrix model ($\beta = 2$) as well as orthogonal ($\beta = 1$) and skew-orthogonal ($\beta = 4$) polynomials outside the bulk.

Let A be an $n \times n$ symmetric matrix with $(A_{i,j})_{i\leqslant j}$ independent and identically distributed according to a subgaussian distribution. We show that

$$ \begin{align*}\mathbb{P}(\sigma_{\min}(A) \leqslant \varepsilon n^{-1/2} ) \leqslant C \varepsilon + e^{-cn},\end{align*} $$

where $\sigma _{\min }(A)$ denotes the least singular value of A and the constants $C,c>0 $ depend only on the distribution of the entries of A. This result confirms the folklore conjecture on the lower tail of the least singular value of such matrices and is best possible up to the dependence of the constants on the distribution of $A_{i,j}$. Along the way, we prove that the probability that A has a repeated eigenvalue is $e^{-\Omega (n)}$, thus confirming a conjecture of Nguyen, Tao and Vu [Probab. Theory Relat. Fields 167 (2017), 777–816].