To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Let $\mathbb {F}$ be either $\mathbb {R}$ or $\mathbb {C}$, and put $d_{\mathbb {F}}=\dim _{\mathbb {R}}\mathbb {F}$. Let $A_m\in \mathbb {F}^{N_m\times m}$ have independent standard Gaussian entries and assume $N_m/m\to \gamma>1$. We determine the exponential scale of the smallest least singular value among all square row submatrices:
With $c_\gamma =\gamma ^\gamma /(\gamma -1)^{\gamma -1}$, we prove $m^{-1}\log M_m^{\mathbb {F}}\xrightarrow {P}-d_{\mathbb {F}}^{-1}\log c_\gamma $ and, when $N_m=\gamma m+O(1)$, the convergence holds at rate $O(m^{-1})$. As an application, for real phase retrieval at the critical number $N=2m-1$ of measurements, the Balan–Wang stability parameter satisfies $\omega (A_m)=4^{-m+o_P(m)}$, so the sharp exponential base in the Gaussian Balan–Wang problem is $1/4$. The lower estimate extends to all bounded-density ensembles and continuity is necessary.
We study the number $M_n(T)$ of integer $n\times n$ matrices A with entries bounded in absolute value by T such that the Galois group of the characteristic polynomial of A is not the full symmetric group $S_n$. One knows $M_n(T) \gg T^{n^2 - n + 1} \log T$, which we conjecture is sharp. We first use the large sieve to get $M_n(T) \ll T^{n^2 - 1/2}\log T$. Using Fourier analysis and the geometric sieve, as in Bhargava’s proof of van der Waerden’s conjecture, we improve this bound for some classes of A.
This article studies an analog of the classical eigenvalue–eigenvector identity for dual Hermitian matrices. The classical identity relates the eigenvalues of a Hermitian matrix, the eigenvalues of its principal submatrices, and the entries of its eigenvectors. Assuming that the standard eigenvalues are simple, we establish the corresponding identity for dual Hermitian matrices and show that it naturally decomposes into a standard component and a dual component. The standard component recovers the classical Hermitian identity, while the dual component yields an explicit first-order correction formula relating eigenvalue and eigenvector corrections to perturbations of the corresponding principal submatrices. Numerical examples are presented to verify the theoretical results.
Substantially extending previous results of the authors for smooth solutions in the viscous case, we develop linear damping estimates for periodic roll-wave solutions of the inviscid Saint-Venant equations and related systems of hyperbolic balance laws. Such damping estimates, consisting of $H^s$ energy estimates yielding exponential slaving of high-derivative to low-derivative norms, have served as crucial ingredients in nonlinear stability analyses of traveling waves in hyperbolic or partially parabolic systems, both in obtaining high-frequency resolvent estimates and in closing a nonlinear iteration for which available linearized stability estimates apparently lose regularity. Here, we establish for systems of size $n\leq 6$ a Lyapunov-type theorem stating that such energy estimates are available whenever strict high-frequency spectral stability holds; for dimensions $7$ and higher, there may be in general a gap between high-frequency spectral stability and existence of the type of energy estimate that we develop here. A key ingredient is a dimension-dependent linear algebraic lemma reminiscent of Lyapunov’s Lemma for ODE that is to our knowledge new.
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.
We say that a semigroup of matrices has a submultiplicative spectrum if the spectrum of the product of any two elements of the semigroup is contained in the product of the two spectra in question (as sets). In this note, we explore an approximate version of this condition.
This paper investigates structural changes in the parameters of first-order autoregressive (AR) models by analyzing the edge eigenvalues of the precision matrices. Specifically, edge eigenvalues in the precision matrix are observed if and only if there is a structural change in the AR coefficients. We show that these edge eigenvalues correspond to the zeros of a determinantal equation. Additionally, we propose a consistent estimator for detecting outliers within the panel time series framework, supported by numerical experiments.
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}$.
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
Williamson’s theorem states that for any $2n \times 2n$ real positive definite matrix A, there exists a $2n \times 2n$ real symplectic matrix S such that $S^TAS=D \oplus D$, where D is an $n\times n$ diagonal matrix with positive diagonal entries known as the symplectic eigenvalues of A. Let H be any $2n \times 2n$ real symmetric matrix such that the perturbed matrix $A+H$ is also positive definite. In this paper, we show that any symplectic matrix $\tilde {S}$ diagonalizing $A+H$ in Williamson’s theorem is of the form $\tilde {S}=S Q+\mathcal {O}(\|H\|)$, where Q is a $2n \times 2n$ real symplectic as well as orthogonal matrix. Moreover, Q is in symplectic block diagonal form with the block sizes given by twice the multiplicities of the symplectic eigenvalues of A. Consequently, we show that $\tilde {S}$ and S can be chosen so that $\|\tilde {S}-S\|=\mathcal {O}(\|H\|)$. Our results hold even if A has repeated symplectic eigenvalues. This generalizes the stability result of symplectic matrices for non-repeated symplectic eigenvalues given by Idel, Gaona, and Wolf [Linear Algebra Appl., 525:45–58, 2017].
As an extension of Sylvester’s matrix, a tridiagonal matrix is investigated by determining both left and right eigenvectors. Orthogonality relations between left and right eigenvectors are derived. Two determinants of the matrices constructed by the left and right eigenvectors are evaluated in closed form.
We first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a fractional perfect matching. Then, we determine an upper bound on the distance spectral radius of a graph G to ensure that G has a fractional perfect matching. Furthermore, we construct some extremal graphs to show all the bounds are best possible.
A $D_{\infty }$-topological Markov chain is a topological Markov chain provided with an action of the infinite dihedral group $D_{\infty }$. It is defined by two zero-one square matrices A and J satisfying $AJ=JA^{\textsf {T}}$ and $J^2=I$. A flip signature is obtained from symmetric bilinear forms with respect to J on the eventual kernel of A. We modify Williams’ decomposition theorem to prove the flip signature is a $D_{\infty }$-conjugacy invariant. We introduce natural $D_{\infty }$-actions on Ashley’s eight-by-eight and the full two-shift. The flip signatures show that Ashley’s eight-by-eight and the full two-shift equipped with the natural $D_{\infty }$-actions are not $D_{\infty }$-conjugate. We also discuss the notion of $D_{\infty }$-shift equivalence and the Lind zeta function.
Motivated by considerations of the quadratic orthogonal bisectional curvature, we address the question of when a weighted graph (with possibly negative weights) has nonnegative Dirichlet energy.
We show that the elements of the dual of the Euclidean distance matrix cone can be described via an inequality on a certain weighted sum of its eigenvalues.
A celebrated theorem of Douglas Lind states that a positive real number is equal to the spectral radius of some integral primitive matrix, if and only if, it is a Perron algebraic integer. Given a Perron number p, we prove that there is an integral irreducible matrix with spectral radius p, and with dimension bounded above in terms of the algebraic degree, the ratio of the first two largest Galois conjugates, and arithmetic information about the ring of integers of its number field. This arithmetic information can be taken to be either the discriminant or the minimal Hermite-like thickness. Equivalently, given a Perron number p, there is an irreducible shift of finite type with entropy $\log (p)$ defined as an edge shift on a graph whose number of vertices is bounded above in terms of the aforementioned data.
We prove an analogue of Alon’s spectral gap conjecture for random bipartite, biregular graphs. We use the Ihara–Bass formula to connect the non-backtracking spectrum to that of the adjacency matrix, employing the moment method to show there exists a spectral gap for the non-backtracking matrix. A by-product of our main theorem is that random rectangular zero-one matrices with fixed row and column sums are full rank with high probability. Finally, we illustrate applications to community detection, coding theory, and deterministic matrix completion.
We investigate a class of generalised stochastic complex matrices constructed from the class of all doubly stochastic matrices and a special class of circulant matrices. We determine the exact values of the structured singular values of all matrices in the class in terms of the constant row (column) sum.
We provide a description of the spectrum and compute the eigenvalues distribution of circulant Hankel matrices obtained as symmetrization of classical Toeplitz circulant matrices. Other types of circulant matrices such as simple and Cesàro circulant matrices are also considered.
Associated with every $2n\times 2n$ real positive definite matrix $A,$ there exist n positive numbers called the symplectic eigenvalues of $A,$ and a basis of $\mathbb {R}^{2n}$ called the symplectic eigenbasis of A corresponding to these numbers. In this paper, we discuss differentiability and analyticity of the symplectic eigenvalues and corresponding symplectic eigenbasis and compute their derivatives. We then derive an analogue of Lidskii’s theorem for symplectic eigenvalues as an application.